Continuation Semantics and Self-adjointness
โ Scribed by Hayo Thielecke
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 989 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
โฆ Synopsis
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 classes of typing judgements for) continuation passing style (CPS) terms.
A call-by-value -calculus with the control operator callcc as well as a call-byname -calculus can be interpreted. Arrow t ypes are broken down into continuation types for argument/result-continuations pairs. Specialising the semantics to the CPS term model allows a reconstruction of CPS transforms.
๐ SIMILAR VOLUMES
Given bounded positive invertible operators A and B on a Hilbert space H, it is shown that the inequality AXA -1 + B -1 XB 2 X holds for all bounded operators X of rank 1 if and only if B = f (A) for some increasing function f satisfying a certain simple inequality, which in the case when the spectr