Danvy, Olivier.
Danvy, Olivier, 1960-....
Olivier Danvy
VIAF ID: 25308789 ( Personal )
Permalink: http://viaf.org/viaf/25308789
Preferred Forms
- 200 _ | ‡a Danvy ‡b Olivier
-
-
-
-
- 100 1 0 ‡a Danvy, Olivier
-
-
-
-
- 100 1 _ ‡a Danvy, Olivier
- 100 1 _ ‡a Danvy, Olivier ‡d 1960-
- 100 1 _ ‡a Danvy, Olivier ‡d 1960-
-
- 100 1 _ ‡a Danvy, Olivier, ‡d 1960-....
-
- 100 0 _ ‡a Olivier Danvy
4xx's: Alternate Name Forms (12)
Works
Title | Sources |
---|---|
ACM SIGPLAN Workshop on Continuations CW92 (1992 : San Francisco, Calif.). Proceedings of the ACM SIGPLAN Workshop on Continuations CW 92, 1992: | |
ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation | |
Automatic autoprojection of recursive equations with global variables and abstract data types | |
Automatic program development : a tribute to Robert Paige | |
Back to direct style II | |
Compiling actions by partial evaluation, revisited | |
Conception d'un noyau de vérification de preuves pour le λΠ-calcul modulo | |
Design and implementation of a proof verifying kernel for the λΠ-calculus modulo. | |
Eta-expansion does the trick | |
Formal modeling : actors, open systems, biological systems ; essays dedicated to Carolyn Talcott on the occasion of her 70th birthday | |
Formatting strings in ML | |
From interpreter to logic engine by defunctionalization | |
From reduction-based to reduction-free normalization | |
Functional unparsing | |
Higher-order and symbolic computation | |
Higher-order rewriting and partial evaluation | |
Inter-deriving semantic artifacts for object-oriented programming | |
Lambda-dropping | |
Lambda-lifting in quadratic time | |
Machines virtuelles pour langages applicatifs et langages acteur réalisation et programmation | |
Memory allocation and higher-order functions | |
On Barron and Strachey's Cartesian product function | |
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation | |
On one-pass CPS transformations | |
On the dynamic extent of delimited continuations | |
On the equivalence between small-step and big-step abstract machines | |
Partial evaluation : international seminar, Dagstuhl Castle, Germany, February 12-16, 1996 : selected papers | |
Pragmatic aspects of type-directed partial evaluation | |
Program extraction from proofs of weak head normalization | |
Programs as data objects : second symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001 : proceedings | |
Refocusing in reduction semantics | |
Refunctionalization at work | |
Semantics-based compiling | |
Singular choices for multiple choice | |
Sur un exemple de Patrick Greussay | |
Syntactic accidents in program analysis | |
Syntactic theories in practice | |
There and back again | |
Thunks and the λ-calculus | |
Vers une méthodologie dédiée à l'orchestration d'entités communicantes | |
An ¤analytical approach to programs as data objects | |
A ¤Blond primer | |
A ¤concrete framework for environment machines | |
A ¤functional abstraction of typed contexts | |
A ¤rational deconstruction of Landin's J operator | |
A ¤simple proof of a folklore theorem about delimited control | |
A ¤simple solution to type specialization | |
A ¤symmetric approach to compilation and decompilation | |
A ¤syntactic correspondence between context-sensitive calculi and abstract machines |