scientific article

zbMath0565.68028MaRDI QIDQ3680263

Mitchell Wand, Albert R. Meyer

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

typed lambda-calculusretractionssemantics of the continuation transform

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)

Related Items (14)

On the transformation between direct and continuation semantics ⋮ A first-order one-pass CPS transformation ⋮ Strong normalization from weak normalization in typed \(\lambda\)-calculi ⋮ On the relations between monadic semantics ⋮ Functional un\(|\)unparsing ⋮ Correctness of procedure representations in higher-order assembly language ⋮ On the strong normalisation of intuitionistic natural deduction with permutation-conversions ⋮ Galois connecting call-by-value and call-by-name ⋮ Correctness of compiling polymorphism to dynamic typing ⋮ Domain-Freeλµ-Calculus ⋮ A static simulation of dynamic delimited control ⋮ An induction principle for pure type systems ⋮ Types as graphs: Continuations in type logical grammar ⋮ Relational interpretations of recursive types in an operational setting.

This page was built for publication: