Journal of Logic Programming
Essentials of programming languages
Essentials of programming languages
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The essence of compiling with continuations
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
The next 700 formal language descriptions
Lisp and Symbolic Computation - Special issue on continuations—part I
Lisp and Symbolic Computation - Special issue on continuations—part I
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
Representing control in the presence of one-shot continuations
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
Mathematical semantics of SNOBOL4
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Definitional Interpreters for Higher-Order Programming Languages
Higher-Order and Symbolic Computation
Using a Continuation Twice and Its Implications for the Expressive Power of call/cc
Higher-Order and Symbolic Computation
Continuations: A Mathematical Semantics for Handling FullJumps
Higher-Order and Symbolic Computation
Comparing Control Constructs by Double-Barrelled CPS
Higher-Order and Symbolic Computation
Secure Information Flow via Linear Continuations
Higher-Order and Symbolic Computation
Proceedings of the 9th European Symposium on Programming Languages and Systems
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Partial Continuations as the Difference of Continuations - A Duumvirate of Control Operators
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Syntactic Considerations on Recursive Types
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
Proceedings of ACM conference on Proving assertions about programs
History of programming languages---II
A game semantics of linearly used continuations
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
From control effects to typed continuation passing
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A sound and complete axiomatization of delimited continuations
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Journal of Functional Programming
Classical linear logic of implications
Mathematical Structures in Computer Science
Frame rules from answer types for code pointers
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular verification of assembly code with stack-based control abstractions
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Game semantics and linear CPS interpretation
Theoretical Computer Science - Foundations of software science and computation structures
Axioms for control operators in the CPS hierarchy
Higher-Order and Symbolic Computation
Linear types for computational effects
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A game semantics of linearly used continuations
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Enriching an effect calculus with linear types
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Equational axiomatization of call-by-name delimited control
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Theoretical Computer Science
An equivalence-preserving CPS translation via multi-language semantics
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
TFP'10 Proceedings of the 11th international conference on Trends in functional programming
Linearly-Used continuations in the enriched effect calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Functional semantics of parsing actions, and left recursion elimination as continuation passing
Proceedings of the 14th symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
Continuations can be used to explain a wide variety of control behaviours, including calling/returning (procedures), raising/handling (exceptions), labelled jumping (\tt goto statements), process switching (coroutines), and backtracking. However, continuations are often manipulated in a highly stylised way, and we show that all of these, bar backtracking, in fact use their continuations linearly; this is formalised by taking a target language for CPS transforms that has both intuitionistic and linear function types.