Olivier Danvy

Orcid: 0000-0002-3890-3630

Affiliations:
  • Aarhus University, Denmark


According to our database1, Olivier Danvy authored at least 131 papers between 1987 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Tortoise and the Hare Algorithm for Finite Lists, Compositionally.
ACM Trans. Program. Lang. Syst., March, 2023

Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant - ERRATUM.
J. Funct. Program., 2023

Folding left and right matters: Direct style, accumulators, and continuations.
J. Funct. Program., 2023

A Deforestation of Reducts: Refocusing.
CoRR, 2023

2022
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant.
J. Funct. Program., 2022

Getting There and Back Again.
Fundam. Informaticae, 2022

2019
Folding left and right over Peano numbers.
J. Funct. Program., 2019

Mystery functions: making specifications, unit tests, and implementations coexist in the mind of undergraduate students.
Proceedings of the IFL '19: Implementation and Application of Functional Languages, 2019

2015
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations.
ACM Trans. Program. Lang. Syst., 2015

2014
A characterization of Moessner's sieve.
Theor. Comput. Sci., 2014

Typeful Normalization by Evaluation.
Proceedings of the 20th International Conference on Types for Proofs and Programs, 2014

2013
Three syntactic theories for combinatory graph reduction.
ACM Trans. Comput. Log., 2013

A synthetic operational account of call-by-need evaluation.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

From Outermost Reduction Semantics to Abstract Machine.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2013

Circularity and Lambda Abstraction: From Bird to Pettorossi and back.
Proceedings of the 25th Symposium on Implementation and Application of Functional Languages, 2013

2012
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation.
Theor. Comput. Sci., 2012

On submissions and resubmissions.
ACM SIGPLAN Notices, 2012

2011
A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration.
J. Formaliz. Reason., 2011

Abstracting abstract machines: technical perspective.
Commun. ACM, 2011

A walk in the semantic park.
Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2011

Pragmatics for formal semantics.
Proceedings of the Generative Programming And Component Engineering, 2011

2010
Inter-deriving semantic artifacts for object-oriented programming.
J. Comput. Syst. Sci., 2010

Defunctionalized Interpreters for Call-by-Need Evaluation.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Refunctionalization at work.
Sci. Comput. Program., 2009

Editorial.
High. Order Symb. Comput., 2009

Editorial.
High. Order Symb. Comput., 2009

Peter J. Landin (1930-2009).
High. Order Symb. Comput., 2009

J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations.
Proceedings of the Domain-Specific Languages, IFIP TC 2 Working Conference, 2009

Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines.
Proceedings of the Semantics and Algebraic Specification, 2009

Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines.
Proceedings of the Semantics and Algebraic Specification, 2009

2008
A Rational Deconstruction of Landin's SECD Machine with the J Operator.
Log. Methods Comput. Sci., 2008

Editorial.
High. Order Symb. Comput., 2008

Editorial.
High. Order Symb. Comput., 2008

On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion.
Inf. Process. Lett., 2008

Defunctionalized interpreters for programming languages.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

2007
A concrete framework for environment machines.
ACM Trans. Comput. Log., 2007

Preface.
Theor. Comput. Sci., 2007

A syntactic correspondence between context-sensitive calculi and abstract machines.
Theor. Comput. Sci., 2007

Editorial.
High. Order Symb. Comput., 2007

Editorial.
High. Order Symb. Comput., 2007

On one-pass CPS transformations.
J. Funct. Program., 2007

On Barron and Strachey's cartesian product function.
Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, 2007

2006
Fast partial evaluation of pattern matching in strings.
ACM Trans. Program. Lang. Syst., 2006

On the static and dynamic extents of delimited continuations.
Sci. Comput. Program., 2006

Editorial.
High. Order Symb. Comput., 2006

Editorial.
High. Order Symb. Comput., 2006

Theoretical Pearl: A simple proof of a folklore theorem about delimited control.
J. Funct. Program., 2006

On obtaining the Boyer-Moore string-matching algorithm by partial evaluation.
Inf. Process. Lett., 2006

Refunctionalization at Work.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006

2005
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects.
Theor. Comput. Sci., 2005

An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
Log. Methods Comput. Sci., 2005

Editorial.
High. Order Symb. Comput., 2005

CPS transformation of beta-redexes.
Inf. Process. Lett., 2005

On the dynamic extent of delimited continuations.
Inf. Process. Lett., 2005

There and Back Again.
Fundam. Informaticae, 2005

Program Extraction From Proofs of Weak Head Normalization.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

A Rational Deconstruction of Landin's J Operator.
Proceedings of the Implementation and Application of Functional Languages, 2005

2004
Editorial: Theme Issue on Partial Evaluation and Semantics-Based Program Manipulation.
High. Order Symb. Comput., 2004

Editorial.
High. Order Symb. Comput., 2004

Lambda-Lifting in Quadratic Time.
J. Funct. Log. Program., 2004

A functional correspondence between call-by-need evaluators and lazy abstract machines.
Inf. Process. Lett., 2004

From Reduction-based to Reduction-free Normalization.
Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, 2004

A Rational Deconstruction of Landin's SECD Machine.
Proceedings of the Implementation and Application of Functional Languages, 2004

2003
A first-order one-pass CPS transformation.
Theor. Comput. Sci., 2003

Editorial: Special Issue Dedicated to Bob Paige.
High. Order Symb. Comput., 2003

CPS transformation of flow information, Part II: administrative reductions.
J. Funct. Program., 2003

Syntactic accidents in program analysis: on the impact of the CPS transformation.
J. Funct. Program., 2003

A functional correspondence between evaluators and abstract machines.
Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

From Interpreter to Logic Engine by Defunctionalization.
Proceedings of the Logic Based Program Synthesis and Transformation, 2003

A Journey from Interpreters to Compilers and Virtual Machines.
Proceedings of the Generative Programming and Component Engineering, 2003

Tagging, Encoding, and Jones Optimality.
Proceedings of the Programming Languages and Systems, 2003

A New One-Pass Transformation into Monadic Normal Form.
Proceedings of the Compiler Construction, 12th International Conference, 2003

2002
Editorial.
High. Order Symb. Comput., 2002

A Simple CPS Transformation of Control-Flow Information.
Log. J. IGPL, 2002

On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation.
Proceedings of the ACM SIGPLAN ASIA-PEPM 2002, 2002

Memoization in Type-Directed Partial Evaluation.
Proceedings of the Generative Programming and Component Engineering, 2002

The Abstraction and Instantiation of String-Matching Programs.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

A Symmetric Approach to Compilation and Decompilation.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001
Syntactic Theories in Practice.
Proceedings of the Second International Workshop on Rule-Based Programming, 2001

A Unifying Approach to Goal-directed Evaluation.
New Gener. Comput., 2001

Editorial.
High. Order Symb. Comput., 2001

Editorial.
High. Order Symb. Comput., 2001

Normalization by evaluation with typed abstract syntax.
J. Funct. Program., 2001

Many Happy Returns.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

Static Transition Compression.
Proceedings of the Semantics, 2001

Defunctionalization at Work.
Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001

A Simple Take on Typed Abstract Syntax in Haskell-like Languages.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

A Higher-Order Colon Translation.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

2000
Lambda-dropping: transforming recursive equations into programs with block structure.
Theor. Comput. Sci., 2000

Formalizing Implementation Strategies for First-Class Continuations.
Proceedings of the Programming Languages and Systems, 2000

1999
Introduction.
High. Order Symb. Comput., 1999

On proving syntactic properties of CPS programs.
Proceedings of the Third Workshop on Higher-Order Operational Techniques in Semantics, 1999

An Extensional Characterization of Lambda-Lifting and Lambda-Dropping.
Proceedings of the Functional and Logic Programming, 4th Fuji International Symposium, 1999

An Operational Investigation of the CPS Hierarchy.
Proceedings of the Programming Languages and Systems, 1999

1998
Functional Unparsing.
J. Funct. Program., 1998

1998 Symposium on Partial Evaluation.
ACM Comput. Surv., 1998

Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation.
Proceedings of the Types in Compilation, Second International Workshop, 1998

Higher-Order Rewriting and Partial Evaluation.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

Type-Directed Partial Evaluation.
Proceedings of the Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, Copenhagen, Denmark, June 29, 1998

A Simple Solution to Type Specialization.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Online Type-Directed Partial Evaluation.
Proceedings of the Third Fuji International Symposium on Functional and Logic Programming, 1998

1997
A Computational Formalization for Partial Evaluation.
Math. Struct. Comput. Sci., 1997

Partial Evaluation of the Euclidian Algorithm.
LISP Symb. Comput., 1997

Thunks and the lambda-Calculus.
J. Funct. Program., 1997

1996
Eta-Expansion Does The Trick.
ACM Trans. Program. Lang. Syst., 1996

Resource-Bounded Partial Evaluation.
ACM Comput. Surv., 1996

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation.
Proceedings of the Programming Languages: Implementations, 1996

Pragmatics of Type-Directed Partial Evaluation.
Proceedings of the Partial Evaluation, International Seminar, 1996

1995
The Essence of Eta-Expansion in Partial Evaluation.
LISP Symb. Comput., 1995

1994
Back to Direct Style.
Sci. Comput. Program., 1994

A Generic Account of Continuation-Passing Styles.
Proceedings of the Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1994

Continuation-Based Partial Evaluation.
Proceedings of the 1994 ACM Conference on LISP and Functional Programming, 1994

Partial Evaluation for Program Speedups.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
Separating Stages in the Continuation-Passing Style Transformation.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

Tutorial Notes on Partial Evaluation.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

On the Transformation between Direct and Continuation Semantics.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992
Representing Control: A Study of the CPS Transformation.
Math. Struct. Comput. Sci., 1992

CPS-Transformation After Strictness Analysis.
LOPLAS, 1992

Partial Evaluation in Parallel.
LISP Symb. Comput., 1992

Thunks (Continued).
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

Back to Direct Style II: First-Class Continuations.
Proceedings of the Conference on Lisp and Functional Programming, 1992

1991
Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types.
Sci. Comput. Program., 1991

Semantics-Directed Compilation of Nonlinear Patterns.
Inf. Process. Lett., 1991

Static and Dynamic Semantics Processing.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

For a Better Support of Static Data Flow.
Proceedings of the Functional Programming Languages and Computer Architecture, 1991

1990
Abstracting Control.
Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990

A Self-Applicable Partial Evaluator for the Lambda Calculus.
Proceedings of the 1990 Internation Conference on Computer Languages, 1990

From Interpreting to Compiling Binding Times.
Proceedings of the ESOP'90, 1990

1989
Partial Evaluation of Pattern Matching in Strings.
Inf. Process. Lett., 1989

1988
Intensions and Extensions in a Reflective Tower.
Proceedings of the 1988 ACM Conference on LISP and Functional Programming, 1988

1987
Memory allocation and higher-order functions.
Proceedings of the Symposium on Interpreters and Interpretive Techniques, 1987, St. Paul, Minnesota, USA, June 24, 1987


  Loading...