Computational Soundness of a Call by Name Calculus of Recursively-scoped Records
From MaRDI portal
Publication:2873682
DOI10.1016/j.entcs.2008.03.059zbMath1279.03058MaRDI QIDQ2873682
Publication date: 24 January 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.059
68N18: Functional programming and lambda calculus
03B70: Logic in computer science
68Q55: Semantics in the theory of computing
68Q42: Grammars and rewriting systems
Related Items
Computational Soundness of a Call by Name Calculus of Recursively-scoped Records, A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
Cites Work
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Lambda calculus with explicit recursion
- Skew confluence and the lambda calculus with letrec
- Computational Soundness of a Call by Name Calculus of Recursively-scoped Records
- A calculus of module systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item