P. Landin. A correspondence between algol 60 and church's lambda-notation. Comm. ACM, 8:2, 1965.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... to Plotkin s [D E] construction in his (equivalent) category of predomains and partial functions [Plo85] Moreover, this may be regarded as the formalisation of Landin s applicative order calculus, with abstraction used to protect expressions from evaluation, as illustrated extensively in [Lan64, Lan65, Bur75]. The intriguing point about these four constructions is that (1) and (2) are mathematically natural, yielding cartesian closure and monoidal closure in e.g. CPO and CPO respectively (the latter being analogous to partial functions over sets) while (3) and (4) are computationally natural, as ....

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda notation. Communications of the ACM, 8:89-101,158-165, 1965.

....degree of eager evaluation, supports lazy evaluation at the higher level of the intuitionistic types. One might say that this gives a rational reconstruction, in logical terms, of the standard method for implementing lazy evaluation on top of an eager evaluation strategy, as introduced by Landin [Lan65], and used in the SECD and CAM machines [Hen80, Hue90] This idea is standardly modelled in denotational semantics by lifting [Plo85] i.e. A ) B = A B where A B is the type of partial (or alternatively strict) functions. This account requires the presence of divergent programs; the Linear ....

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda notation. Communications of the ACM, 8:89--101,158--165, 1965.

....55] tends to impose a partial ordering v on the entities in a type. Higher order functions arise through an exponentiation operation on types. A variant models types by ideals in domains [43] A major benefit of this work is its support for the calculus in programming, as anticipated by Landin [36, 37] and McCarthy [45] An important recent advance is the second order polymorphic calculus, independently discovered by Reynolds [52] and Girard [10] In the types as predicates variant of the types as sets approach, types are taken to be predicates, which therefore denote sets (or some variant ....

Peter Landin. A correspondence between ALGOL60 and Church's lambda notation. Communications of the Association for Computing Machinery, 8(2):89--101, 1965.

....understood set of denotations. If these denotations are mathematical functions from input to output, the meaning of a program can be discussed independently of particular input values. This can make the task of proving implementations or other general results easier. Strachey and Landin [Lan64, Lan65] made major early steps towards denotational semantics; problems of program components whose denotations are functions of a type whose domain includes its own type posed foundational problems which were solved by Dana Scott. Scott actually discovered his models of re exive domains whilst in ....

P. J. Landin. A correspondence between ALGOL-60 and Church's lambda-notation. Parts I and II. Communications of the ACM, 8:89-101, 158-165, 1965.

....regard to dynamic extent. An example is Scheme s and ML s call with current continua1 The symbol is chosen for its similarity to an operating system prompt. Lisp s own prompt sign is usally unfortunately, that symbol is taken. 23 tion [5, 9, 54] 2 Like its historical forerunners J [31] and escape [41] call cc is a control reifier : it reifies the control information of a running program and gives it to the user. The user can reinstate this control information at any time, thus creating arbitrary context jumps. The goto and labels of Algol like languages provide a similar ....

....the model consists in suggesting that the model s continuations can also be provided at the level of the language itself, thereby creating a more powerful facility for nonlocal control manipulation than untagged or tagged abort. Indeed, the introduction of higher order control operators such as J [31], escape [41] and catch or call cc [54] is a recognition of this idea from abstract machines like the continuation model. This chapter will show that there is more advice to be gleaned from the continuation model: It suggests not only control packaging operators like call cc but also ....

P. J. Landin. A Correspondence between Algol 60 and Church's Lambda Notation. Communications of the ACM, 8(2):89--101; 158--165, 1965.

....effects. And we propose an effect type system to verify properties of etySECK programs. Our system analyzes memory effects as a property of programs and we can extend our system to analyze other effects. 1 Effect Typed Abstract Machine : etySECK The etySECK machine is a variant of Landin s SECD [1, 2, 3, 4] machine with type and effect annotations. The syntax and the semantics of the machine is described in Figure 1 and 2, respectively. Since the machine supports functional values, compilation from functional languages to this machine is not difficult. Throughout this paper, we use dot( as a list ....

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda-notation: Part II. Communications of the ACM, 8(3):158--165, March 1965.

....effects. And we propose an effect type system to verify properties of etySECK programs. Our system analyzes memory effects as a property of programs and we can extend our system to analyze other effects. 1 Effect Typed Abstract Machine : etySECK The etySECK machine is a variant of Landin s SECD [1, 2, 3, 4] machine with type and effect annotations. The syntax and the semantics of the machine is described in Figure 1 and 2, respectively. Since the machine supports functional values, compilation from functional languages to this machine is not difficult. Throughout this paper, we use dot( as a list ....

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda-notation: Part I. Communications of the ACM, 8(2):89--101, February 1965.

....is all type assumptions are of the form x : #. Then the rules Ax and Let simplify to #, x : # # x : # Ax # # N : # #, x : # # M : # # # (letx = NinM) # Let The let . in . construction is now obsolete and becomes only a mere syntactic convention, since the Landin translation [19]: letx = MinN = #x.N)M preserves all type derivations. The present section is devoted to the proof of the following: Fact 1 An ML term has the first order type derivation in the Damas Milner type system if and only if it is typable in the monomorphic system. Thus, there is no polymorphism ....

P. Landin, A Correspondence Between ALGOL 60 and Church's Lambda-Notation, Comm. ACM, 8 (2--3) (1965) 89--101, 158--165.

....in their compiler to eliminate the potential run time overhead of recursion. A recurring theme in DSP programming is the use of streams to represent discretetime signals. Streams were first proposed by Landin as a means of separating the control structure of Algol 60 loops from the loop body [84]. Landin represents a stream as a pair of the head element, and a nullary function representing the rest of the stream. Stream elements are thus evaluated when they are come to calculation of each successive loop control value and execution of the loop body proceed in an interleaved manner. ....

P.J. Landin. A correspondence between ALGOL60 and Church's lambda-notation: Part I. Communications of the ACM, 8:89--101, 1965.

....in their compiler to eliminate the potential run time overhead of recursion. A recurring theme in DSP programming is the use of streams to represent discretetime signals. Streams were first proposed by Landin as a means of separating the control structure of Algol 60 loops from the loop body [84]. Landin represents a stream as a pair of the head element, and a nullary function representing the rest of the stream. Stream elements are thus evaluated when they are come to calculation of each successive loop control value and execution of the loop body proceed in an interleaved manner. ....

P.J. Landin. A correspondence between ALGOL60 and Church's lambda-notation: Part I. Communications of the ACM, 8:89--101, 1965.

....Call with current continuation allows Scheme programmers to do that by creating a procedure that acts just like the current continuation. Most programming languages incorporate one or more specialpurpose escape constructs with names like exit, return, or even goto. In 1965, however, Peter Landin [21] invented a general purpose escape operator called the J operator. John Reynolds [32] described a simpler but equally powerful construct in 1972. The catch special form described by Sussman and Steele in the 1975 report on Scheme is exactly the same as Reynolds s construct, though its name came ....

Peter Landin. A correspondence between Algol 60 and Church's lambda notation: Part I. Communications of the ACM 8(2):89--101, February 1965.

....allows Scheme programmers to do that by creating a procedure that acts just like the current continuation. Most programming languages incorporate one or more special purpose escape constructs with names like exit, return,orevengoto.In 6. Standard procedures 33 1965, however, Peter Landin [16] invented a general purpose escape operator called the J operator. John Reynolds [24] described a simpler but equally powerful construct in 1972. The catch special form described by Sussman and Steele in the 1975 report on Scheme is exactly the same as Reynolds s construct, though its name came ....

Peter Landin. A correspondence between Algol 60 and Church's lambda notation: Part I. Communications of the ACM 8(2):89--101, February 1965.

.... also like to point out that our work o#ers evidence that Scott and Strachey were right, each in their own way, when they developed Denotational Semantics: Strachey in that the # calculus provides a proper medium for encoding at least traditional programming languages, as illustrated by Landin [21]; and Scott for organizing this encoding with types and domain theory. The resulting format of denotational semantics proves ideal to apply a six lines # calculus normalizer (using a higher order functional language) and obtain the front end of a semantics based compiler towards three address code ....

Peter J. Landin. A correspondence between Algol 60 and Church's lambda notation. Communications of the ACM, 8:89--101 and 158--165, 1965.

....addresses a smaller collection of systems, and provides modularized proofs of basic safety properties. 1 Introduction The quest for modular presentations of families of programming language features has a long history in the programming language community. Language designers since Landin [Lan65, Lan66] have understood how to view a multitude of high level constructs through the unifying lens of the lambda calculus. Further work has led to more structured approaches such as categorical semantics (e.g. Gun92, Mit96, Jac99] action semantics [Mos92] and monadic frameworks [Mog89] Using ....

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda-notation: Parts I and II. Communications of the ACM, 8(2,3):89--101, 158--165, February and March 1965.

....infinite objects in type theory given by Per Martin Lof in [ML90] We end up with a formal version of this extension of type theory followed by some theorems that explore the consequences of the definitions made as well as by some programming examples. Streams were introduced by Peter Landin in [Lan65] to account for lists where the evaluation of the different items of the list is postponed until these are actually needed. The purpose of their introduction was to find a correspondence in the lambda calculus for the list of values taken by the controlled variable of a for statement in Algol 60. ....

P. J. Landin. A Correspondence between Algol 60 and Church's Lambda Notation: part 1. Communications of the ACM, 8(2):89--100, 1965.

....of some proprietary algorithm) In our language a number sent to a process is just a number. Page 5 5. Futures to Channels Futures seem to provide once only communication, rather than the extended communication across channels of notations like CSP [Hoar 78] However, as Landin pointed out [Land 65] a value which is constructed piece by piece can be regarded as a stream of information rather than seen in its entirety. A future may be treated as a stream or channel communicating a value if it is bound to a tuple with two arguments, one the value, the second a further future representing the ....

P.J.Landin. A correspondence between Algol-60 and Church's Lambda notation. Comm. ACM 8, 2 pp.89-101.

....specification languages, formal semantics. Note: Partial support received from the Foundation for Computer Science Research in the Netherlands (SION) under project 612 17 418, Generic Tools for Program Analysis and Optimization . 1. Introduction Several models have been formulated [Lan65, JW93, AvGP92] which aim to reconcile the sideeffect free nature of functional languages with the inherently imperative nature of I O. This is a hard nut to crack, since the very purpose of I O is the effectuation of side effects. Side effects invalidate referential transparency, thereby ....

....significant sequentialization of operations, thereby opposing non determinism and lazy program evaluation [JW93] Most prominently, monadic I O is found to be a model which addresses these issues, and which has all desired operational and formal properties. The basis of the models described in [Lan65, JW93, AvGP92] including that of monadic I O, is a strict sequentialization of I O operations. Equational languages (we aren t aware of a generally accepted meaning of this phrase, so we use it loosely) such as OBJ ( GKK 88, KKM88] or ASF SDF ( BHK89] are closely related to functional ....

[Article contains additional citation context not shown here]

P.J. Landin. A correspondence between algol 60 and church's lambda-notation: Parts i and ii. Communications of the ACM, 8(2,3):89--101,158--165, February and March 1965.

....of computation in machines. Also, when considerations about typing are relevant, it is natural to use a calculus which can reflect the type structure of the programming language. For additional information between the relation of programming languages and some form of typed calculus, we refer to ([12], 7] The basic typed calculus of abstraction and application is called typed calculus with function types. This system is normally referred as . The calculus can be extended by adding cartesian products of types, together with the associated operation of pair construction h Delta; ....

LANDIN, P. A correspondence between ALGOL 60 and Church's lambda notation. Communications of the ACM, New York, v.8 n.2, p. 80-101, Feb. 1965.

....allows Scheme pro 34 Revised 5 Scheme grammers to do that by creating a procedure that acts just like the current continuation. Most programming languages incorporate one or more specialpurpose escape constructs with names like exit, return, or even goto. In 1965, however, Peter Landin [16] invented a general purpose escape operator called the J operator. John Reynolds [24] described a simpler but equally powerful construct in 1972. The catch special form described by Sussman and Steele in the 1975 report on Scheme is exactly the same as Reynolds s construct, though its name came ....

Peter Landin. A correspondence between Algol 60 and Church's lambda notation: Part I. Communications of the ACM 8(2):89--101, February 1965.

....retrospect it was another representation of a continuation. To be able to translate Algol 60 into applicative expressions, Landin later extended these expressions and their interpreter with an assignment operation, and also a control operator J used to express the translation of goto s and labels [15, 16]. In the extended SECD machine, the result of applying J was a value containing a dump. Thus, in modern terminology, the J operator provided a means of embedding continuations in values and was an ancestor of operations such as Reynolds s escape [36] and catch [44] and call cc [8] in Scheme. ....

....of his presentation included Dijkstra, Hoare, McCarthy, McIlroy, and Strachey, and other conference attendees included Bohm, Elgot, Landin and Nivat. But the idea didn t take hold. In particular, although Landin referred to van Wijngaarden s transformation in his own treatment of Algol 60 [15], he made no mention of the work when he heard F. L. Morris s colloquium in 1970. See Section 4. Moreover, Christopher Strachey never connected the work with Wadsworth s continuations, and did not cite van Wijngaarden in his own descriptions of the latter [42, 43] See Section 5. The ....

[Article contains additional citation context not shown here]

Landin, Peter J. A correspondence between ALGOL 60 and Church's lambda-notation. Communications of the ACM, 8, 2--3 (February-- March 1965) 89--101 and 158--165.

....and (optionally) removes it from the sequence. In addition to communication, a stream also provides a means of synchronization among threads. Upon reading an empty stream, a consumer becomes blocked; it may be resumed when a value is written to the stream. Streams were first used by Landin [60] to describe the semantics of loops in ALGOL60. Streams are also used in functional programming languages to represent historysensitive functions [9] Abelson, Sussman, and Sussman [3, ch. 3] demonstrate the use of streams and delayed evaluation to formulate useful programming abstractions. While ....

P. J. Landin. A correspondence between ALGOL 60 and Church's Lambda Notation: part 1. Communications of the ACM, 8(2):89--101, February 1965.

.... also like to point out that our work offers evidence that Scott and Strachey were right, each in their own way, when they developed Denotational Semantics: Strachey in that the calculus provides a proper medium for encoding at least traditional programming languages, as illustrated by Landin [47]; and Scott for organizing this encoding with types and domain theory. The resulting format of denotational semantics proves ideal to apply a six lines calculus normalizer (using a higher order functional language) and obtain the front end of a semantics based compiler towards three address code ....

Peter J. Landin. A correspondence between Algol 60 and Church's lambda notation. Communications of the ACM, 8:89--101 and 158--165, 1965.

.... also like to point out that our work offers evidence that Scott and Strachey were right, each in their own way, when they developed Denotational Semantics: Strachey in that the calculus provides a proper medium for encoding at least traditional programming languages, as illustrated by Landin [25]; and Scott for organizing this encoding with types and domain theory. The resulting format of denotational semantics proves ideal to apply a six lines calculus normalizer (using a higher order functional language) and obtain the front end of a semantics based compiler towards three address code ....

Peter J. Landin. A correspondence between Algol 60 and Church's lambda notation. Communications of the ACM, 8:89--101 and 158--165, 1965.

....PCF [13, 18] In any PCF program, the term ( x: 3) Q) may be replaced by 3 without changing the final answer; the optimization is merely an instance of the (fi) axiom. Indeed, because the calculus is a core language to which other languages can be translated (a method pioneered by Landin [10] and carried forward in denotational semantics) fi) and (j) can be used to deduce the soundness of many basic optimizations e.g. constant folding and inlining even in non functional languages. The (fi) and (j) axioms turn out to be fundamental in a technical sense: not only are they sound, ....

P. J. Landin. A correspondence between algol 60 and Church's lambda notation. Commun. ACM, 8:89--101; 158--165, 1965.

....features of translating Kid into P TAC are presented. 1 Introduction Modern (functional) languages are too complex to be given direct operational semantics. It is usually better to translate the source language into a simpler and smaller kernel language in order to explain its meaning precisely [11]. A program is said to be well formed if it can be translated into the kernel language, and if it satisfies certain other constraints such as type correctness. Operational or dynamic semantics is concerned only with well formed programs. All compilers do a similar translation into an ....

P. Landin. A Correspondence between Algol60 and Church's Lambda notation. Communications ACM, 8, 1965.

....into a well developed formalism for expressing operational semantics, the Vienna Definition Language. Wegner 72b, Ollongren 74] VDL has been used for describing PL I [LucasWalk 69] Basic [Lee 72] and a subset of SNOBOL4 [Pagan 78] An alternative direction was the work of Landin [Landin 64, Landin 65] showing that Algol like languages can be viewed as syntactic variations of the lambda calculus. His formalism was defined in terms of the abstract SECD machine. A special case of operational semantics is interpreting the meaning of a program with respect to an actual compiler or interpreter ....

P. Landin. A Correspondence Between ALGOL 60 and Church's Lambda Notation. Communications of the ACM 8(2,3):89-101, 158-165, Feb.-March, 1965.

....and in Section 8 we take a closer look at (the semantic domains for) types of order 2. The full abstraction proof itself is contained in Section 9. Section 10 discusses some variants of the language Alg and Section 11 contains some open questions. 2 Syntax of the Language Alg In the spirit of [7, 30] we define our Algol like language Alg as a subset of a simply typed calculus. Its types are given by the grammar : loc fi fi oe oe : fi fi ( oe) iexp fi fi cmd loc stands for location , iexp for integer expression and cmd for command . We let Type denote the set of ....

Peter J. Landin. A correspondence between Algol 60 and Church's lambda notation. Comm. ACM, 8:89--101,158--165, 1965.

....of input and output items, but use side effecting pseudo functions to get items from input streams or to put items into output streams. All these languages are not referentially transparent. Streams as a basis for the formal definition of input output were proposed as early as 1965 by Landin [Lan65] who used abstractions as non strict contexts for unevaluated parts of streams (his correspondence between Algol 60 and the calculus was based on an SECD machine extended with imperative features; thus the order of evaluation was defined through a call by value regime towards weak head ....

P. J. Landin. A Correspondence Between ALGOL 60 and Church's Lambda-Notation: Parts I/II. Communications of the ACM, 8(2/3):89--101:158--165, February/March 1965.

....and so becomes less of a bottleneck. To implement this kind of manager, one needs some kind of mechanism for saving the state of the process making a request. The basic observation of this paper is that such a mechanism already exists in the literature of applicative languages: the catch operator [14], 15] 21] 25] This operator allows us to write code for process saving procedures with little or no fuss. This leaves the third problem: protecting private data. It would do no good to write complex monitors if a user could bypass the manager and blithely get to the resource. The standard ....

....exclusions. In particular, we shall consider better ways to build a semaphore in Section 6. 4. Process saving with catch catch is an old addition to applicative languages. The oldest version known to the author is Landin s, who called it either pp (for program point ) 15] or J lambda [14]. 1 Reynolds [21] called it escape. A somewhat restricted form of catch exists in LISP 1.5, as errset [16] another version is found in MACLISP, as the pair catch and throw. The form we have adopted is Steele and Sussman s [25] which is similar to Reynolds . In SCHEME, catch is a binding ....

P.J. Landin. A correspondence between ALGOL 60 and Church's lambda-notation: Part I. Comm. ACM, 8:89--101, 1965.

....calculi either in the form of typeset collections of inference rules or as executable ML typecheckers. 1 Introduction The quest for modular presentations of families of programming language features has a long history in the programming languages community. Language designers since Landin [Lan65, Lan66] have understood how to view a multitude of high level constructs through the unifying lens of the lambda calculus. Further work has led to more structured approaches such as categorical semantics (e.g. Gun92, Mit96, Jac99] action semantics [Mos92] and monadic frameworks [Mog89] Using ....

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda-notation: Parts I and II. Communications of the ACM, 8(2,3):89--101, 158--165, February and March 1965.

....are defined, each combination of blocking non blocking and sequential parallel. Actors can also be grouped together either sequentially or in parallel and broadcasting is defined in several varieties, including futures. A UM [122, 123] is unusual in that it is based on stream semantics [74]. This gives a declarative system which is somewhat similar to the actors model but with explicit control over the order of messages and is relational rather than functional. It is designed to overcome some of the problems with concurrent object oriented logic programming. The computational model ....

P. J. Landin. A Correspondence between Algol 60 and Church's Lambda Notation: Part I. CACM, 8(2):89--101, 1965.

....of it when we wanted to make a jump. Typically, this would involve programming in the D.S. i.e. programming without thinking about continuations) but with certain special operators added to the language. For calculus like languages, there have been several operators: Landin s J operator [21], GEDANKEN s label values [30] Scheme s catch throw mechanism [36] and call cc operator [2] We follow Felleisen et al. [7] and use a form of the call cc operator, which we will denote C. Call cc is short for call with current continuation, and its function is to take the current continuation ....

P. Landin. A correspondence between ALGOL 60 and Church's lambda-notation (parts i&ii). Communications of the ACM, 8(2&3):89-- 101&158--165, 1965.

....derived from the calculus conform to the principles more strictly. This is not too surprising in hindsight: the approaches to programming language semantics from which the principles were derived mapped programs of conventional languages to expressions in (slightly modified) calculi (e.g. Lan65] It does not necessarily follow that languages designed according to the principles tend to be functional in nature 6 , but we conjecture that languages that are complete with respect to the principles also share many of the virtues of functional languages. By introducing additional design ....

P. J. Landin. A Correspondence Between ALGOL 60 and Church's Lambda-Notation: Parts I/II. Communications of the ACM, 8(2/3):89--101:158--165, February/March 1965.

....this view. In contrast to the first order operators described above, a higher order control operator such as Scheme s and ML s call with current continuation 1 can transfer control to arbitrary points in the program, not just to dynamically enclosing contexts. Like its historical forerunners J [15] and escape [19] call cc provides the user with a representation of the current control context: the rest of the program or the continuation . Invoking this continuation at any point in the program causes the program s current context to be replaced by the continuation s context. This ability ....

P.J. Landin. A Correspondence between Algol 60 and Church's Lambda Notation. Communications of the ACM, 8(2):89--101; 158--165, 1965.

....depth in the following sections. 2. 1 The 1960s Within computer science the term stream has been attributed to P J Landin (see [50] formulated during the development of operational constructs presented as part of his work on the correspondence between ALGOL 60 and the calculus (see [138] and [139]) Indeed, we note that P J Landin s original use for streams was to model the histories of loop variables, but he also observed that streams could have been used as a model for I O in ALGOL 60. The first type of SPSs that can be identified within the literature are dataflow systems that have ....

P J Landin. The Correspondence Between ALGOL 60 and Church's Lambda Notation: Part 1. Communications of the ACM, 8:89--101, 1965.

....in more depth in the following sections. 2. 1 The 1960s Within computer science the term stream has been attributed to P J Landin (see [50] formulated during the development of operational constructs presented as part of his work on the correspondence between ALGOL 60 and the calculus (see [138] and [139] Indeed, we note that P J Landin s original use for streams was to model the histories of loop variables, but he also observed that streams could have been used as a model for I O in ALGOL 60. The first type of SPSs that can be identified within the literature are dataflow systems that ....

P J Landin. The Correspondence Between ALGOL 60 and Church's Lambda Calculus: Part 2. Communications of the ACM, 8:158--165, 1965.

....There are two main styles of incorporating purely functional I O in modern functional languages. Some I O solutions are based on the notion of streams and others use some form of environments (these are also called side effecting I O systems [Gord93] The name stream was coined by Landin [Land65] and since then stream based I O systems have been developed which essentially transform an input stream into an output stream. A stream is basically a lazy list of data objects and this approach has been proposed in two flavours; token stream styles like in Miranda 1 , Haskell and the FUDGETS ....

P Landin, A Correspondence Between Algol 60 and Church's Lambda Calculus Notation. Comm. of ACM, 21(11), pp. 931-933, 1965.

....degree of eager evaluation, supports lazy evaluation at the higher level of the intuitionistic types. One might say that this gives a rational reconstruction, in logical terms, of the standard method for implementing lazy evaluation on top of an eager evaluation strategy, as introduced by Landin [Lan65], and used in the SECD and CAM machines [Hen80, Hue90] This idea is standardly modelled in denotational semantics by lifting [Plo85] i.e. A ) B = A B where A B is the type of partial (or alternatively strict) functions. This account requires the presence of divergent programs; the Linear ....

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda notation. Communications of the ACM, 8:89--101,158--165, 1965.

No context found.

Peter J. Landin, A Correspondence between ALGOL-60 and Church's Lambda Notation: Parts I and II, CACM, Vol. 8, pp. 89-101 & 158-165, 1965.

....when, and when not, it s safe to confuse a node of a DAG with its reachable sub DAG. Mile End Road, London E1 4NS, UK. E mail: P.Landin dcs.qmw.ac. uk 1 1 1 J J popped out onto the the third galleys of the 1965 CACM article A Correspondence between ALGOL 60 and Church s Lambda Notation [4]. So much for refereeing. Indeed, scrutiny of that paper seemed concerned only with whether a space should separate algol and 60 . It was a neat but semantically inessential packaging of the program closures that had been present in previous versions of that paper. J systemised three ....

....that they could hardly help not. The three separable actions were: capturing a calculational context, called a dump ; attaching a dump to construct a doctored function, called a programclosure ; and doctoring an application of such a function so as to override the natural continuation [4] of that application. Before rushing to any conclusion it must be noted that this use of the word is scarcely significant in the light of subsequent developments. Such a borrowing from ordinary language can certainly bear several meanings. A step of dump capturing embodied (i.e. reified) a dump ....

[Article contains additional citation context not shown here]

P. Landin. A correspondence between ALGOL 60 and Church's lambdanotation. Communications of the ACM, 8:89--101 and 158--165, 1965.

No context found.

P. Landin. A correspondence between algol 60 and church's lambda-notation. Comm. ACM, 8:2, 1965.

No context found.

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda notation: Part I. Communications of the ACM, 8(2):89--101, February 1965.

No context found.

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda-notation: Part II. Communications of the ACM, 8(3):158--165, March 1965.

No context found.

P. J. Landin. A correspondence between ALGOL 60 and Church's lambda-notation: Part I. Communications of the ACM, 8(2):89--101, February 1965.

No context found.

P. J. Landin. A correspondence between Algol 60 and Church's lambda notation. CACM, 8:89-101, 158-165, 1965.

No context found.

Landin, P.J.: A Correspondence Between ALGOL 60 and Church's LambdaNotation: Part I. Communications of the ACM 8, 2 (1965) 89--101.

No context found.

Landin, P., A Correspondence Between ALGOL 60 and Church's LambdaNotation: Part I. Comm. ACM, 8, 2 (1965), 1965.

No context found.

P. J. Landin. A correspondence between ALGOL-60 and Church's lambda-notation. Parts I and II. Communications of the ACM, 8:89--101, 158--165, 1965.

No context found.

Landin, P., A Correspondence Between ALGOL 60 and Church's Lambda-Notation: Part I. Comm. ACM, 8, 2 (1965), 1965.

No context found.

P.J. Landin, A correspondence between ALGOL 60 and Church's lambda-notation Part 1. Communications ACM 8.2 (1965) 89-101

First 50 documents  Next 50

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