The next 700 programming languages
From MaRDI portal
Cited in
(47)- Types as graphs: Continuations in type logical grammar
- A meta-model of access control in a fibred security language
- Adapting combinator and SECD machines to display snapshots of functional computations
- Needed reduction and spine strategies for the lambda calculus
- Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
- Pebble, a kernel language for modules and abstract data types
- Remarks on R. D. Tennent's Language design methods based on semantic principles: Algol 68, a language designed using semantic principles
- The revised report on the syntactic theories of sequential control and state
- A theory for program and data type specification
- Language design methods based on semantic principles
- A theory of type polymorphism in programming
- A syntactic theory of sequential state
- Concrete domains
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Lambda-dropping: Transforming recursive equations into programs with block structure
- Intensional computation with higher-order functions
- The origins of structural operational semantics
- On the structural simplicity of machines and languages
- Semantically restricted argument dependencies
- Tactics for mechanized reasoning: a commentary on Milner (1984) ‘The use of machines to assist in rigorous proof’
- ProofScript: proof scripting for the masses
- A glimpse into the paradise of combinatory algebra
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
- A survey of state vectors
- The complexity of type inference for higher-order typed lambda calculi
- Higher-order functions for parsing
- Relative expressiveness of defeasible logics
- Encoding the factorisation calculus
- Computing with relational machines
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus
- scientific article; zbMATH DE number 7056232 (Why is no real title available?)
- Functional semantics
- Programming in the λ-Calculus: From Church to Scott and Back
- Capsules and closures
- Full abstraction for expressiveness: history, myths and facts
- A simplifier for untyped lambda expressions
- A categorical interpretation of Landin's correspondence principle
- Personal recollections of Peter Landin: 1987-2009
- The Peter Landin prize
- An introduction to Landin's ``Getting rid of labels
- Process calculi for biological processes
- The far side of the cube. An elementary introduction to game semantics
- The functional machine calculus. III: Control
- Functorial polymorphism
- Implementing metcast in Scheme
- Peter J. Landin (1930--2009)
- Balancing expressiveness in formal approaches to concurrency
This page was built for publication: The next 700 programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5528159)
