Declarative continuations: an investigation of duality in programming language semantics

DOI10.1007/BFB0018355zbMATH Open1493.68108MaRDI QIDQ5096263FDOQ5096263

Authors: Andrzej Filinski 

Publication date: 16 August 2022

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

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

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)

Cites Work

• Title not available (Why is that?)
• Linear logic
• The linear abstract machine
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Subtractive logic
• CPS-translation as adjoint
• Title not available (Why is that?)
• 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)