Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Olivier Danvy
2010 – today
- 2013
[c64]- [i3]Anindya Banerjee, Olivier Danvy, Kyung-Goo Doh, John Hatcliff: Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday. CoRR abs/1309.4557 (2013)
- 2012
- [j76]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: 21-42 (2012)
- 2011
- [j75]Olivier Danvy, Jan Midtgaard: Abstracting abstract machines: technical perspective. Commun. ACM 54(9): 100 (2011)
- [c63]
- [c62]
- [e8]Gul Agha, Olivier Danvy, José Meseguer (Eds.): Formal Modeling: Actors, Open Systems, Biological Systems - Essays Dedicated to Carolyn Talcott on the Occasion of Her 70th Birthday. Lecture Notes in Computer Science 7000, Springer 2011, ISBN 978-3-642-24932-7
- [e7]Manuel M. T. Chakravarty, Zhenjiang Hu, Olivier Danvy (Eds.): Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, ICFP 2011, Tokyo, Japan, September 19-21, 2011. ACM 2011, ISBN 978-1-4503-0865-6
- [e6]Olivier Danvy, Chung-chieh Shan (Eds.): Proceedings IFIP Working Conference on Domain-Specific Languages. EPTCS 66, 2011
- 2010
- [j74]Olivier Danvy, Jacob Johannsen: Inter-deriving semantic artifacts for object-oriented programming. J. Comput. Syst. Sci. 76(5): 302-323 (2010)
- [c61]Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny: Defunctionalized Interpreters for Call-by-Need Evaluation. FLOPS 2010: 240-256
- [c60]Olivier Danvy, Ian Zerny: Three Syntactic Theories for Combinatory Graph Reduction. LOPSTR 2010: 1-20
2000 – 2009
- 2009
- [j73]
- [j72]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 22(2): 113 (2009)
- [j71]Olivier Danvy: Peter J. Landin (1930-2009). Higher-Order and Symbolic Computation 22(2): 191-195 (2009)
- [j70]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 22(3): 197 (2009)
- [j69]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 22(4): 293 (2009)
- [j68]Olivier Danvy, Kevin Millikin: Refunctionalization at work. Sci. Comput. Program. 74(8): 534-549 (2009)
- [c59]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
- [c58]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
- [c57]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
- 2008
- [j67]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)
- [j66]Olivier Danvy, R. Kent Dybvig, Julia L. Lawall, Peter Thiemann: Editorial. Higher-Order and Symbolic Computation 21(3): 237-238 (2008)
- [j65]
- [j64]Olivier Danvy, Kevin Millikin: A Rational Deconstruction of Landin's SECD Machine with the J Operator. Logical Methods in Computer Science 4(4) (2008)
- [c56]Olivier Danvy: From Reduction-Based to Reduction-Free Normalization. Advanced Functional Programming 2008: 66-164
- [c55]
- [c54]Olivier Danvy, Jacob Johannsen: Inter-deriving Semantic Artifacts for Object-Oriented Programming. WoLLIC 2008: 1-16
- [i2]Olivier Danvy, Kevin Millikin: A Rational Deconstruction of Landin's SECD Machine with the J Operator. CoRR abs/0811.3231 (2008)
- 2007
- [j63]Olivier Danvy, Kevin Millikin, Lasse R. Nielsen: On one-pass CPS transformations. J. Funct. Program. 17(6): 793-812 (2007)
- [j62]
- [j61]Olivier Danvy, Hayo Thielecke: Editorial. Higher-Order and Symbolic Computation 20(4): 337-338 (2007)
- [j60]
- [j59]Malgorzata Biernacka, Olivier Danvy: A syntactic correspondence between context-sensitive calculi and abstract machines. Theor. Comput. Sci. 375(1-3): 76-108 (2007)
- [j58]Malgorzata Biernacka, Olivier Danvy: A concrete framework for environment machines. ACM Trans. Comput. Log. 9(1) (2007)
- [c53]Olivier Danvy, J. Michael Spivey: On Barron and Strachey's cartesian product function. ICFP 2007: 41-46
- 2006
- [j57]Malgorzata Biernacka, Olivier Danvy, Kristian Støvring: Program Extraction From Proofs of Weak Head Normalization. Electr. Notes Theor. Comput. Sci. 155: 169-189 (2006)
- [j56]Olivier Danvy, Henning Korsholm Rohde: On obtaining the Boyer-Moore string-matching algorithm by partial evaluation. Inf. Process. Lett. 99(4): 158-162 (2006)
- [j55]Dariusz Biernacki, Olivier Danvy: Theoretical Pearl: A simple proof of a folklore theorem about delimited control. J. Funct. Program. 16(3): 269-280 (2006)
- [j54]Olivier Danvy, Oege de Moor, Julian A. Padget, Peter Thiemann: Editorial. Higher-Order and Symbolic Computation 19(1): 5 (2006)
- [j53]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)
- [j52]Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan: On the static and dynamic extents of delimited continuations. Sci. Comput. Program. 60(3): 274-297 (2006)
- [j51]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)
- [c52]
- 2005
- [j50]Olivier Danvy: From Reduction-based to Reduction-free Normalization. Electr. Notes Theor. Comput. Sci. 124(2): 79-100 (2005)
- [j49]
- [j48]Olivier Danvy, Lasse R. Nielsen: CPS transformation of beta-redexes. Inf. Process. Lett. 94(5): 217-224 (2005)
- [j47]Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan: On the dynamic extent of delimited continuations. Inf. Process. Lett. 96(1): 7-17 (2005)
- [j46]Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi: Editorial. Higher-Order and Symbolic Computation 18(1-2): 5-6 (2005)
- [j45]Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy: An Operational Foundation for Delimited Continuations in the CPS Hierarchy. Logical Methods in Computer Science 1(2) (2005)
- [j44]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)
- [c51]
- [e5]Olivier Danvy, Benjamin C. Pierce (Eds.): Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, September 26-28, 2005. ACM 2005, ISBN 1-59593-064-7
- [i1]Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy: An Operational Foundation for Delimited Continuations in the CPS Hierarchy. CoRR abs/cs/0508048 (2005)
- 2004
- [j43]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)
- [j42]Olivier Danvy, Ulrik Pagh Schultz: Lambda-Lifting in Quadratic Time. Journal of Functional and Logic Programming 2004 (2004)
- [j41]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)
- [j40]David A. Basin, Olivier Danvy, Robert Harper: Editorial. Higher-Order and Symbolic Computation 17(3): 171 (2004)
- [j39]
- [c50]
- 2003
- [j38]Daniel Damian, Olivier Danvy: Syntactic accidents in program analysis: on the impact of the CPS transformation. J. Funct. Program. 13(5): 867-904 (2003)
- [j37]Daniel Damian, Olivier Danvy: CPS transformation of flow information, Part II: administrative reductions. J. Funct. Program. 13(5): 925-933 (2003)
- [j36]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)
- [j35]Olivier Danvy, Lasse R. Nielsen: A first-order one-pass CPS transformation. Theor. Comput. Sci. 308(1-3): 239-257 (2003)
- [c49]
- [c48]
- [c47]
- [c46]Dariusz Biernacki, Olivier Danvy: From Interpreter to Logic Engine by Defunctionalization. LOPSTR 2003: 143-159
- [c45]Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde: Fast partial evaluation of pattern matching in strings. PEPM 2003: 3-9
- [c44]Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard: A functional correspondence between evaluators and abstract machines. PPDP 2003: 8-19
- 2002
- [j34]Daniel Damian, Olivier Danvy: A Simple CPS Transformation of Control-Flow Information. Logic Journal of the IGPL 10(5): 501-515 (2002)
- [j33]Olivier Danvy, Takayasu Ito, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 15(1): 5 (2002)
- [j32]
- [j31]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 15(4): 271 (2002)
- [c43]Mads Sig Ager, Olivier Danvy, Mayer Goldberg: A Symmetric Approach to Compilation and Decompilation. The Essence of Computation 2002: 296-331
- [c42]Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær: The Abstraction and Instantiation of String-Matching Programs. The Essence of Computation 2002: 332-357
- [c41]
- [c40]
- [c39]
- [c38]
- [c37]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
- 2001
- [j30]Olivier Danvy, Morten Rhiger, Kristoffer Høgsbro Rose: Normalization by evaluation with typed abstract syntax. J. Funct. Program. 11(6): 673-680 (2001)
- [j29]
- [j28]Olivier Danvy, Julia L. Lawall: Editorial. Higher-Order and Symbolic Computation 14(2-3): 99-100 (2001)
- [j27]Olivier Danvy, Takayasu Ito, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 14(4): 307 (2001)
- [j26]Olivier Danvy, Bernd Grobauer, Morten Rhiger: A Unifying Approach to Goal-directed Evaluation. New Generation Comput. 20(1): 53-74 (2001)
- [j25]Olivier Danvy, Lasse R. Nielsen: Syntactic Theories in Practice. Electr. Notes Theor. Comput. Sci. 59(4): 358-374 (2001)
- [c36]
- [c35]Olivier Danvy, Morten Rhiger: A Simple Take on Typed Abstract Syntax in Haskell-like Languages. FLOPS 2001: 343-358
- [c34]
- [c33]
- [c32]Olivier Danvy, Bernd Grobauer, Morten Rhiger: A Unifying Approach to Goal-Directed Evaluation. SAIG 2001: 108-125
- [c31]
- [e4]Olivier Danvy, Andrzej Filinski (Eds.): Programs as Data Objects, Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings. Lecture Notes in Computer Science 2053, Springer 2001, ISBN 3-540-42068-1
- 2000
- [j24]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 13(1/2): 5-6 (2000)
- [j23]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 13(3): 159-160 (2000)
- [j22]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 13(4): 287-288 (2000)
- [j21]Olivier Danvy, Ulrik Pagh Schultz: Lambda-dropping: transforming recursive equations into programs with block structure. Theor. Comput. Sci. 248(1-2): 243-287 (2000)
- [c30]Olivier Danvy: Formalizing Implementation Strategies for First-Class Continuations. ESOP 2000: 88-103
- [c29]Daniel Damian, Olivier Danvy: Syntactic accidents in program analysis: on the impact of the CPS transformation. ICFP 2000: 209-220
1990 – 1999
- 1999
- [j20]Olivier Danvy, Belmina Dzafic, Frank Pfenning: On proving syntactic properties of CPS programs. Electr. Notes Theor. Comput. Sci. 26: 21-33 (1999)
- [j19]
- [j18]Olivier Danvy, Carolyn L. Talcott: Introduction. Higher-Order and Symbolic Computation 12(2): 123-124 (1999)
- [j17]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 12(3): 219 (1999)
- [j16]Olivier Danvy, Carolyn L. Talcott: Editorial. Higher-Order and Symbolic Computation 12(4): 307-308 (1999)
- [c28]
- [c27]Olivier Danvy: An Extensional Characterization of Lambda-Lifting and Lambda-Dropping. Fuji International Symposium on Functional and Logic Programming 1999: 241-250
- [e3]Olivier Danvy (Ed.): Proceedings of the 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, San Antonio, Texas, USA, January 22-23, 1999. Technical report BRICS-NS-99-1. University of Aarhus 1999
- 1998
- [j15]Olivier Danvy, Robert Glück, Peter Thiemann: 1998 Symposium on Partial Evaluation. ACM Comput. Surv. 30(3): 285-290 (1998)
- [j14]
- [c26]Olivier Danvy: Online Type-Directed Partial Evaluation. Fuji International Symposium on Functional and Logic Programming 1998: 271-295
- [c25]
- [c24]
- [c23]Olivier Danvy, Kristoffer Høgsbro Rose: Higher-Order Rewriting and Partial Evaluation. RTA 1998: 286-301
- [c22]Vincent Balat, Olivier Danvy: Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation. Types in Compilation 1998: 240-252
- 1997
- [j13]John Hatcliff, Olivier Danvy: Thunks and the lambda-Calculus. J. Funct. Program. 7(3): 303-319 (1997)
- [j12]Olivier Danvy, Mayer Goldberg: Partial Evaluation of the Euclidian Algorithm. Lisp and Symbolic Computation 10(2): 101-111 (1997)
- [j11]John Hatcliff, Olivier Danvy: A Computational Formalization for Partial Evaluation. Mathematical Structures in Computer Science 7(5): 507-541 (1997)
- [c21]Olivier Danvy, Ulrik Pagh Schultz: Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure. PEPM 1997: 90-106
- 1996
- [j10]Olivier Danvy, Nevin Hentze, Karoline Malmkjær: Resource-Bounded Partial Evaluation. ACM Comput. Surv. 28(2): 329-332 (1996)
- [j9]Olivier Danvy, Karoline Malmkjær, Jens Palsberg: Eta-Expansion Does The Trick. ACM Trans. Program. Lang. Syst. 18(6): 730-751 (1996)
- [c20]Olivier Danvy: Pragmatics of Type-Directed Partial Evaluation. Dagstuhl Seminar on Partial Evaluation 1996: 73-94
- [c19]Olivier Danvy, René Vestergaard: Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation. PLILP 1996: 182-197
- [c18]
- [e2]Olivier Danvy, Robert Glück, Peter Thiemann (Eds.): Partial Evaluation, International Seminar, Dagstuhl Castle, Germany, February 12-16, 1996, Selected Papers. Lecture Notes in Computer Science 1110, Springer 1996, ISBN 3-540-61580-6
- 1995
- [j8]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
- [j7]
- [c17]
- [c16]Julia L. Lawall, Olivier Danvy: Continuation-Based Partial Evaluation. LISP and Functional Programming 1994: 227-238
- [c15]Olivier Danvy, Karoline Malmkjær, Jens Palsberg: The Essence of Eta-Expansion in Partial Evaluation. PEPM 1994: 11-20
- [c14]
- 1993
- [c13]Olivier Danvy, John Hatcliff: On the Transformation between Direct and Continuation Semantics. MFPS 1993: 627-648
- [c12]Julia L. Lawall, Olivier Danvy: Separating Stages in the Continuation-Passing Style Transformation. POPL 1993: 124-136
- [c11]
- 1992
- [j6]Charles Consel, Olivier Danvy: Partial Evaluation in Parallel. Lisp and Symbolic Computation 5(4): 327-342 (1992)
- [j5]Olivier Danvy, John Hatcliff: CPS-Transformation After Strictness Analysis. LOPLAS 1(3): 195-212 (1992)
- [j4]Olivier Danvy, Andrzej Filinski: Representing Control: A Study of the CPS Transformation. Mathematical Structures in Computer Science 2(4): 361-391 (1992)
- [c10]
- [c9]Olivier Danvy, Julia L. Lawall: Back to Direct Style II: First-Class Continuations. LISP and Functional Programming 1992: 299-310
- [c8]
- 1991
- [j3]Olivier Danvy: Semantics-Directed Compilation of Nonlinear Patterns. Inf. Process. Lett. 37(6): 315-322 (1991)
- [j2]Anders Bondorf, Olivier Danvy: Automatic Autoprojection of Recursive Equations with Global Variables and Abstract Data Types. Sci. Comput. Program. 16(2): 151-195 (1991)
- [c7]
- [c6]
- [e1]Charles Consel, Olivier Danvy (Eds.): Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'91, Yale University, New Haven, Connecticut, USA, June 17-19, 1991. ACM 1991, ISBN 0-89791-433-3
- 1990
- [c5]
- [c4]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
- [c3]
1980 – 1989
- 1989
- [j1]Charles Consel, Olivier Danvy: Partial Evaluation of Pattern Matching in Strings. Inf. Process. Lett. 30(2): 79-86 (1989)
- 1988
- [c2]Olivier Danvy, Karoline Malmkjær: Intensions and Extensions in a Reflective Tower. LISP and Functional Programming 1988: 327-341
- 1987
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:26 CEST by the dblp team