Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

We show how Ohori and Sasano's recent lightweight fusion by fixed-point promotion provides a simple way to prove the equivalence… Expand

Is this relevant?

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

Is this relevant?

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

Is this relevant?

Highly Cited

2007

Highly Cited

2007

We present a new method for construction of high-order parametrizations of surfaces: starting from point clouds, the method we… Expand

Is this relevant?

Review

2001

Review

2001

This paper outlines the recurring use of continuations. A brief overview of continuations is given. This is followed by several… Expand

Is this relevant?

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

Is this relevant?

Highly Cited

1997

Highly Cited

1997

This thesis attempts to make precise the structure inherent in Continuation Passing Style (CPS). We emphasize that CPS translates… Expand

Is this relevant?

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

Is this relevant?

1992

1992

A new program transformation is presented that allows to remove control operators related to partial continuations. The basis for… Expand

Is this relevant?

1991