On one-pass CPS transformations
From MaRDI portal
Recommendations
Cites work
- A first-order one-pass CPS transformation
- A static simulation of dynamic delimited control
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Back to direct style
- CPS transformation of beta-redexes
- CPS translations and applications: The cube and beyond
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Continuations revisited
- Continuations: A mathematical semantics for handling full jumps
- Definitional interpreters revisited
- From syntactic theories to interpreters: Automating the proof of unique decomposition
- Lambda-dropping: Transforming recursive equations into programs with block structure
- Notions of computation and monads
- Optimizing nested loops using local CPS conversion
- Retraction approach to CPS transform
- Secure information flow via linear continuations
- Syntactic accidents in program analysis: on the impact of the CPS transformation
- Thunks and the λ-calculus
Cited in
(8)- Inter-deriving semantic artifacts for object-oriented programming
- A reflection on call-by-value
- CPS-translation as adjoint
- scientific article; zbMATH DE number 2087425 (Why is no real title available?)
- A first-order one-pass CPS transformation
- CPS transformation of beta-redexes
- CPS transformation of flow information
- From reduction-based to reduction-free normalization
This page was built for publication: On one-pass CPS transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428374)
