On one-pass CPS transformations
From MaRDI portal
Publication:5428374
DOI10.1017/S0956796807006387zbMath1130.68037OpenAlexW2155273456MaRDI QIDQ5428374
Olivier Danvy, Kevin Millikin, Lasse R. Nielsen
Publication date: 22 November 2007
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796807006387
Related Items (3)
Separating Sessions Smoothly ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ From Reduction-Based to Reduction-Free Normalization
Cites Work
- Notions of computation and monads
- A syntactic correspondence between context-sensitive calculi and abstract machines
- CPS transformation of beta-redexes
- CPS translations and applications: The cube and beyond
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Retraction approach to CPS transform
- Definitional interpreters revisited
- Back to direct style
- Continuations revisited
- Continuations: A mathematical semantics for handling full jumps
- Lambda-dropping: Transforming recursive equations into programs with block structure
- From syntactic theories to interpreters: Automating the proof of unique decomposition
- Optimizing nested loops using local CPS conversion
- Secure information flow via linear continuations
- A first-order one-pass CPS transformation
- A static simulation of dynamic delimited control
- Thunks and the λ-calculus
- Syntactic accidents in program analysis: on the impact of the CPS transformation
This page was built for publication: On one-pass CPS transformations
