Searching for authors named Olivier Danvy – sorted by Relevance.
-
A Simple Solution to Type Specialization (Extended Abstract)
- BRICS Report Series RS-98-1 ISSN 0909-0878 January 1998 Copyright c fl 1998, BRICS, Department of Computer Science University of Aarhus. All rights reserved.
- Cited by 4 (0 self) – Add To MetaCart
-
On Evaluation Contexts, Continuations, and the Rest of Computation
- Continuations are variously understood as representations of the current evaluation context and as representations of the rest of the computation, but these understandings contradict each other: plugging an expression in a context yields a new expression whereas sending an intermediate result to a c
- Cited by 14 (10 self) – Add To MetaCart
-
Programming techniques for partial evaluation
- Abstract These lecture notes describe how to write generating extensions,i.e., dedicated program specializers. The focus is on compositional programs and their associated fold functions. Each generating exten-sion is expressed as an instance of this fold function. A number of examples are considered
- Cited by 2 (1 self) – Add To MetaCart
-
Formalizing Implementation Strategies for First-Class Continuations
- We present the first formalization of implementation strategies for first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) programs with a special treatment for the current continuation, accounting for the essence of first-class continuation
- Cited by 16 (1 self) – Add To MetaCart
-
Pragmatic Aspects of Type-Directed Partial Evaluation
- Type-directed partial evaluation stems from the residualization of static values in dynamic contexts, given their type and the type of their free variables. Its algorithm coincides with the algorithm for coercing a subtype value into a supertype value, which itself coincides with Berger and Schw
- Cited by 6 (0 self) – Add To MetaCart
-
Formatting Strings in ML.
- This document in subdirectory RS/98/5/ November 1997 (revised in March 1998) Formatting strings is a standard example in partial evaluation [1]. Indeed, the format is usually specified with a constant "control string," with respect to which the formatting function can be specialized. In this cas
- Cited by 3 (0 self) – Add To MetaCart
-
On some Functional Aspects of Control
- This paper points out and illustrates continuations as functions abstracting a delimited context instead of an unlimited one. When made available in an expression language, they provide a functional abstraction of control that can be used as any ordinary function. This approach sheds some light on t
- Cited by 3 (2 self) – Add To MetaCart
-
Semantics-Directed Compilation of Non-Linear Patterns
- This paper describes the automatic derivation of compiled patterns and of a pattern compiler by partial evaluation. Compiling a pattern is achieved by specializing a pattern matching program with respect to the pattern. Generating a pattern compiler is achieved by specializing the specializer with r
- Cited by 18 (4 self) – Add To MetaCart
-
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping
- Lambda-lifting and lambda-dropping respectively transform a blockstructured functional program into recursive equations and vice versa.
- Cited by 9 (4 self) – Add To MetaCart
-
Three Steps for the CPS Transformation
- Transforming a #-term into continuation-passing style (CPS) might seem mystical at first, but in fact it can be characterized by three separate aspects: . The values of all intermediate applications are given a name. . The evaluation of these applications is sequentialized based on a traversal o
- Cited by 9 (4 self) – Add To MetaCart

