scientific article; zbMATH DE number 3902021
[For the entire collection see Zbl 0562.00009.] This paper reports preliminary work on the semantics of the continuation transform. Previous work on the semantics of continuations has concentrated on untyped lambda-calculi and has used primarily the mechanism of inclusive predicates. Such predicates are easy to understand on atomic values, but they become obscure on functional values. In the case of the typed lambda-calculus, we show that such predicates can be replaced by retractions. The main theorem states that the meaning of a closed term is a retraction of the meaning of the corresponding continuationized term.
- Types as graphs: Continuations in type logical grammar
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- On the strong normalisation of intuitionistic natural deduction with permutation-conversions
- Relational interpretations of recursive types in an operational setting.
- A first-order one-pass CPS transformation
- Functional un\(|\)unparsing
- A static simulation of dynamic delimited control
- Domain-free -calculus
- From control effects to typed continuation passing
- Inhabitation in typed lambda-calculi (a syntactic approach)
- scientific article; zbMATH DE number 1497842 (Why is no real title available?)
- scientific article; zbMATH DE number 1910399 (Why is no real title available?)
- A type system for continuation calculus
- Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
- Correctness of compiling polymorphism to dynamic typing
- On the transformation between direct and continuation semantics
- An induction principle for pure type systems
- Correctness of procedure representations in higher-order assembly language
- Galois connecting call-by-value and call-by-name
- On the relations between monadic semantics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680263)