Correspondence between ALGOL 60 and Church's Lambda-notation
From MaRDI portal
Publication:5345264
DOI10.1145/363744.363749zbMath0134.33403OpenAlexW2152944474WikidataQ54002417 ScholiaQ54002417MaRDI QIDQ5345264
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
Related Items
An empirical study of on-line models for relational data streams, A theory for nondeterminism, parallelism, communication, and concurrency, The origins of structural operational semantics, Semantics of context-free languages, A categorical interpretation of Landin's correspondence principle, Fortifying macros, Peter J. Landin (1930--2009), Meaning and computing: two approaches to computable propositions, A functional computation model for the duality of two-variable lambda-Boolean functions, Full abstraction for the second order subset of an Algol-like language, Unnamed Item, Unnamed Item, An observationally complete program logic for imperative higher-order functions, A Linear First-Order Functional Intermediate Language for Verified Compilers, Continuation-passing C, compiling threads to events through continuations, Unnamed Item, Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus, A functional programming approach to the specification and verification of concurrent systems, Unnamed Item, Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control, Hierarchical development of programming languages, The IO- and OI-hierarchies, Head reduction and normalization in a call-by-value lambda-calculus, A survey of state vectors, On the number of unary-binary tree-like structures with restrictions on the unary height, Computational interpretations of linear logic, A theory for program and data type specification, VDM semantics of programming languages: Combinators and monads, On procedures as open subroutines. II, SEMANOL (73), a metalanguage for programming the semantics of programming languages, A CUCH-machine: The automatic treatment of bound variables, A glimpse into the paradise of combinatory algebra, Call-by-name, call-by-value and the \(\lambda\)-calculus, Polymorphic programming I. Another language designed on semantic principles, Output driven interpretation of recursive programs, or writing creates and destroys data structures, Locally complete consistent F-augmented contexts: a category-theoretic representation of algebraic L-domains, A syntactic theory of sequential state, The semantics of second-order lambda calculus, The lambda-gamma calculus: A language adequate for defining recursive functions, Expressive power of typed and type-free programming languages, Quantitative fuzzy semantics, Program proving: KJumps and functions, Pair grammars, graph languages and string-to-graph translations, Higher-order substitutions, A category theory for programming languages, On the complexity of stream equality
Uses Software
