Parametric parameter passing \(\lambda\)-calculus
From MaRDI portal
Publication:1887148
DOI10.1016/j.ic.2003.08.003zbMath1082.68015OpenAlexW2153121732WikidataQ57722201 ScholiaQ57722201MaRDI QIDQ1887148
Luca Paolini, Simonetta Ronchi della Rocca
Publication date: 23 November 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2003.08.003
Related Items (7)
On the value of variables ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ The weak lambda calculus as a reasonable machine ⋮ Parametric \(\lambda \)-theories ⋮ Strong normalization from an unusual point of view ⋮ The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus ⋮ A Fresh Look at the λ-Calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus, its syntax and semantics
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- The duality of computation
- A CUCH-machine: The automatic treatment of bound variables
- The call-by-value λ-calculus: a semantic investigation
- Call-by-value Solvability
- The Mechanical Evaluation of Expressions
- Parallel reductions in \(\lambda\)-calculus
This page was built for publication: Parametric parameter passing \(\lambda\)-calculus