Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,325 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
A unified analysis of the same, phrasal comparatives, and superlatives
C. Pollard
,
E. A. Smith
2012
Corpus ID: 60601876
We present a unified categorial analysis of several types of English comparative, superlative, and THE SAME/DIFFERENT (S/D…
Expand
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
2006
2006
Practical Program Extraction from Classical Proofs
Yevgeniy Makarov
Mathematical Foundations of Programming Semantics
2006
Corpus ID: 2682130
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
1999
1999
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value
Ken-etsu Fujita
International Conference on Typed Lambda Calculus…
1999
Corpus ID: 6350918
We introduce an explicitly typed λµ-calculus of call-by-value as a short-hand for the 2nd order Church-style. Our motivation…
Expand
1998
1998
Polymorphic Call-by-Value Calculus Based on Classical Proofs
Ken-etsu Fujita
Artificial Intelligence and Symbolic Computation
1998
Corpus ID: 14048063
We introduce a polymorphic call-by-value calculus, v, based on 2nd order classical logic. The call-by-value computation rules are…
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
1995
1995
Exceptions Are Strictly More Powerful Than Call/CC.
Mark Lillibridge
1995
Corpus ID: 7205356
Abstract : We demonstrate that in the context of statically typed pure functional lambda calculi, exceptions are strictly more…
Expand
1992
1992
Value Transforming Style
C. Queinnec
International ITG Workshop on Smart Antennas
1992
Corpus ID: 7482579
A new program transformation is presented that allows to remove control operators related to partial continuations. The basis for…
Expand
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