Continuations: A mathematical semantics for handling full jumps
From MaRDI portal
Publication:1566886
DOI10.1023/A:1010026413531zbMath0951.68078OpenAlexW2117163857MaRDI QIDQ1566886
Christopher Strachey, Christopher P. Wadsworth
Publication date: 4 June 2000
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1010026413531
Related Items
On the call-by-value CPS transform and its semantics, A syntactic theory of sequential control, A Rewriting Logic Approach to Type Inference, A guided tour of the mathematics of MetaSoft '88, A syntactic correspondence between context-sensitive calculi and abstract machines, Reflection Cryptanalysis of PRINCE-Like Ciphers, Continuation-passing C, compiling threads to events through continuations, Non-speculative and upward invocation of continuations in a parallel language, The congruence of two programming language definitions, UTP Semantics of Reactive Processes with Continuations, On the semantics of parsing actions, State-transition machines for lambda-calculus expressions, A static simulation of dynamic delimited control, Comparing Control Constructs by Double-barrelled CPS Transforms, On the observational theory of the CPS-calculus, On typing delimited continuations: Three new solutions to the printf problem, On one-pass CPS transformations, Call-by-name, call-by-value and the \(\lambda\)-calculus, Investigations on the dual calculus, PASCAL in LCF: Semantics and examples of proof, On an equivalence between continuation and stack semantics, Direct semantics and exceptions define jumps and coroutines, On the dynamic extent of delimited continuations
