#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1988

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The evaluation function of a reduction semantics (i.e., a small-step operational semantics with an explicit representation of the reduction context) is canonically defined as the transitive closure… (More)

- Olivier Danvy, Lasse R. Nielsen
- PPDP
- 2001

Reynolds's defunctionalization technique is a whole-program transformation from higher-order to first-order functional programs. We study practical applications of this transformation and uncover new… (More)

- Olivier Danvy, Lasse R. Nielsen
- FoSSaCS
- 2002

We present a new transformation of call-by-value lambda-terms into continuation-passing style (CPS). This transformation operates in one pass and is both compositional and first-order. Because it… (More)

- Lasse R. Nielsen
- Electr. Notes Theor. Comput. Sci.
- 2001

The CPS transformation makes all functions continuation-passing, uniformly. Not all functions, however, need continuations: they only do if their evaluation includes computational effects. In this… (More)

- Olivier Danvy, Lasse R. Nielsen
- Inf. Process. Lett.
- 2005

The extra compaction of Sabry and Felleisen’s transformation is due to making continuations occur first in CPS terms and classifying more redexes as administrative. We show that the extra compaction… (More)

- Anne Thoustrup Saber, Lasse R. Nielsen, Michael Dictor, Lars Hagmar, Zoli Mikoczy, Hak̊an Wallin
- Cancer letters
- 1998

Of 39 males diagnosed with sinonasal adenocarcinomas over 30 years in the Lund University Hospital catchment area (1.5 million inhabitants), archival tumor tissue was available from 29. Of these, 16… (More)

- Olivier Danvy, Lasse R. Nielsen
- Electr. Notes Theor. Comput. Sci.
- 2001

The evaluation function of a syntactic theory is canonically defined as the transitive closure of (1) decomposing a program into an evaluation context and a redex, (2) contracting this redex, and (3)… (More)

- Olivier Danvy, Kevin Millikin, Lasse R. Nielsen
- J. Funct. Program.
- 2007

We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that reduce administrative redexes at transformation time instead of in a post-processing phase. One… (More)

- Olivier Danvy, Lasse R. Nielsen
- FLOPS
- 2001

A lambda-encoding such as the CPS transformation gives rise to administrative redexes. In his seminal article “Call-by-name, call-by-value and the lambda-calculus”, 25 years ago, Plotkin tackled… (More)

- Lasse R. Nielsen
- 2002

We build on Danvy and Nielsen’s first-order program transformation into continuation-passing style (CPS) to present a new correctness proof of the converse transformation, i.e., a one-pass… (More)