Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion

DOI10.1016/S1571-0661(04)80874-0zbMath1262.68099OpenAlexW2045564677MaRDI QIDQ4921510

Andrew M. Pitts, G. M. Bierman, Claudio V. Russo

Publication date: 10 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80874-0

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Unnamed Item ⋮ Bunched polymorphism ⋮ Domain-theoretical models of parametric polymorphism ⋮ Synthetic domain theory and models of linear Abadi {\&} Plotkin logic ⋮ Relational Parametricity for Control Considered as a Computational Effect ⋮ Polymorphic lambda calculus with context-free session types ⋮ Program equivalence in linear contexts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational interpretations of linear logic
• Notions of computation and monads
• An operational semantics of sharing in lazy evaluation
• LCF considered as a programming language
• Operational interpretations of linear logic
• Proving congruence of bisimulation in functional programming languages
• Deriving a lazy abstract machine
• Parametric polymorphism and operational equivalence
• Program equivalence in a linear functional language
• Equivalence in functional languages with effects
• From Algol to polymorphic linear lambda-calculus

This page was built for publication: Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion