Computational Soundness of a Call by Name Calculus of Recursively-scoped Records

DOI10.1016/J.ENTCS.2008.03.059zbMath1279.03058OpenAlexW2065404434MaRDI QIDQ2873682

Elena Machkasova

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

zbMATH Keywords

calculuscall-by-namecomputational soundnessrecursively-scoped records

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (2)

A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case ⋮ Computational Soundness of a Call by Name Calculus of Recursively-scoped Records

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

This page was built for publication: Computational Soundness of a Call by Name Calculus of Recursively-scoped Records