Olivier Danvy | Academic Influence

Olivier Danvy's AcademicInfluence.com Rankings

Olivier Danvy

Computer Science

#1169

World Rank

#1209

Historical Rank

Programming

#28

World Rank

#30

Historical Rank

Algorithms

#340

World Rank

#345

Historical Rank

Database

#3014

World Rank

#3142

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Olivier Danvy's Degrees

PhD Computer Science University of Copenhagen
Masters Computer Science University of Copenhagen
Bachelors Mathematics University of Copenhagen

Similar Degrees You Can Earn

Why Is Olivier Danvy Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Olivier Danvy is a French computer scientist specializing in programming languages, partial evaluation, and continuations. He is a professor at Yale-NUS College in Singapore. Danvy received his PhD degree from the Université Paris VI in 1986. He is notable for the number of scientific papers which acknowledge his help. Writing in Nature, editor Declan Butler reports on an analysis of acknowledgments on nearly one third of a million scientific papers and reports that Danvy is "the most thanked person in computer science".

(See a Problem?)

Olivier Danvy's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Abstracting control (1990) (403)
Tutorial notes on partial evaluation (1993) (367)
Representing Control: a Study of the CPS Transformation (1992) (358)
Type-directed partial evaluation (1995) (254)
A functional correspondence between evaluators and abstract machines (2003) (177)
Defunctionalization at work (2001) (174)
Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types (1991) (166)
A Functional Abstraction of Typed Contexts (1989) (142)
A generic account of continuation-passing styles (1994) (140)
Refocusing in Reduction Semantics (2004) (116)
Back to Direct Style (1992) (113)
Partial Evaluation of Pattern Matching in Strings (1989) (102)
For a Better Support of Static Data Flow (1991) (98)
Relational Reasoning about Functions and Nondeterminism (1999) (96)
Many Happy Returns (2001) (95)
Continuation-based partial evaluation (1994) (95)
A self-applicable partial evaluator for the lambda calculus (1990) (93)
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (2003) (89)
An Operational Foundation for Delimited Continuations in the CPS Hierarchy (2005) (87)
A concrete framework for environment machines (2005) (84)
Back to direct style II: first-class continuations (1992) (79)
A Rational Deconstruction of Landin's SECD Machine (2003) (79)
Partial evaluation (2003) (78)
A functional correspondence between call-by-need evaluators and lazy abstract machines (2003) (74)
Lambda-dropping: transforming recursive equations into programs with block structure (1997) (72)
Static and dynamic semantics processing (1991) (72)
A syntactic correspondence between context-sensitive calculi and abstract machines (2005) (71)
Eta-expansion does The Trick (1995) (71)
From Reduction-based to Reduction-free Normalization (2004) (70)
Functional unparsing (1998) (70)
From Interpreter to Compiler and Virtual Machine: A Functional Derivation (2003) (69)
Intensions and extensions in a reflective tower (1988) (68)
Thunks and the λ-calculus (1996) (68)
A computational formalization for partial evaluation (1997) (65)
Defunctionalized interpreters for programming languages (2008) (64)
Fast partial evaluation of pattern matching in strings (2003) (59)
Abstracting abstract machines (2011) (58)
Refunctionalization at work (2006) (54)
A first-order one-pass CPS transformation (2001) (51)
The essence of eta-expansion in partial evaluation (1995) (50)
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation (2006) (47)
CPS-transformation after strictness analysis (1992) (46)
On Evaluation Contexts, Continuations, and the Rest of the Computation (2004) (46)
Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation (1996) (43)
Syntactic accidents in program analysis: on the impact of the CPS transformation (2000) (41)
On the static and dynamic extents of delimited continuations (2005) (41)
On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion (2007) (40)
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping (1998) (39)
From Interpreting to Compiling Binding Times (1990) (38)
From Interpreter to Logic Engine by Defunctionalization (2003) (38)
A Simple Proof of a Folklore Theorem about Delimited Control (2005) (36)
Formal Modeling: Actors, Open Systems, Biological Systems (2011) (34)
On proving syntactic properties of CPS programs (1999) (34)
Assessing the Overhead of ML Exceptions by Selective CPS Transformation (1998) (33)
Memoization in Type-Directed Partial Evaluation (2002) (33)
Syntactic Theories in Practice (2001) (33)
A synthetic operational account of call-by-need evaluation (2013) (32)
The Abstraction and Instantiation of String-Matching Programs (2001) (31)
Semantics-Directed Compilation of Nonlinear Patterns (1991) (31)
Normalization by evaluation with typed abstract syntax (2001) (31)
An Operational Investigation of the CPS Hierarchy (1998) (31)
Formalizing Implementation Strategies for First-Class Continuations (1999) (30)
CPS transformation of flow information, Part II: administrative reductions (2001) (28)
Lambda-Lifting in Quadratic Time (2002) (28)
An Operational Foundation for Delimited Continuations (2003) (28)
Online Type-Directed Partial Evaluation (1997) (28)
On one-pass CPS transformations (2002) (28)
Separating stages in the continuation-passing style transformation (1993) (28)
On the dynamic extent of delimited continuations (2005) (27)
Pragmatics of Type-Directed Partial Evaluation (1996) (27)
The Occurrence of Continuation Parameters in CPS Terms (1995) (27)
On the Transformation between Direct and Continuation Semantics (1993) (26)
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation (2012) (26)
A Simple Solution to Type Specialization (1998) (25)
Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation (1998) (25)
CPS transformation of beta-redexes (2000) (24)
Defunctionalized Interpreters for Call-by-Need Evaluation (2010) (24)
A New One-Pass Transformation into Monadic Normal Form (2002) (24)
A walk in the semantic park (2011) (24)
Inter-deriving semantic artifacts for object-oriented programming (2008) (23)
Tagging, Encoding, and Jones Optimality (2003) (23)
On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation (2002) (21)
Memory allocation and higher-order functions (1987) (20)
Program Extraction From Proofs of Weak Head Normalization (2005) (20)
Partial evaluation : International Seminar, Dagstuhl Castle, Germany, February 12-16, 1996 : selected papers (1996) (19)
Higher-Order Rewriting and Partial Evaluation (1997) (18)
A Simple Take on Typed Abstract Syntax in Haskell-like Languages (2000) (17)
Three Steps for the CPS Transformation (2007) (17)
A Rational Deconstruction of Landin's J Operator (2005) (17)
On Barron and Strachey's cartesian product function (2007) (16)
Thunks (Continued) (1992) (16)
Compiling Actions by Partial Evaluation, Revisited (1998) (16)
Pragmatic Aspects of Type-Directed Partial Evaluation (1996) (16)
A Higher-Order Colon Translation (2000) (15)
Compiling Monads ∗ (1991) (15)
A Simple CPS Transformation of Control-Flow Information (2001) (15)
A Symmetric Approach to Compilation and Decompilation (2002) (14)
Thunks and the-calculus ( extended version ) (1997) (13)
There and back again (2001) (13)
A unifying approach to goal-directed evaluation (2001) (12)
Partial Evaluation of the Euclidian Algorithm (extended version) (1997) (12)
A Computational Formalization for Partial Evaluation (Extended Version) (1996) (11)
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations (2005) (11)
Analytical Approach to Programs as Data Objects (2017) (10)
A First-Order OnePass CPS Transformation ∗ (2001) (10)
Partial evaluation in parallel (1992) (10)
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines (2009) (10)
On listing list prefixes (1989) (9)
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines (2008) (8)
THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control (2006) (8)
On the Idempotence of the CPS Transformation (1996) (8)
Three syntactic theories for combinatory graph reduction (2010) (8)
From Outermost Reduction Semantics to Abstract Machine (2015) (7)
A Simple Application of Lightweight Fusion to Proving the Equivalence of Abstract Machines (2007) (7)
Partial evaluation: Principles and perspectives (1993) (7)
Eta-Expansion Does The Trick (Revised Version) (1996) (7)
Formal modeling actors, open systems, biological systems ; essays dedicated to Carolyn Talcott on the occasion of her 70th birthday (2011) (7)
Preliminary Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation NBE ’ 98 May 8 – 9 , Gothenburg , Sweden (1999) (6)
Automatic Program Development: A Tribute to Robert Paige (2008) (6)
Resource-bounded partial evaluation (1996) (5)
A Lambda-Revelation of the SECD Machine (2002) (5)
Formatting Strings in ML (1998) (5)
Selected Papers from the International Seminar on Partial Evaluation (1996) (5)
On some Functional Aspects of Control (1988) (5)
Typeful Normalization by Evaluation (2014) (4)
A Journey from Interpreters to Compilers and Virtual Machines (2003) (4)
Partial Evaluation of the Euclidian Algorithm (1997) (4)
the Boyer-Moore String-Matching Algorithm by Partial Evaluation (2005) (3)
Proceedings Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday: Dave Schmidt: a Lifetime of Scholarship (2013) (3)
Folding left and right over Peano numbers (2019) (3)
1998 symposium on partial evaluation (1998) (3)
J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations (2009) (3)
Programs as Data Objects (2001) (3)
Proceedings of the ACM SIGPLAN Workshop on Continuations CW92 (1993) (3)
Getting There and Back Again (2022) (2)
Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation (Preliminary Version) (1997) (2)
Higher-order and symbolic computation: editorial (2005) (2)
Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday, Manhattan, Kansas, USA, 19-20th September 2013 (2013) (2)
Proceedings of the Second Symposium on Programs as Data Objects (2001) (2)
A characterization of Moessner's sieve (2014) (2)
Automatic Program Development (2008) (2)
Circularity and Lambda Abstraction: From Bird to Pettorossi and back (2013) (1)
Programs as data objects : second symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001 : proceedings (2001) (1)
Static Transition Compression (2001) (1)
Folding left and right matters: Direct style, accumulators, and continuations (2023) (1)
A concrete framework for environment machines Ma (2005) (1)
Formal Study of Moessner's Sieve (2017) (1)
Mystery functions: making specifications, unit tests, and implementations coexist in the mind of undergraduate students (2019) (1)
The Scheme Programming Language (1992) (1)
Three Steps for the CPS Transformation ∗ (detailed abstract) (1992) (1)
Preprocessing by Program Specialization (1994) (1)
Editorial (2006) (0)
Partial Evaluation (Dagstuhl Seminar 9607) (2021) (0)
Editorial (2004) (0)
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant – ERRATUM (2023) (0)
Editorial (2008) (0)
More about Formatting (1993) (0)
On the Overhead of CPS (1996) (0)
Editorial (2001) (0)
Editorial (2009) (0)
Editorial (2002) (0)
Session details: Control-flow analysis (2007) (0)
2015 Workshop on Continuations (2015) (0)
Edinburgh, Scotland July 1–4, 2008 (2008) (0)
Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, September 26-28, 2005 (2005) (0)
Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming (2020) (0)
Circularity and Lambda Abstraction (2013) (0)
Editorial (2005) (0)
Introduction (1999) (0)
Proceedings of the Workshop on Continuations: Preface (2016) (0)
Partial Evaluation for Program Speedups (1994) (0)
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, Kent, Canterbury, United Kingdom, September 8-10, 2014 (2014) (0)
ADmmA 278 955 / ML Partial Evaluation using Set-Based Analysis (0)
Logic, semantics and theory of programming - Preface (2007) (0)
Universitet Simulation of two-way pushdown automata revisited (2013) (0)
Proceedings IFIP Working Conference on Domain-Specific Languages: Preface (2011) (0)
Singular Choices for Multiple Choice (2017) (0)
On submissions and resubmissions (2012) (0)
Editorial (2009) (0)
A Deforestation of Reducts: Refocusing (2023) (0)
Editorial (special issue on rule based programming) (2006) (0)
Thunks and the lambda-Calculus (Extended Version) (1997) (0)
Editorial (2001) (0)
Editorial (2000) (0)
Editorial (2000) (0)
Editorial (2004) (0)
Editorial (2007) (0)
Proceedings of the Workshop on Continuations (2016) (0)
Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant (2022) (0)
Editorial: Theme Issue on Partial Evaluation and Semantics-Based Program Manipulation (2004) (0)
Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming (2014) (0)
Editorial (2009) (0)
Editorial (2002) (0)
Editorial (1993) (0)
Editorial (2002) (0)
Proceedings IFIP Working Conference on Domain-Specific Languages, DSL 2011, Bordeaux, France, 6-8th September 2011 (2011) (0)
Editorial (2007) (0)
Functional Unparsing See Back Inner Page for a List of Recent Brics Report Series Publications. 1 the Problem 3 a Solution (1998) (0)
Editorial (1999) (0)
The Tortoise and the Hare Algorithm for Finite Lists, Compositionally (2022) (0)
Preface (2020) (0)
Editorial (1999) (0)
Editorial (2006) (0)
Pragmatics for formal semantics (2011) (0)
A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration (2011) (0)
Editorial (2009) (0)
Editorial: Special Issue Dedicated to Bob Paige (2003) (0)
Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming, Scheme 2012, Copenhagen, Denmark, September 9-15, 2012 (2012) (0)
Editorial (2008) (0)
In Memoriam Peter Landin (2009) (0)
Session details: Session 2 (1982) (0)
Peter J. Landin (1930–2009) (2009) (0)
Editorial (2001) (0)
Editorial (2000) (0)
RS-2 Tagging, Encoding, and Jones Optimality (2003) (0)

This paper list is powered by the following services:

Other Resources About Olivier Danvy

What Schools Are Affiliated With Olivier Danvy?

Olivier Danvy is affiliated with the following schools:

Image Attributions

Image Source for Olivier Danvy