Landin, P. 1966 The Next 700 Programming Languages. Comm. of the ACM 9 3.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the type theory behind object languages. ffl The language which is developed in this report contains a collection of OOPL mechanisms which are loosely based upon those of the following real life OOPLs: Smalltalk [15] C [28] Beta [20] Trellis Owl [27] Eiffel [24] and Self [29] ffl Landin [21] [22] was the first to propose functional languages as the basis for general programming language analysis. This work in this report originated in a GEC Marconi sponsored PhD undertaken by the author at Queen Mary and Westfield College, University of London, 1989 1994 [6] An edited version of ....

Landin, P. 1966 The Next 700 Programming Languages. Comm. of the ACM 9 3.

....of their expressive powers is a complex issue, mainly because of the lack of a sufficient formal framework and theory to do so. One attempt to this end, comparing the set of computable functions that a language can 23 represent is useless, since all languages in question are universal. Landin [20] first proposed the development of a formal framework for comparing programming languages. Studying relationships between programming languages and constructs he classified some constructs as essential and others inessential, also known as syntactic sugar. A common example of syntactic sugar is ....

Landin, P.J., "The next 700 programming languages", Commun ACM, no. 9(3), pp 157-166, 1966.

....1992; Mason and Talcott 1991a, 1992; Honsell, Mason, Smith, and Talcott 1995) by treating the combination of control and memory effects, and developing the semantic theory in a more abstract setting to better capture the essential features of program equivalence. We adopt the view proposed in (Landin 1966) that a programming language consists of expressions of the lambda calculus augmented with primitive operations. We call such languages languages. The primitive operations that we have in mind include not only basic constants, branching, and algebraic operations such as arithmetic and pairing, ....

Landin, P. J. (1966). The next 700 programming languages. Comm. ACM 9, 157--166.

....can also be seen as types denoting a set of values and the refinement relation can be compared with the subtype relation. 1 Introduction In Computer Science, Lambda Calculus (i.e. the subject of [Bar81] and [HS86] has been mainly used as the skeleton of functional programming languages [Lan64]. It has also been used as a higher order parameterization mechanism in some specification languages [ST91] In this paper we view calculus as both the applicative structure of a programming formalism and a low level specification formalism. Considered as a programming formalism, its operational ....

P. Landin. "The Next 700 Programming Languages". Comm. ACM, 9:157--166, 1964.

....eager implementation are ASF SDF [van Deursen et al. 1996] and Sisal [Cann 1992] Neither language is compiled via an abstract machine. There is a long tradition of eager higher order functional languages, which dates back to the implementation of Lisp [McCarthy 1960] and Landin s proposal ISWIM [Landin 1966]. Lisp was succeeded by Scheme [Rees and Clinger 1986] and ISWIM was an inspiration for ML [Gordon et al. 1978] which in turn was succeeded by Standard ML [Milner et al. 1990] Other eager higher order languages include Caml [Weis and Leroy 1993] which was implemented using the categorical ....

Landin, P. 1966. The next 700 programming languages. Commun. ACM 9, 3, 157--166.

....certain languages are considered to be more powerful than others with respect to the capability to express control and data structures. In the field of sequential languages there has been already since a long time a line of research aiming to formalize the notion of expressive power (Landin, 1966; Reynolds, 1970; Paterson and Hewitt, 1970; Chandra and Manna, 1975; Steele and Sussman, 1976; Reynolds, 1981; and Felleisen, 1990) The various approaches agree in considering a language L more expressive than L 0 if the constructs of L 0 can be translated in L without requiring a global ....

Landin, P.J. (1966), The next 700 programming languages, Communications of the ACM, 3 (9), 157--166.

....easy method of building functional parsers. Moreover, the method has the advantage over functional parser generators such as Ratatosk (Mogensen, 1993) and Happy (Gill Marlow, 1995) that one has the full power of a functional language available to define new combinators for special applications (Landin, 1966). It was realised early on (Wadler, 1990) that parsers form an instance of a monad , an algebraic structure from mathematics that has proved useful for addressing a number of computational problems (Moggi, 1989; Wadler, 1990; Wadler, 1992a; Wadler, 1992b) As well as being interesting from a ....

Landin, Peter. (1966). The next 700 programming languages. Communications of the ACM, 9(3).

....by NSF Grant DCR 8603453 and by a Digital Equipment Corporation Faculty Incentive Grant. Part of this author s work was done while an SERC Senior Visiting Fellow at the University of Edinburgh. 1. Introduction The ML language is a typed functional language roughly based on Landin s ISWIM [1]. It was originally designed in the mid 1970s as the metalanguage of Edinburgh LCF, a machine assisted reasoning system, and its features were in part motivated by its intended use to express proof tactics. However, these features made it an attractive vehicle for general purpose symbolic ....

P. J. Landin, "The next 700 programming languages," Comm. ACM, vol. 9, no. 3, pp. 157-166, 1966.

No context found.

Landin, P. J. (1966) The Next 700 Programming Languages. Communications of the ACM. 9, 3.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC