A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case

DOI10.1007/978-3-540-70590-1_22zbMath1145.68377MaRDI QIDQ3522027

Manfred Schmidt-Schauss, Elena Machkasova

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_22

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

68Q42: Grammars and rewriting systems

Related Items

Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec, A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Lambda calculus with explicit recursion
• Bisimilarity as a theory of functional programming
• Skew confluence and the lambda calculus with letrec
• Proving congruence of bisimulation in functional programming languages
• Computational Soundness of a Call by Name Calculus of Recursively-scoped Records
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
• Safety of Nöcker's strictness analysis
• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
• A non-deterministic call-by-need lambda calculus