Representing Control: a Study of the CPS Transformation
From MaRDI portal
Recommendations
Cites work
- A syntactic theory of sequential control
- Automatic autoprojection of higher order recursive equations
- Automatic autoprojection of recursive equations with global variables and abstract data types
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Two-level semantics and abstract interpretation
- Two-level semantics and code generation
Cited in
(55)- CPS transformation of beta-redexes
- Existential continuation
- CPS translations and applications: The cube and beyond
- Retraction approach to CPS transform
- Back to direct style
- Comparing control constructs by double-barrelled CPS
- A first-order one-pass CPS transformation
- On the call-by-value CPS transform and its semantics
- On the semantics of parsing actions
- A static simulation of dynamic delimited control
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- On static and dynamic control-flow information in program analysis and transformation
- scientific article; zbMATH DE number 1692892 (Why is no real title available?)
- A higher-order abstract syntax approach to verified transformations on functional programs
- A context-based approach to proving termination of evaluation
- Syntactic theories in practice
- Type-safe code transformations in Haskell
- Probabilistic operational semantics for the lambda calculus
- Syntactic accidents in program analysis: on the impact of the CPS transformation
- UTP semantics of reactive processes with continuations
- \textsc{Lincx}: a linear logical framework with first-class contexts
- A New Method for Dependent Parsing
- Mechanized Verification of CPS Transformations
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
- From reduction-based to reduction-free normalization
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
- scientific article; zbMATH DE number 2053247 (Why is no real title available?)
- Syntactic accidents in program analysis: on the impact of the CPS transformation
- CPS transformation of flow information
- CPS transformation of flow information, Part II: administrative reductions
- scientific article; zbMATH DE number 1497779 (Why is no real title available?)
- Delimited control operators prove double-negation shift
- Logical relations for coherence of effect subtyping
- CPS in little pieces: composing partial continuations
- Programming with algebraic effects and handlers
- A selective CPS transformation
- Comparing control constructs by double-barrelled CPS transforms
- A new criterion for safe program transformations
- Continuation calculus
- Type directed partial evaluation for level-1 shift and reset
- A formal, resource consumption-preserving translation from actors with cooperative scheduling to Haskell
- scientific article; zbMATH DE number 7533352 (Why is no real title available?)
- Verifying selective CPS transformation for shift and reset
- Effect handlers via generalised continuations
- Effekt: Capability-passing style for type- and effect-safe, extensible effect handlers in Scala
- Continuation passing style for effect handlers
- Compiling with continuations, continued
- On one-pass CPS transformations
- On the transformation between direct and continuation semantics
- Certifying CPS transformation of let-polymorphic calculus using PHOAS
- Type checking and typability in domain-free lambda calculi
- On the relations between monadic semantics
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Refunctionalization at work
- Inter-deriving semantic artifacts for object-oriented programming
This page was built for publication: Representing Control: a Study of the CPS Transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279251)
