A Functional Abstraction of Typed Invocation Contexts

DOI10.46298/LMCS-18(3:34)2022MaRDI QIDQ5043596zbMATH OpenOpenAlexFDO

Authors Youyou Cong, Chiaki Ishio, Kaho Honda, Kenichi Asai

Publication date 6 October 2022

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2110.07349

zbMATH Keywords

control and promptcontrol operatorsCPS translationdelimited continuationstype system

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• A functional abstraction of typed invocation contexts
• Typed Dynamic Control Operators for Delimited Continuations
• Polymorphic Delimited Continuations
• Subtyping delimited continuations
• A Substructural Type System for Delimited Continuations

Cites work

• A first-order one-pass CPS transformation
• A functional abstraction of typed invocation contexts
• A monadic framework for delimited continuations
• A reflection on call-by-value
• A selective CPS transformation
• A sound and complete axiomatization of delimited continuations
• A static simulation of dynamic delimited control
• A syntactic approach to type soundness
• A theory of type polymorphism in programming
• An effect system for algebraic effects and handlers
• An Operational Foundation for Delimited Continuations in the CPS Hierarchy
• Axiomatizing subtyped delimited continuations
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Continuation passing style for effect handlers
• Corrigendum: Polymorphic type assignment and CPS conversion
• Delimited control in OCaml, abstractly and concretely
• Derivation of a Virtual Machine For Four Variants of Delimited-Control Operators.
• Do be do be do
• Effect handlers via generalised continuations
• Handlers in action
• Handlers of Algebraic Effects
• scientific article; zbMATH DE number 1424053 (Why is no real title available?)
• Implementing first-class polymorphic delimited continuations by a type-directed selective CPS-transform
• Koka: programming with row polymorphic effect types
• On the expressive power of programming languages
• On the static and dynamic extents of delimited continuations
• Parametric higher-order abstract syntax for mechanized semantics
• Polymorphic Delimited Continuations
• Programming with algebraic effects and handlers
• Shallow effect handlers
• Subtyping delimited continuations
• THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control
• Type directed compilation of row-typed algebraic effects
• Typed Dynamic Control Operators for Delimited Continuations
• Typed equivalence of effect handlers and delimited control
• Verifying selective CPS transformation for shift and reset

Cited in

(3)

• scientific article; zbMATH DE number 6721685 (Why is no real title available?)
• scientific article; zbMATH DE number 7377974 (Why is no real title available?)
• A functional abstraction of typed invocation contexts

Describes a project that uses

Uses Software

• ML
• Koka
• Eff

This page was built for publication: A Functional Abstraction of Typed Invocation Contexts

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