Correspondence between ALGOL 60 and Church's Lambda-notation

DOI10.1145/363744.363749zbMATH Open0134.33403DBLPjournals/cacm/Landin65OpenAlexW2152944474WikidataQ54002417 ScholiaQ54002417MaRDI QIDQ5345264FDOQ5345264

Authors: Peter J. Landin 

Publication date: 1965

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/363744.363749

zbMATH Keywords

numerical analysis

Cited In (47)

• A category theory for programming languages
• Output driven interpretation of recursive programs, or writing creates and destroys data structures
• VDM semantics of programming languages: Combinators and monads
• The origins of structural operational semantics
• Computational interpretations of linear logic
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• An observationally complete program logic for imperative higher-order functions
• A functional computation model for the duality of two-variable lambda-Boolean functions
• A theory for nondeterminism, parallelism, communication, and concurrency
• Semantics of context-free languages
• Higher-order substitutions
• Title not available (Why is that?)
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
• Meaning and computing: two approaches to computable propositions
• A theory for program and data type specification
• A survey of state vectors
• The IO- and OI-hierarchies
• Peter J. Landin (1930--2009)
• A glimpse into the paradise of combinatory algebra
• A CUCH-machine: The automatic treatment of bound variables
• Hierarchical development of programming languages
• The semantics of second-order lambda calculus
• Title not available (Why is that?)
• Full abstraction for the second order subset of an Algol-like language
• A syntactic theory of sequential state
• Continuation-passing C, compiling threads to events through continuations
• An empirical study of on-line models for relational data streams
• Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
• Expressive power of typed and type-free programming languages
• Title not available (Why is that?)
• On procedures as open subroutines. II
• Fortifying macros
• Locally complete consistent F-augmented contexts: a category-theoretic representation of algebraic L-domains
• Language transformations in the classroom
• Polymorphic programming I. Another language designed on semantic principles
• Quantitative fuzzy semantics
• Title not available (Why is that?)
• A linear first-order functional intermediate language for verified compilers
• A categorical interpretation of Landin's correspondence principle
• SEMANOL (73), a metalanguage for programming the semantics of programming languages
• Pair grammars, graph languages and string-to-graph translations
• Program proving: KJumps and functions
• A functional programming approach to the specification and verification of concurrent systems
• The lambda-gamma calculus: A language adequate for defining recursive functions
• On the number of unary-binary tree-like structures with restrictions on the unary height
• Head reduction and normalization in a call-by-value lambda-calculus
• On the complexity of stream equality

Uses Software

• ALGOL 60

This page was built for publication: Correspondence between ALGOL 60 and Church's Lambda-notation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5345264)