From Algol to polymorphic linear lambda-calculus
From MaRDI portal
Publication:5487826
DOI10.1145/331605.331611zbMath1094.68535OpenAlexW2044507549MaRDI QIDQ5487826
John C. Reynolds, Peter W. O'Hearn
Publication date: 12 September 2006
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/331605.331611
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
Automata-theoretic semantics of idealized Algol with passive expressions ⋮ The regular-language semantics of second-order idealized ALGOL ⋮ A Nominal Relational Model for Local Store ⋮ A fibrational framework for possible-world semantics of \textsc{Algol}-like languages ⋮ The essence of parallel Algol. ⋮ Monoidal indeterminates and categories of possible worlds ⋮ Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control ⋮ Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion ⋮ Monoidal Indeterminates and Categories of Possible Worlds ⋮ Enriching an Effect Calculus with Linear Types ⋮ Objects and classes in Algol-like languages
Uses Software
