Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
From MaRDI portal
Publication:4921510
DOI10.1016/S1571-0661(04)80874-0zbMath1262.68099MaRDI QIDQ4921510
Andrew M. Pitts, Claudio V. Russo, G. M. Bierman
Publication date: 10 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
68N18: Functional programming and lambda calculus
68Q55: Semantics in the theory of computing
03B40: Combinatory logic and lambda calculus
Related Items
Synthetic domain theory and models of linear Abadi {\&} Plotkin logic, Domain-theoretical models of parametric polymorphism, Bunched polymorphism
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