Olivier Danvy

ORCID

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 10

Top Venues

J. Funct. Program.

CoRR

IFL

ACM Trans. Program. Lang. Syst.

Publications

Olivier Danvy
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant - ERRATUM. J. Funct. Program. 33 (2023)
Olivier Danvy
The Tortoise and the Hare Algorithm for Finite Lists, Compositionally. ACM Trans. Program. Lang. Syst. 45 (1) (2023)
Olivier Danvy
Folding left and right matters: Direct style, accumulators, and continuations. J. Funct. Program. 33 (2023)
Olivier Danvy
A Deforestation of Reducts: Refocusing. CoRR (2023)
Olivier Danvy
Getting There and Back Again. CoRR (2022)
Olivier Danvy
Getting There and Back Again. Fundam. Informaticae 185 (2) (2022)
Olivier Danvy
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant. J. Funct. Program. 32 (2022)
Olivier Danvy
Folding left and right over Peano numbers. J. Funct. Program. 29 (2019)
Olivier Danvy
Mystery functions: making specifications, unit tests, and implementations coexist in the mind of undergraduate students. IFL (2019)
Dariusz Biernacki, Olivier Danvy, Kevin Millikin
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations. ACM Trans. Program. Lang. Syst. 38 (1) (2015)
Christian Clausen, Olivier Danvy, Moe Masuko
A characterization of Moessner's sieve. Theor. Comput. Sci. 546 (2014)
Olivier Danvy, Chantal Keller, Matthias Puech
Typeful Normalization by Evaluation. TYPES (2014)
Olivier Danvy, Jacob Johannsen
From Outermost Reduction Semantics to Abstract Machine. LOPSTR (2013)
Olivier Danvy, Peter Thiemann, Ian Zerny
Circularity and Lambda Abstraction: From Bird to Pettorossi and back. IFL (2013)
Olivier Danvy, Ian Zerny
Three syntactic theories for combinatory graph reduction. ACM Trans. Comput. Log. 14 (4) (2013)
Olivier Danvy, Ian Zerny
A synthetic operational account of call-by-need evaluation. PPDP (2013)
Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation. Theor. Comput. Sci. 435 (2012)
Olivier Danvy
On submissions and resubmissions. ACM SIGPLAN Notices 47 (4a) (2012)
Luca Chiarabini, Olivier Danvy
A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration. J. Formaliz. Reason. 4 (1) (2011)
Olivier Danvy, Jacob Johannsen, Ian Zerny
A walk in the semantic park. PEPM (2011)
Olivier Danvy
Pragmatics for formal semantics. GPCE (2011)
Olivier Danvy, Jan Midtgaard
Abstracting abstract machines: technical perspective. Commun. ACM 54 (9) (2011)
Olivier Danvy, Jacob Johannsen
Inter-deriving semantic artifacts for object-oriented programming. J. Comput. Syst. Sci. 76 (5) (2010)
Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny
Defunctionalized Interpreters for Call-by-Need Evaluation. FLOPS (2010)
Olivier Danvy, Ian Zerny
Three Syntactic Theories for Combinatory Graph Reduction. LOPSTR (2010)
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)
Olivier Danvy, Carolyn L. Talcott
Editorial. High. Order Symb. Comput. 22 (3) (2009)
Olivier Danvy, Julian A. Padget
Editorial. High. Order Symb. Comput. 22 (1) (2009)
Olivier Danvy, Carolyn L. Talcott
Editorial. High. Order Symb. Comput. 22 (4) (2009)
Olivier Danvy, Kevin Millikin
Refunctionalization at work. Sci. Comput. Program. 74 (8) (2009)
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)
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)
Olivier Danvy
Peter J. Landin (1930-2009). High. Order Symb. Comput. 22 (2) (2009)
Olivier Danvy, Carolyn L. Talcott
Editorial. High. Order Symb. Comput. 22 (2) (2009)
Olivier Danvy, Kevin Millikin
A Rational Deconstruction of Landin's SECD Machine with the J Operator CoRR (2008)
Olivier Danvy
From Reduction-Based to Reduction-Free Normalization. Advanced Functional Programming (2008)
Olivier Danvy, Ian A. Mason
Editorial. High. Order Symb. Comput. 21 (4) (2008)
Olivier Danvy, R. Kent Dybvig, Julia Lawall, Peter Thiemann
Editorial. High. Order Symb. Comput. 21 (3) (2008)
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) (2008)
Olivier Danvy, Kevin Millikin
A Rational Deconstruction of Landin's SECD Machine with the J Operator. Log. Methods Comput. Sci. 4 (4) (2008)
Olivier Danvy
Defunctionalized interpreters for programming languages. ICFP (2008)
Olivier Danvy, Jacob Johannsen
Inter-deriving Semantic Artifacts for Object-Oriented Programming. WoLLIC (2008)
Olivier Danvy, Kevin Millikin, Lasse R. Nielsen
On one-pass CPS transformations. J. Funct. Program. 17 (6) (2007)
Malgorzata Biernacka, Olivier Danvy
A syntactic correspondence between context-sensitive calculi and abstract machines. Theor. Comput. Sci. 375 (1-3) (2007)
Olivier Danvy, J. Michael Spivey
On Barron and Strachey's cartesian product function. ICFP (2007)
Malgorzata Biernacka, Olivier Danvy
A concrete framework for environment machines. ACM Trans. Comput. Log. 9 (1) (2007)
Olivier Danvy, Hayo Thielecke
Editorial. High. Order Symb. Comput. 20 (4) (2007)
Olivier Danvy
Editorial. High. Order Symb. Comput. 20 (3) (2007)
Olivier Danvy, Peter W. O'Hearn, Philip Wadler
Preface. Theor. Comput. Sci. 375 (1-3) (2007)
Olivier Danvy, Henning Korsholm Rohde
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation. Inf. Process. Lett. 99 (4) (2006)
Dariusz Biernacki, Olivier Danvy
Theoretical Pearl: A simple proof of a folklore theorem about delimited control. J. Funct. Program. 16 (3) (2006)
Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde
Fast partial evaluation of pattern matching in strings. ACM Trans. Program. Lang. Syst. 28 (4) (2006)
Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan
On the static and dynamic extents of delimited continuations. Sci. Comput. Program. 60 (3) (2006)
Olivier Danvy, Andrzej Filinski, Jean-Louis Giavitto, Andy King, Pierre-Etienne Moreau, Carolyn L. Talcott
Editorial. High. Order Symb. Comput. 19 (4) (2006)
Olivier Danvy, Oege de Moor, Julian A. Padget, Peter Thiemann
Editorial. High. Order Symb. Comput. 19 (1) (2006)
Olivier Danvy
Refunctionalization at Work. MPC (2006)
Olivier Danvy
From Reduction-based to Reduction-free Normalization. Electron. Notes Theor. Comput. Sci. 124 (2) (2005)
Olivier Danvy, Lasse R. Nielsen
CPS transformation of beta-redexes. Inf. Process. Lett. 94 (5) (2005)
Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
An Operational Foundation for Delimited Continuations in the CPS Hierarchy. Log. Methods Comput. Sci. 1 (2) (2005)
Olivier Danvy, Kevin Millikin
A Rational Deconstruction of Landin's J Operator. IFL (2005)
Malgorzata Biernacka, Olivier Danvy, Kristian Støvring
Program Extraction From Proofs of Weak Head Normalization. MFPS (2005)
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) (2005)
Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
An Operational Foundation for Delimited Continuations in the CPS Hierarchy CoRR (2005)
Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan
On the dynamic extent of delimited continuations. Inf. Process. Lett. 96 (1) (2005)
Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
Editorial. High. Order Symb. Comput. 18 (1-2) (2005)
Olivier Danvy, Mayer Goldberg
There and Back Again. Fundam. Informaticae 66 (4) (2005)
Olivier Danvy, Ulrik Pagh Schultz
Lambda-Lifting in Quadratic Time. J. Funct. Log. Program. 2004 (2004)
Olivier Danvy
A Rational Deconstruction of Landin's SECD Machine. IFL (2004)
David A. Basin, Olivier Danvy, Robert Harper
Editorial. High. Order Symb. Comput. 17 (3) (2004)
Mads Sig Ager, Olivier Danvy, Jan Midtgaard
A functional correspondence between call-by-need evaluators and lazy abstract machines. Inf. Process. Lett. 90 (5) (2004)
Olivier Danvy, Ian A. Mason
Editorial. High. Order Symb. Comput. 17 (4) (2004)
Wei-Ngan Chin, Olivier Danvy, Peter Thiemann
Editorial: Theme Issue on Partial Evaluation and Semantics-Based Program Manipulation. High. Order Symb. Comput. 17 (1-2) (2004)
Dariusz Biernacki, Olivier Danvy
From Interpreter to Logic Engine by Defunctionalization. LOPSTR (2003)
Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi
Editorial: Special Issue Dedicated to Bob Paige. High. Order Symb. Comput. 16 (1-2) (2003)
Daniel Damian, Olivier Danvy
Syntactic accidents in program analysis: on the impact of the CPS transformation. J. Funct. Program. 13 (5) (2003)
Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde
Fast partial evaluation of pattern matching in strings. PEPM (2003)
Olivier Danvy, Pablo E. Martínez López
Tagging, Encoding, and Jones Optimality. ESOP (2003)
Olivier Danvy
A Journey from Interpreters to Compilers and Virtual Machines. GPCE (2003)
Olivier Danvy
A New One-Pass Transformation into Monadic Normal Form. CC (2003)
Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard
A functional correspondence between evaluators and abstract machines. PPDP (2003)
Daniel Damian, Olivier Danvy
CPS transformation of flow information, Part II: administrative reductions. J. Funct. Program. 13 (5) (2003)
Olivier Danvy, Lasse R. Nielsen
A first-order one-pass CPS transformation. Theor. Comput. Sci. 308 (1-3) (2003)
Olivier Danvy, Lasse R. Nielsen
A First-Order One-Pass CPS Transformation. FoSSaCS (2002)
Olivier Danvy, Takayasu Ito, Carolyn L. Talcott
Editorial. High. Order Symb. Comput. 15 (1) (2002)
Daniel Damian, Olivier Danvy
A Simple CPS Transformation of Control-Flow Information. Log. J. IGPL 10 (5) (2002)
Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær
The Abstraction and Instantiation of String-Matching Programs. The Essence of Computation (2002)
Mads Sig Ager, Olivier Danvy, Mayer Goldberg
A Symmetric Approach to Compilation and Decompilation. The Essence of Computation (2002)
Olivier Danvy, Ulrik Pagh Schultz
Lambda-Lifting in Quadratic Time. FLOPS (2002)
Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde
On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation. ASIA-PEPM (2002)
Vincent Balat, Olivier Danvy
Memoization in Type-Directed Partial Evaluation. GPCE (2002)
Olivier Danvy, Carolyn L. Talcott
Editorial. High. Order Symb. Comput. 15 (4) (2002)
Olivier Danvy, Amr Sabry
Editorial. High. Order Symb. Comput. 15 (2-3) (2002)
Olivier Danvy, Mayer Goldberg
There and back again. ICFP (2002)
Olivier Danvy, Lasse R. Nielsen
A Higher-Order Colon Translation. FLOPS (2001)
Olivier Danvy, Julia L. Lawall
Editorial. High. Order Symb. Comput. 14 (2-3) (2001)
Olivier Danvy, Lasse R. Nielsen
Defunctionalization at Work. PPDP (2001)
Olivier Danvy, Morten Rhiger, Kristoffer Høgsbro Rose
Normalization by evaluation with typed abstract syntax. J. Funct. Program. 11 (6) (2001)
Daniel Damian, Olivier Danvy
Static Transition Compression. SAIG (2001)
Olivier Danvy, Morten Rhiger
A Simple Take on Typed Abstract Syntax in Haskell-like Languages. FLOPS (2001)
Olivier Danvy, Lasse R. Nielsen
Syntactic Theories in Practice. Electron. Notes Theor. Comput. Sci. 59 (4) (2001)

Olivier Danvy.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Olivier Danvy