Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Call-with-current-continuation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Abstract Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have… Expand
2011
2011
We show how to extract existential witnesses from classical proofs using Krivine's classical realizability--where classical… Expand
2008
2008
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
Abstract
We present a particularly simple lazy lambda-calculus machine, which was introduced twenty-five years ago. It has been… Expand
2007
2007
We show how Ohori and Sasano's recent lightweight fusion by fixed-point promotion provides a simple way to prove the equivalence… Expand
1998
1998
We introduce a polymorphic call-by-value calculus, v, based on 2nd order classical logic. The call-by-value computation rules are… Expand
1994
1994
This work uses denotational models to understand and improve the part of a programming language concerned with non-local control… Expand
Highly Cited
1993
Highly Cited
1993
Plotkin's λv-calculus for call-by-value programs is weaker than the λβη-calculus for the same programs in continuation-passing… Expand
1993
1993
It has been proposed that allocating procedure activation records on a garbage collected heap is more e cient than stack… Expand
Highly Cited
1987
Highly Cited
1987
Abstract Sequential control operators like J and call/cc are often found in implementations of the λ-calculus as a programming… Expand