The next 700 programming languages
From MaRDI portal
Publication:5528159
DOI10.1145/365230.365257zbMath0149.12505OpenAlexW2134112335WikidataQ54002422 ScholiaQ54002422MaRDI QIDQ5528159
Publication date: 1966
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/365230.365257
Related Items
A simplifier for untyped lambda expressions, The origins of structural operational semantics, Adapting combinator and SECD machines to display snapshots of functional computations, A categorical interpretation of Landin's correspondence principle, Needed reduction and spine strategies for the lambda calculus, ProofScript: Proof Scripting for the Masses, Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs, Peter J. Landin (1930--2009), Pebble, a kernel language for modules and abstract data types, Personal recollections of Peter Landin: 1987-2009, The Peter Landin prize, An introduction to Landin's ``Getting rid of labels, On the structural simplicity of machines and languages, Remarks on R. D. Tennent's Language design methods based on semantic principles: Algol 68, a language designed using semantic principles, Balancing expressiveness in formal approaches to concurrency, Process calculi for biological processes, Tactics for mechanized reasoning: a commentary on Milner (1984) ‘The use of machines to assist in rigorous proof’, Semantically restricted argument dependencies, Unnamed Item, A survey of state vectors, Intensional computation with higher-order functions, Relative expressiveness of defeasible logics, Functional Semantics, Programming in the λ-Calculus: From Church to Scott and Back, The revised report on the syntactic theories of sequential control and state, A theory for program and data type specification, Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus, Capsules and Closures, Full abstraction for expressiveness: history, myths and facts, A glimpse into the paradise of combinatory algebra, Language design methods based on semantic principles, A theory of type polymorphism in programming, Types as graphs: Continuations in type logical grammar, A syntactic theory of sequential state, Unnamed Item, Functorial polymorphism, Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages, A meta-model of access control in a fibred security language, Lambda-dropping: Transforming recursive equations into programs with block structure, Concrete domains, A type-theoretical alternative to ISWIM, CUCH, OWHY, The complexity of type inference for higher-order typed lambda calculi, Higher-order functions for parsing, Computing with relational machines, Implementing metcast in Scheme
