Continuation semantics and self-adjointness

@inproceedings{Thielecke1997ContinuationSA,
  title={Continuation semantics and self-adjointness},
  author={Hayo Thielecke},
  booktitle={MFPS},
  year={1997}
}
Abstract We give an abstract categorical presentation of continuation semantics by taking the continuation type constructor ¬ (or cont in Standard ML of New Jersey) as primitive. This constructor on types extends to a contravariant functor on terms which is adjoint to itself on the left; restricted to the subcategory of those programs that do not manipulate the current continuation, it is adjoint to itself on the right. The motivating example of such a category is built from (equivalence… Expand
Direct Models for the Computational Lambda Calculus
Adjunction Models For Call-By-Push-Value With Stacks
Axiomatics for Data Refinement in Call by Value Programming Languages
A Universal Embedding for the Higher Order Structure of Computational Effects
  • J. Power
  • Mathematics, Computer Science
  • TLCA
  • 2003
Classical Realizability in the CPS Target Language
Call-by-push-value
Using a Continuation Twice and Its Implications for the Expressive Power of call/cc
...
1
2
3
...

References

SHOWING 1-10 OF 11 REFERENCES
Sound and Complete Axiomatisations of Call-by-Value Control Operators
  • M. Hofmann
  • Mathematics, Computer Science
  • Math. Struct. Comput. Sci.
  • 1995
Declarative Continuations: an Investigation of Duality in Programming Language Semantics
Typing first-class continuations in ML
Typing and subtyping for mobile processes
  • B. Pierce, D. Sangiorgi
  • Computer Science
  • [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
  • 1993
Lambda: The Ultimate Imperative
Compiling with Continuations
Premonoidal Categories and Notions of Computation
Rabbit: A Compiler for Scheme
Controlling E ects
  • PhD thesis, School of Computer Science,
  • 1996
Controlling EEects
  • Controlling EEects
  • 1996
...
1
2
...