Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,223,259 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Backtracking
COMEFROM
Continuation
Continuation-passing style
Expand
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
David Hopkins
2012
Corpus ID: 42039056
This thesis examines the use of game semantics for the automatic equivalence checking of higher-order programs. Game semantics…
Expand
Review
2010
Review
2010
An overview of the K semantic framework
G. Roşu
,
Traian-Florin Serbanuta
J. Log. Algebraic Methods Program.
2010
Corpus ID: 13756844
2008
2008
An operational semantics for Scheme
Jacob Matthews
,
R. Findler
Journal of functional programming
2008
Corpus ID: 16988669
This paper presents an operational semantics for the core of Scheme. Our specification improves over the denotational semantics…
Expand
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…
Expand
2003
2003
From shift and reset to polarized linear logic
Chung-chieh Shan
2003
Corpus ID: 15522513
Griffin [22] pointed out that, just as the pure λ-calculus corresponds to intuitionistic logic, a λ-calculus with firstclass…
Expand
Review
2001
Review
2001
Call with Current Continuation Patterns
D. Ferguson
,
D. Deugo
2001
Corpus ID: 116150081
This paper outlines the recurring use of continuations. A brief overview of continuations is given. This is followed by several…
Expand
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…
Expand
1996
1996
Empirical and analytic study of stack versus heap cost for languages with closures
A. Appel
,
Zhong Shao
Journal of functional programming
1996
Corpus ID: 43340171
Abstract We present a comprehensive analysis of all the components of creation, access and disposal of heap-allocated and stack…
Expand
1995
1995
A Hybrid Execution Model for Fine-Grained Languages on Distributed Memory Multicomputers
John Plevyak
,
V. Karamcheti
,
Xingbin Zhang
,
A. Chien
Proceedings of the IEEE/ACM SC95 Conference
1995
Corpus ID: 6759989
While fine-grained concurrent languages can naturally capture concurrency in many irregular and dynamic problems, their…
Expand
Highly Cited
1987
Highly Cited
1987
A Syntactic Theory of Sequential Control
M. Felleisen
,
D. Friedman
,
E. Kohlbecker
,
B. Duba
Theoretical Computer Science
1987
Corpus ID: 205092799
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)
ACCEPT & CONTINUE