Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site crystal.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!uwvax!crystal!wu
From: wu@crystal.UUCP (T. Wu)
Newsgroups: net.lang,net.lang.st80
Subject: Computation model for object-oriented programming languages
Message-ID: <56@crystal.UUCP>
Date: Thu, 13-Mar-86 22:57:29 EST
Article-I.D.: crystal.56
Posted: Thu Mar 13 22:57:29 1986
Date-Received: Sat, 15-Mar-86 20:00:23 EST
Organization: U of Wisconsin CS Dept
Lines: 15
Keywords: computation model, programming language semantics
Xref: watmath net.lang:2223 net.lang.st80:330

I think we can roughly say that:

1) Applicative (functional) languages are based on the computation model
   of lambda calculus,
2) Logical languages are founded on the computation model of resolution-based
   theory proving.

Then what is the proper model for `object-oriented' programming languages ?

I would appreciate any kind of reply.
-- 
-----
Felix S.T. Wu 
{allegra,ihnp4,heurikon,seismo,uwm-evax}!uwvax!wu
wu@crys.wisc.edu