 | 2009 |
|---|
| 130 |       | Olivier Danvy,
Chung-chieh Shan,
Ian Zerny:
J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations.
DSL 2009: 1-19 |
| 129 | | Olivier Danvy:
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines.
Semantics and Algebraic Specification 2009: 162-185 |
| 128 | | Malgorzata Biernacka,
Olivier Danvy:
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines.
Semantics and Algebraic Specification 2009: 186-206 |
| 127 | | Olivier Danvy,
Kevin Millikin:
Refunctionalization at work.
Sci. Comput. Program. 74(8): 534-549 (2009) |
| 2008 |
|---|
| 126 | | Olivier Danvy:
From Reduction-Based to Reduction-Free Normalization.
Advanced Functional Programming 2008: 66-164 |
| 125 | | Olivier Danvy:
Defunctionalized interpreters for programming languages.
ICFP 2008: 131-142 |
| 124 | | Olivier Danvy,
Jacob Johannsen:
Inter-deriving Semantic Artifacts for Object-Oriented Programming.
WoLLIC 2008: 1-16 |
| 123 | | Olivier Danvy,
Kevin Millikin:
A Rational Deconstruction of Landin's SECD Machine with the J Operator
CoRR abs/0811.3231: (2008) |
| 122 | | Olivier Danvy,
Kevin Millikin:
On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion.
Inf. Process. Lett. 106(3): 100-109 (2008) |
| 121 | | Olivier Danvy,
Kevin Millikin:
A Rational Deconstruction of Landin's SECD Machine with the J Operator.
Logical Methods in Computer Science 4(4): (2008) |
| 2007 |
|---|
| 120 | | Olivier Danvy,
J. Michael Spivey:
On Barron and Strachey's cartesian product function.
ICFP 2007: 41-46 |
| 119 | | Malgorzata Biernacka,
Olivier Danvy:
A concrete framework for environment machines.
ACM Trans. Comput. Log. 9(1): (2007) |
| 118 | | Olivier Danvy:
Editorial.
Higher-Order and Symbolic Computation 20(3): 197-198 (2007) |
| 117 | | Olivier Danvy,
Hayo Thielecke:
Editorial.
Higher-Order and Symbolic Computation 20(4): 337-338 (2007) |
| 116 | | Olivier Danvy,
Kevin Millikin,
Lasse R. Nielsen:
On one-pass CPS transformations.
J. Funct. Program. 17(6): 793-812 (2007) |
| 115 | | Olivier Danvy,
Peter W. O'Hearn,
Philip Wadler:
Preface.
Theor. Comput. Sci. 375(1-3): 1-2 (2007) |
| 114 | | Malgorzata Biernacka,
Olivier Danvy:
A syntactic correspondence between context-sensitive calculi and abstract machines.
Theor. Comput. Sci. 375(1-3): 76-108 (2007) |
| 2006 |
|---|
| 113 | | Olivier Danvy:
Refunctionalization at Work.
MPC 2006: 4 |
| 112 | | Mads Sig Ager,
Olivier Danvy,
Henning Korsholm Rohde:
Fast partial evaluation of pattern matching in strings.
ACM Trans. Program. Lang. Syst. 28(4): 696-714 (2006) |
| 111 | | Malgorzata Biernacka,
Olivier Danvy,
Kristian Støvring:
Program Extraction From Proofs of Weak Head Normalization.
Electr. Notes Theor. Comput. Sci. 155: 169-189 (2006) |
| 110 | | Olivier Danvy,
Oege de Moor,
Julian A. Padget,
Peter Thiemann:
Editorial.
Higher-Order and Symbolic Computation 19(1): 5 (2006) |
| 109 | | Olivier Danvy,
Andrzej Filinski,
Jean-Louis Giavitto,
Andy King,
Pierre-Etienne Moreau,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 19(4): 343-344 (2006) |
| 108 | | Olivier Danvy,
Henning Korsholm Rohde:
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation.
Inf. Process. Lett. 99(4): 158-162 (2006) |
| 107 | | Dariusz Biernacki,
Olivier Danvy:
Theoretical Pearl: A simple proof of a folklore theorem about delimited control.
J. Funct. Program. 16(3): 269-280 (2006) |
| 106 | | Dariusz Biernacki,
Olivier Danvy,
Chung-chieh Shan:
On the static and dynamic extents of delimited continuations.
Sci. Comput. Program. 60(3): 274-297 (2006) |
| 2005 |
|---|
| 105 |  | Olivier Danvy,
Benjamin C. Pierce:
Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, September 26-28, 2005
ACM 2005 |
| 104 | | Olivier Danvy,
Kevin Millikin:
A Rational Deconstruction of Landin's J Operator.
IFL 2005: 55-73 |
| 103 | | Malgorzata Biernacka,
Dariusz Biernacki,
Olivier Danvy:
An Operational Foundation for Delimited Continuations in<br><br> the<br><br><br> CPS<br><br> Hierarchy
CoRR abs/cs/0508048: (2005) |
| 102 | | Olivier Danvy:
From Reduction-based to Reduction-free Normalization.
Electr. Notes Theor. Comput. Sci. 124(2): 79-100 (2005) |
| 101 | | Olivier Danvy,
Mayer Goldberg:
There and Back Again.
Fundam. Inform. 66(4): 397-413 (2005) |
| 100 | | Olivier Danvy,
Fritz Henglein,
Harry G. Mairson,
Alberto Pettorossi:
Editorial.
Higher-Order and Symbolic Computation 18(1-2): 5-6 (2005) |
| 99 | | Olivier Danvy,
Lasse R. Nielsen:
CPS transformation of beta-redexes.
Inf. Process. Lett. 94(5): 217-224 (2005) |
| 98 | | Dariusz Biernacki,
Olivier Danvy,
Chung-chieh Shan:
On the dynamic extent of delimited continuations.
Inf. Process. Lett. 96(1): 7-17 (2005) |
| 97 | | Malgorzata Biernacka,
Dariusz Biernacki,
Olivier Danvy:
An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
Logical Methods in Computer Science 1(2): (2005) |
| 96 | | Mads Sig Ager,
Olivier Danvy,
Jan Midtgaard:
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects.
Theor. Comput. Sci. 342(1): 149-172 (2005) |
| 2004 |
|---|
| 95 | | Olivier Danvy:
A Rational Deconstruction of Landin's SECD Machine.
IFL 2004: 52-71 |
| 94 | | Wei-Ngan Chin,
Olivier Danvy,
Peter Thiemann:
Editorial: Theme Issue on Partial Evaluation and Semantics-Based Program Manipulation.
Higher-Order and Symbolic Computation 17(1-2): 5-6 (2004) |
| 93 | | David A. Basin,
Olivier Danvy,
Robert Harper:
Editorial.
Higher-Order and Symbolic Computation 17(3): 171-171 (2004) |
| 92 | | Olivier Danvy,
Ian A. Mason:
Editorial.
Higher-Order and Symbolic Computation 17(4): 275-275 (2004) |
| 91 | | Mads Sig Ager,
Olivier Danvy,
Jan Midtgaard:
A functional correspondence between call-by-need evaluators and lazy abstract machines.
Inf. Process. Lett. 90(5): 223-232 (2004) |
| 90 | | Olivier Danvy,
Ulrik Pagh Schultz:
Lambda-Lifting in Quadratic Time.
Journal of Functional and Logic Programming 2004: (2004) |
| 2003 |
|---|
| 89 | | Olivier Danvy:
A New One-Pass Transformation into Monadic Normal Form.
CC 2003: 77-89 |
| 88 | | Olivier Danvy,
Pablo E. Martínez López:
Tagging, Encoding, and Jones Optimality.
ESOP 2003: 335-347 |
| 87 | | Olivier Danvy:
A Journey from Interpreters to Compilers and Virtual Machines.
GPCE 2003: 117 |
| 86 | | Dariusz Biernacki,
Olivier Danvy:
From Interpreter to Logic Engine by Defunctionalization.
LOPSTR 2003: 143-159 |
| 85 | | Mads Sig Ager,
Olivier Danvy,
Henning Korsholm Rohde:
Fast partial evaluation of pattern matching in strings.
PEPM 2003: 3-9 |
| 84 | | Mads Sig Ager,
Dariusz Biernacki,
Olivier Danvy,
Jan Midtgaard:
A functional correspondence between evaluators and abstract machines.
PPDP 2003: 8-19 |
| 83 | | Olivier Danvy,
Fritz Henglein,
Harry G. Mairson,
Alberto Pettorossi:
Editorial: Special Issue Dedicated to Bob Paige.
Higher-Order and Symbolic Computation 16(1-2): 5-6 (2003) |
| 82 | | Daniel Damian,
Olivier Danvy:
Syntactic accidents in program analysis: on the impact of the CPS transformation.
J. Funct. Program. 13(5): 867-904 (2003) |
| 81 | | Daniel Damian,
Olivier Danvy:
CPS transformation of flow information, Part II: administrative reductions.
J. Funct. Program. 13(5): 925-933 (2003) |
| 80 | | Olivier Danvy,
Lasse R. Nielsen:
A first-order one-pass CPS transformation.
Theor. Comput. Sci. 308(1-3): 239-257 (2003) |
| 2002 |
|---|
| 79 | | Mads Sig Ager,
Olivier Danvy,
Henning Korsholm Rohde:
On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation.
ASIA-PEPM 2002: 32-46 |
| 78 | | Olivier Danvy,
Ulrik Pagh Schultz:
Lambda-Lifting in Quadratic Time.
FLOPS 2002: 134-151 |
| 77 | | Olivier Danvy,
Lasse R. Nielsen:
A First-Order One-Pass CPS Transformation.
FoSSaCS 2002: 98-113 |
| 76 | | Vincent Balat,
Olivier Danvy:
Memoization in Type-Directed Partial Evaluation.
GPCE 2002: 78-92 |
| 75 | | Olivier Danvy,
Mayer Goldberg:
There and back again.
ICFP 2002: 230-234 |
| 74 | | Mads Sig Ager,
Olivier Danvy,
Mayer Goldberg:
A Symmetric Approach to Compilation and Decompilation.
The Essence of Computation 2002: 296-331 |
| 73 | | Torben Amtoft,
Charles Consel,
Olivier Danvy,
Karoline Malmkjær:
The Abstraction and Instantiation of String-Matching Programs.
The Essence of Computation 2002: 332-357 |
| 72 | | Olivier Danvy,
Takayasu Ito,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 15(1): 5 (2002) |
| 71 | | Olivier Danvy,
Amr Sabry:
Editorial.
Higher-Order and Symbolic Computation 15(2-3): 139-140 (2002) |
| 70 | | Olivier Danvy,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 15(4): 271 (2002) |
| 69 | | Daniel Damian,
Olivier Danvy:
A Simple CPS Transformation of Control-Flow Information.
Logic Journal of the IGPL 10(5): 501-515 (2002) |
| 2001 |
|---|
| 68 | | Olivier Danvy,
Andrzej Filinski:
Programs as Data Objects, Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings
Springer 2001 |
| 67 | | Olivier Danvy,
Morten Rhiger:
A Simple Take on Typed Abstract Syntax in Haskell-like Languages.
FLOPS 2001: 343-358 |
| 66 | | Olivier Danvy,
Lasse R. Nielsen:
A Higher-Order Colon Translation.
FLOPS 2001: 78-91 |
| 65 | | Olivier Danvy,
Lasse R. Nielsen:
Defunctionalization at Work.
PPDP 2001: 162-174 |
| 64 | | Olivier Danvy,
Bernd Grobauer,
Morten Rhiger:
A Unifying Approach to Goal-Directed Evaluation.
SAIG 2001: 108-125 |
| 63 | | Daniel Damian,
Olivier Danvy:
Static Transition Compression.
SAIG 2001: 92-107 |
| 62 | | Olivier Danvy:
Many Happy Returns.
TLCA 2001: 1 |
| 61 | | Olivier Danvy,
Lasse R. Nielsen:
Syntactic Theories in Practice.
Electr. Notes Theor. Comput. Sci. 59(4): (2001) |
| 60 | | Olivier Danvy,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 14(1): 5 (2001) |
| 59 | | Olivier Danvy,
Julia L. Lawall:
Editorial.
Higher-Order and Symbolic Computation 14(2-3): 99-100 (2001) |
| 58 | | Olivier Danvy,
Takayasu Ito,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 14(4): 307-307 (2001) |
| 57 | | Olivier Danvy,
Morten Rhiger,
Kristoffer Høgsbro Rose:
Normalization by evaluation with typed abstract syntax.
J. Funct. Program. 11(6): 673-680 (2001) |
| 56 | | Olivier Danvy,
Bernd Grobauer,
Morten Rhiger:
A Unifying Approach to Goal-directed Evaluation.
New Generation Comput. 20(1): 53-74 (2001) |
| 2000 |
|---|
| 55 | | Olivier Danvy:
Formalizing Implementation Strategies for First-Class Continuations.
ESOP 2000: 88-103 |
| 54 | | Daniel Damian,
Olivier Danvy:
Syntactic accidents in program analysis: on the impact of the CPS transformation.
ICFP 2000: 209-220 |
| 53 | | Olivier Danvy,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 13(1/2): 5-6 (2000) |
| 52 | | Olivier Danvy,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 13(3): 159-160 (2000) |
| 51 | | Olivier Danvy,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 13(4): 287-288 (2000) |
| 50 | | Olivier Danvy,
Ulrik Pagh Schultz:
Lambda-dropping: transforming recursive equations into programs with block structure.
Theor. Comput. Sci. 248(1-2): 243-287 (2000) |
| 1999 |
|---|
| 49 | | Olivier Danvy,
Zhe Yang:
An Operational Investigation of the CPS Hierarchy.
ESOP 1999: 224-242 |
| 48 | | Olivier Danvy:
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping.
Fuji International Symposium on Functional and Logic Programming 1999: 241-250 |
| 47 | | Olivier Danvy,
Belmina Dzafic,
Frank Pfenning:
On proving syntactic properties of CPS programs.
Electr. Notes Theor. Comput. Sci. 26: (1999) |
| 46 | | Olivier Danvy,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 12(1): 5 (1999) |
| 45 | | Olivier Danvy,
Carolyn L. Talcott:
Introduction.
Higher-Order and Symbolic Computation 12(2): 123-124 (1999) |
| 44 | | Olivier Danvy,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 12(3): 219 (1999) |
| 43 | | Olivier Danvy,
Carolyn L. Talcott:
Editorial.
Higher-Order and Symbolic Computation 12(4): 307-308 (1999) |
| 1998 |
|---|
| 42 | | Olivier Danvy:
Online Type-Directed Partial Evaluation.
Fuji International Symposium on Functional and Logic Programming 1998: 271-295 |
| 41 | | Olivier Danvy:
A Simple Solution to Type Specialization.
ICALP 1998: 908-917 |
| 40 | | Olivier Danvy:
Type-Directed Partial Evaluation.
Partial Evaluation 1998: 367-411 |
| 39 | | Olivier Danvy,
Kristoffer Høgsbro Rose:
Higher-Order Rewriting and Partial Evaluation.
RTA 1998: 286-301 |
| 38 | | Vincent Balat,
Olivier Danvy:
Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation.
Types in Compilation 1998: 240-252 |
| 37 | | Olivier Danvy,
Robert Glück,
Peter Thiemann:
1998 Symposium on Partial Evaluation.
ACM Comput. Surv. 30(3): 285-290 (1998) |
| 36 | | Olivier Danvy:
Functional Unparsing.
J. Funct. Program. 8(6): 621-625 (1998) |
| 1997 |
|---|
| 35 | | Olivier Danvy,
Ulrik Pagh Schultz:
Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure.
PEPM 1997: 90-106 |
| 34 | | John Hatcliff,
Olivier Danvy:
Thunks and the lambda-Calculus.
J. Funct. Program. 7(3): 303-319 (1997) |
| 33 | | Olivier Danvy,
Mayer Goldberg:
Partial Evaluation of the Euclidian Algorithm.
Lisp and Symbolic Computation 10(2): 101-111 (1997) |
| 32 | | John Hatcliff,
Olivier Danvy:
A Computational Formalization for Partial Evaluation.
Mathematical Structures in Computer Science 7(5): 507-541 (1997) |
| 1996 |
|---|
| 31 | | Olivier Danvy,
Robert Glück,
Peter Thiemann:
Partial Evaluation, International Seminar, Dagstuhl Castle, Germany, February 12-16, 1996, Selected Papers
Springer 1996 |
| 30 | | Olivier Danvy:
Pragmatics of Type-Directed Partial Evaluation.
Dagstuhl Seminar on Partial Evaluation 1996: 73-94 |
| 29 | | Olivier Danvy,
René Vestergaard:
Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation.
PLILP 1996: 182-197 |
| 28 | | Olivier Danvy:
Type-Directed Partial Evaluation.
POPL 1996: 242-257 |
| 27 | | Olivier Danvy,
Nevin Hentze,
Karoline Malmkjær:
Resource-Bounded Partial Evaluation.
ACM Comput. Surv. 28(2): 329-332 (1996) |
| 26 | | Olivier Danvy,
Karoline Malmkjær,
Jens Palsberg:
Eta-Expansion Does The Trick.
ACM Trans. Program. Lang. Syst. 18(6): 730-751 (1996) |
| 1995 |
|---|
| 25 | | Olivier Danvy,
Karoline Malmkjær,
Jens Palsberg:
The Essence of Eta-Expansion in Partial Evaluation.
Lisp and Symbolic Computation 8(3): 209-227 (1995) |
| 1994 |
|---|
| 24 | | Olivier Danvy:
Partial Evaluation for Program Speedups.
IFIP Congress (1) 1994: 579-580 |
| 23 | | Julia L. Lawall,
Olivier Danvy:
Continuation-Based Partial Evaluation.
LISP and Functional Programming 1994: 227-238 |
| 22 | | Olivier Danvy,
Karoline Malmkjær,
Jens Palsberg:
The Essence of Eta-Expansion in Partial Evaluation.
PEPM 1994: 11-20 |
| 21 | | John Hatcliff,
Olivier Danvy:
A Generic Account of Continuation-Passing Styles.
POPL 1994: 458-471 |
| 20 | | Olivier Danvy:
Back to Direct Style.
Sci. Comput. Program. 22(3): 183-195 (1994) |
| 1993 |
|---|
| 19 | | Olivier Danvy,
John Hatcliff:
On the Transformation between Direct and Continuation Semantics.
MFPS 1993: 627-648 |
| 18 | | Julia L. Lawall,
Olivier Danvy:
Separating Stages in the Continuation-Passing Style Transformation.
POPL 1993: 124-136 |
| 17 | | Charles Consel,
Olivier Danvy:
Tutorial Notes on Partial Evaluation.
POPL 1993: 493-501 |
| 1992 |
|---|
| 16 | | Olivier Danvy:
Back to Direct Style.
ESOP 1992: 130-150 |
| 15 | | Olivier Danvy,
Julia L. Lawall:
Back to Direct Style II: First-Class Continuations.
LISP and Functional Programming 1992: 299-310 |
| 14 | | Olivier Danvy,
John Hatcliff:
Thunks (Continued).
WSA 1992: 3-11 |
| 13 | | Olivier Danvy,
John Hatcliff:
CPS-Transformation After Strictness Analysis.
LOPLAS 1(3): 195-212 (1992) |
| 12 | | Charles Consel,
Olivier Danvy:
Partial Evaluation in Parallel.
Lisp and Symbolic Computation 5(4): 327-342 (1992) |
| 11 | | Olivier Danvy,
Andrzej Filinski:
Representing Control: A Study of the CPS Transformation.
Mathematical Structures in Computer Science 2(4): 361-391 (1992) |
| 1991 |
|---|
| 10 | | Charles Consel,
Olivier Danvy:
For a Better Support of Static Data Flow.
FPCA 1991: 496-519 |
| 9 | | Charles Consel,
Olivier Danvy:
Static and Dynamic Semantics Processing.
POPL 1991: 14-24 |
| 8 | | Olivier Danvy:
Semantics-Directed Compilation of Nonlinear Patterns.
Inf. Process. Lett. 37(6): 315-322 (1991) |
| 7 | | Anders Bondorf,
Olivier Danvy:
Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types.
Sci. Comput. Program. 16(2): 151-195 (1991) |
| 1990 |
|---|
| 6 | | Charles Consel,
Olivier Danvy:
From Interpreting to Compiling Binding Times.
ESOP 1990: 88-105 |
| 5 | | Neil D. Jones,
Carsten K. Gomard,
Anders Bondorf,
Olivier Danvy,
Torben Æ. Mogensen:
A Self-Applicable Partial Evaluator for the Lambda Calculus.
ICCL 1990: 49-58 |
| 4 | | Olivier Danvy,
Andrzej Filinski:
Abstracting Control.
LISP and Functional Programming 1990: 151-160 |
| 1989 |
|---|
| 3 | | Charles Consel,
Olivier Danvy:
Partial Evaluation of Pattern Matching in Strings.
Inf. Process. Lett. 30(2): 79-86 (1989) |
| 1988 |
|---|
| 2 | | Olivier Danvy,
Karoline Malmkjær:
Intensions and Extensions in a Reflective Tower.
LISP and Functional Programming 1988: 327-341 |
| 1987 |
|---|
| 1 | | Olivier Danvy:
Memory allocation and higher-order functions.
PLDI 1987: 241-252 |
