♂ Person: Olivier Danvy

DBLP: Danvy:Olivier

Facilitated 6 volumes:

Ed

Ed

Ed

PrCo

Ed

Ed

Contributed to:

2013

2013

2013

2011

2011

2010

2010

2008

2008

2007

2005

2004

2003

2003

2003

2003

2003

2003

2002

2002

2002

2002

2002

2001

2001

2001

2001

2000

2000

1999

1999

1998

1998

1998

1997

1996

1996

1994

1994

1994

1993

1992

1994

1992

1992

1991

1991

1990

1990

1988

1987

Wrote 54 papers:

IFL-2013-DanvyTZ #abstraction

Circularity and λ Abstraction: From Bird to Pettorossi and back (OD, PT, IZ), p. 85.

LOPSTR-2013-DanvyJ #automaton #reduction #semantics

From Outermost Reduction Semantics to Abstract Machine (OD, JJ), pp. 91–108.

PPDP-2013-DanvyZ #call-by #evaluation

A synthetic operational account of call-by-need evaluation (OD, IZ), pp. 97–108.

GPCE-2011-Danvy #semantics

Pragmatics for formal semantics (OD), pp. 93–94.

PEPM-2011-DanvyJZ #semantics

A walk in the semantic park (OD, JJ, IZ), pp. 1–12.

FLOPS-2010-DanvyMMZ #call-by #evaluation

Defunctionalized Interpreters for Call-by-Need Evaluation (OD, KM, JM, IZ), pp. 240–256.

LOPSTR-2010-DanvyZ #combinator #graph #reduction

Three Syntactic Theories for Combinatory Graph Reduction (OD, IZ), pp. 1–20.

AFP-2008-Danvy08 #normalisation

From Reduction-Based to Reduction-Free Normalization (OD), pp. 66–164.

ICFP-2008-Danvy #programming language

Defunctionalized interpreters for programming languages (OD), pp. 131–142.

ICFP-2007-DanvyS #on the

On Barron and Strachey’s cartesian product function (OD, JMS), pp. 41–46.

IFL-2005-DanvyM

A Rational Deconstruction of Landin’s J Operator (OD, KM), pp. 55–73.

IFL-2004-Danvy

A Rational Deconstruction of Landin’s SECD Machine (OD), pp. 52–71.

CC-2003-Danvy #monad #normalisation

A New One-Pass Transformation into Monadic Normal Form (OD), pp. 77–89.

ESOP-2003-DanvyL #encoding

Tagging, Encoding, and Jones Optimality (OD, PEML), pp. 335–347.

GPCE-2003-Danvy #compilation #virtual machine

A Journey from Interpreters to Compilers and Virtual Machines (OD), p. 117.

LOPSTR-2003-BiernackiD #interpreter #logic

From Interpreter to Logic Engine by Defunctionalization (DB, OD), pp. 143–159.

PEPM-2003-AgerDR #partial evaluation #pattern matching #performance #string

Fast partial evaluation of pattern matching in strings (MSA, OD, HKR), pp. 3–9.

PPDP-2003-AgerBDM #automaton #functional

A functional correspondence between evaluators and abstract machines (MSA, DB, OD, JM), pp. 8–19.

ASIA-PEPM-2002-AgerDR #on the #partial evaluation #string

On obtaining Knuth, Morris, and Pratt’s string matcher by partial evaluation (MSA, OD, HKR), pp. 32–46.

FLOPS-2002-DanvyS #polynomial #λ-calculus

λ-Lifting in Quadratic Time (OD, UPS), pp. 134–151.

FoSSaCS-2002-DanvyN #continuation #first-order

A First-Order One-Pass CPS Transformation (OD, LRN), pp. 98–113.

GPCE-2002-BalatD #partial evaluation

Memoization in Type-Directed Partial Evaluation (VB, OD), pp. 78–92.

ICFP-2002-DanvyG

There and back again (OD, MG), pp. 230–234.

FLOPS-2001-DanvyN #higher-order

A Higher-Order Colon Translation (OD, LRN), pp. 78–91.

FLOPS-2001-DanvyR #haskell #syntax

A Simple Take on Typed Abstract Syntax in Haskell-like Languages (OD, MR), pp. 343–358.

PPDP-2001-DanvyN

Defunctionalization at Work (OD, LRN), pp. 162–174.

SAIG-2001-DamianD

Static Transition Compression (DD, OD), pp. 92–107.

SAIG-2001-DanvyGR #approach #evaluation

A Unifying Approach to Goal-Directed Evaluation (OD, BG, MR), pp. 108–125.

TLCA-2001-Danvy

Many Happy Returns (OD), p. 1.

ESOP-2000-Danvy #continuation #formal method #implementation

Formalizing Implementation Strategies for First-Class Continuations (OD), pp. 88–103.

ICFP-2000-DamianD #continuation #program analysis

Syntactic accidents in program analysis: on the impact of the CPS transformation (DD, OD), pp. 209–220.

ESOP-1999-DanvyY #continuation

An Operational Investigation of the CPS Hierarchy (OD, ZY), pp. 224–242.

FLOPS-1999-Danvy #λ-calculus

An Extensional Characterization of λ-Lifting and λ-Dropping (OD), pp. 241–250.

FLOPS-1998-Danvy #online #partial evaluation

Online Type-Directed Partial Evaluation (OD), pp. 271–295.

ICALP-1998-Danvy

A Simple Solution to Type Specialization (OD), pp. 908–917.

RTA-1998-DanvyR #higher-order #partial evaluation

Higher-Order Rewriting and Partial Evaluation (OD, KHR), pp. 286–301.

PEPM-1997-DanvyS #equation #named #recursion #source code #λ-calculus

λ-Dropping: Transforming Recursive Equations into Programs with Block Structure (OD, UPS), pp. 90–106.

PLILP-1996-DanvyV #case study #compilation #partial evaluation #semantics

Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation (OD, RV), pp. 182–197.

POPL-1996-Danvy #partial evaluation

Type-Directed Partial Evaluation (OD), pp. 242–257.

LFP-1994-LawallD #partial evaluation

Continuation-Based Partial Evaluation (JLL, OD), pp. 227–238.

PEPM-1994-DanvyMP #partial evaluation

The Essence of Eta-Expansion in Partial Evaluation (OD, KM, JP), pp. 11–20.

POPL-1994-HatcliffD #continuation

A Generic Account of Continuation-Passing Styles (JH, OD), pp. 458–471.

POPL-1993-ConselD #partial evaluation #tutorial

Tutorial Notes on Partial Evaluation (CC, OD), pp. 493–501.

POPL-1993-LawallD #continuation

Separating Stages in the Continuation-Passing Style Transformation (JLL, OD), pp. 124–136.

ESOP-1992-Danvy

Back to Direct Style (OD), pp. 130–150.

ESOP-J-1992-Danvy94

Back to Direct Style (OD), pp. 183–195.

LFP-1992-DanvyL #continuation

Back to Direct Style II: First-Class Continuations (OD, JLL), pp. 299–310.

WSA-1992-DanvyH

Thunks (Continued) (OD, JH), pp. 3–11.

FPCA-1991-ConselD #data flow

For a Better Support of Static Data Flow (CC, OD), pp. 496–519.

POPL-1991-ConselD #semantics

Static and Dynamic Semantics Processing (CC, OD), pp. 14–24.

ESOP-1990-ConselD #compilation

From Interpreting to Compiling Binding Times (CC, OD), pp. 88–105.

LFP-1990-DanvyF

Abstracting Control (OD, AF), pp. 151–160.

LFP-1988-DanvyM

Intensions and Extensions in a Reflective Tower (OD, KM), pp. 327–341.

PLDI-1987-Danvy #higher-order #memory management

Memory allocation and higher-order functions (OD), pp. 241–252.