CPS transformation of beta-redexes
From MaRDI portal
Publication:1041755
DOI10.1016/J.IPL.2005.02.002zbMath1182.68045OpenAlexW2095040554MaRDI QIDQ1041755
Lasse R. Nielsen, Olivier Danvy
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.02.002
functional programmingprogram derivationcontinuation-passing style (CPS)fischergeneralized reductionone-pass CPS transformationplotkintwo-level \(\lambda \)-calculus
Related Items (7)
A first-order one-pass CPS transformation ⋮ Probabilistic operational semantics for the lambda calculus ⋮ Mechanized Verification of CPS Transformations ⋮ De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case ⋮ De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case ⋮ On one-pass CPS transformations ⋮ Syntactic Theories in Practice
Cites Work
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Continuations revisited
- The Barendregt cube with definitions and generalised reduction
- Two-Level Functional Languages
- Representing Control: a Study of the CPS Transformation
- Syntactic accidents in program analysis: on the impact of the CPS transformation
- Higher-order unCurrying
- Correctness of procedure representations in higher-order assembly language
This page was built for publication: CPS transformation of beta-redexes