Skew confluence and the lambda calculus with letrec
From MaRDI portal
Publication:1849854
DOI10.1016/S0168-0072(01)00104-XzbMath1019.03011MaRDI QIDQ1849854
Publication date: 2 December 2002
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Related Items (13)
Compilation of extended recursion in call-by-value functional languages ⋮ Convergence in infinitary term graph rewriting systems is simple ⋮ Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction ⋮ 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 ⋮ Call-by-name extensionality and confluence ⋮ Unnamed Item ⋮ A calculus of open modules: call-by-need strategy and confluence ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An imperative pure calculus ⋮ Skew confluence and the lambda calculus with letrec ⋮ Computational Soundness of a Call by Name Calculus of Recursively-scoped Records
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Lambda calculus with explicit recursion
- Infinitary lambda calculus
- Skew confluence and the lambda calculus with letrec
- Order-incompleteness and finite lambda reduction models
- Relating graph and term rewriting via Böhm models
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Applying dispersion correction to numerical approximations of the two‐dimensional wave equation ‐ eigenproblems
- Interaction Systems I: The theory of optimal reductions
- Explicit substitutions
- Explicit cyclic substitutions
This page was built for publication: Skew confluence and the lambda calculus with letrec