On the call-by-value CPS transform and its semantics

@article{Fhrmann2004OnTC,
  title={On the call-by-value CPS transform and its semantics},
  author={Carsten F{\"u}hrmann and Hayo Thielecke},
  journal={Inf. Comput.},
  year={2004},
  volume={188},
  pages={241-283}
}
We investigate continuations in the context of idealized call-by-value programming languages. On the semantic side, we analyze the categorical structures that arise from continuation models of call-by-value languages. On the syntactic side, we study the call-by-value continuation-passing transformation as a translation between equational theories. Among the novelties are an unusually simple axiomatization of control operators and a strengthened completeness result with a proof based on a… Expand
Complete Call-by-Value Calculi of Control Operators, I
  • R. Hasegawa
  • Mathematics, Computer Science
  • Log. Methods Comput. Sci.
  • 2021
Continuations, proofs and tests
On the observational theory of the CPS-calculus
Categorical semantics of normalization in λC-calculus
Proofs, tests and continuation passing style
On the Observational Theory of the CPS-calculus: (Extended Abstract)
Process Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus
Classical Linear Logic of Implications
...
1
2
...

References

SHOWING 1-10 OF 44 REFERENCES
Sound and Complete Axiomatisations of Call-by-Value Control Operators
  • M. Hofmann
  • Mathematics, Computer Science
  • Math. Struct. Comput. Sci.
  • 1995
Axioms for Recursion in Call-by-Value
Reasoning about programs in continuation-passing style.
Notions of Computation and Monads
  • E. Moggi
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1991
Control categories and duality: on the categorical semantics of the lambda-mu calculus
  • P. Selinger
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 2001
Computational lambda-calculus and monads
  • E. Moggi
  • Mathematics, Computer Science
  • [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
  • 1989
Direct Models for the Computational Lambda Calculus
A formulae-as-type notion of control
Declarative Continuations: an Investigation of Duality in Programming Language Semantics
Recursion from iteration
...
1
2
3
4
5
...