Skip to search formSkip to main contentSkip to account menu

Call-with-current-continuation

Known as: Call with current continuation, Call/cc, Callcc 
In Scheme programming, the function call-with-current-continuation, abbreviated call/cc, is a control operator. It has been adopted by several other… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
BacktrackingCOMEFROMContinuationContinuation-passing style

Broader (1)

Scheme

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Game semantics based equivalence checking of higher-order programs
This thesis examines the use of game semantics for the automatic equivalence checking of higher-order programs. Game semantics… 
Review
2010
Review
2010
An overview of the K semantic framework
2008
2008
An operational semantics for Scheme
This paper presents an operational semantics for the core of Scheme. Our specification improves over the denotational semantics… 
Highly Cited
2007
Highly Cited
2007
A call-by-name lambda-calculus machine
  • J. Krivine
  • High. Order Symb. Comput.
  • 2007
  • Corpus ID: 18158499
Abstract We present a particularly simple lazy lambda-calculus machine, which was introduced twenty-five years ago. It has been… 
2003
2003
From shift and reset to polarized linear logic
Griffin [22] pointed out that, just as the pure λ-calculus corresponds to intuitionistic logic, a λ-calculus with firstclass… 
Review
2001
Review
2001
Call with Current Continuation Patterns
This paper outlines the recurring use of continuations. A brief overview of continuations is given. This is followed by several… 
Highly Cited
1999
Highly Cited
1999
Representing layered monads
  • Andrzej Filinski
  • ACM-SIGACT Symposium on Principles of Programming…
  • 1999
  • Corpus ID: 15914593
There has already been considerable research on constructing modular, monad-based specifications of computational effects (state… 
1996
1996
Empirical and analytic study of stack versus heap cost for languages with closures
Abstract We present a comprehensive analysis of all the components of creation, access and disposal of heap-allocated and stack… 
1995
1995
A Hybrid Execution Model for Fine-Grained Languages on Distributed Memory Multicomputers
While fine-grained concurrent languages can naturally capture concurrency in many irregular and dynamic problems, their… 
Highly Cited
1987
Highly Cited
1987
A Syntactic Theory of Sequential Control
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)