Declarative continuations: an investigation of duality in programming language semantics

DOI10.1007/BFB0018355MaRDI QIDQ5096263zbMATH OpenFDO

Authors Andrzej Filinski

Publication date 16 August 2022

Published in Category Theory and Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Categorical logic, topoi (03G30) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1538023
• Compositional semantics for composable continuations: from abortive to delimited control
• scientific article; zbMATH DE number 1759490
• A type-theoretic foundation of delimited continuations
• scientific article; zbMATH DE number 1231584

Cites work

• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 4048997 (Why is no real title available?)
• scientific article; zbMATH DE number 193170 (Why is no real title available?)
• Linear logic
• The linear abstract machine

Cited in

(6)

• CPS-translation as adjoint
• Subtractive logic
• scientific article; zbMATH DE number 1538023 (Why is no real title available?)
• Call-by-Value Is Dual to Call-by-Name, Extended
• Investigations on the dual calculus
• On the call-by-value CPS transform and its semantics

This page was built for publication: Declarative continuations: an investigation of duality in programming language semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096263)