default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Danvy
Person information
- affiliation: Aarhus University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c73]Olivier Danvy
:
Nested Summations. JENSFEST 2024: 53-58- 2023
- [j83]Olivier Danvy:
Folding left and right matters: Direct style, accumulators, and continuations. J. Funct. Program. 33: e2 (2023) - [j82]Olivier Danvy:
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant - ERRATUM. J. Funct. Program. 33: e3 (2023) - [j81]Olivier Danvy:
The Tortoise and the Hare Algorithm for Finite Lists, Compositionally. ACM Trans. Program. Lang. Syst. 45(1): 1:1-1:35 (2023) - [i4]Olivier Danvy:
A Deforestation of Reducts: Refocusing. CoRR abs/2302.10455 (2023) - 2022
- [j80]Olivier Danvy:
Getting There and Back Again. Fundam. Informaticae 185(2): 115-183 (2022) - [j79]Olivier Danvy:
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant. J. Funct. Program. 32: e13 (2022) - [i3]Olivier Danvy:
Getting There and Back Again. CoRR abs/2203.00145 (2022)
2010 – 2019
- 2019
- [j78]Olivier Danvy:
Folding left and right over Peano numbers. J. Funct. Program. 29: e6 (2019) - [c72]Olivier Danvy:
Mystery functions: making specifications, unit tests, and implementations coexist in the mind of undergraduate students. IFL 2019: 2:1-2:9 - 2016
- [e12]Olivier Danvy, Ugo de'Liguoro:
Proceedings of the Workshop on Continuations, WoC 2016, London, UK, April 12th 2015. EPTCS 212, 2016 [contents] - 2015
- [j77]Dariusz Biernacki, Olivier Danvy, Kevin Millikin:
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations. ACM Trans. Program. Lang. Syst. 38(1): 2:1-2:25 (2015) - 2014
- [j76]Christian Clausen, Olivier Danvy, Moe Masuko:
A characterization of Moessner's sieve. Theor. Comput. Sci. 546: 244-256 (2014) - [c71]Olivier Danvy, Chantal Keller, Matthias Puech:
Typeful Normalization by Evaluation. TYPES 2014: 72-88 - [e11]Olaf Chitil, Andy King, Olivier Danvy:
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, Kent, Canterbury, United Kingdom, September 8-10, 2014. ACM 2014, ISBN 978-1-4503-2947-7 [contents] - 2013
- [j75]Olivier Danvy, Ian Zerny:
Three syntactic theories for combinatory graph reduction. ACM Trans. Comput. Log. 14(4): 29:1-29:27 (2013) - [c70]Olivier Danvy, Peter Thiemann, Ian Zerny:
Circularity and Lambda Abstraction: From Bird to Pettorossi and back. IFL 2013: 85 - [c69]Olivier Danvy, Jacob Johannsen:
From Outermost Reduction Semantics to Abstract Machine. LOPSTR 2013: 91-108 - [c68]Olivier Danvy, Ian Zerny:
A synthetic operational account of call-by-need evaluation. PPDP 2013: 97-108 - [e10]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, Manhattan, Kansas, USA, 19-20th September 2013. EPTCS 129, 2013 [contents] - 2012
- [j74]Olivier Danvy:
On submissions and resubmissions. ACM SIGPLAN Notices 47(4a): 28-29 (2012) - [j73]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) - [e9]Olivier Danvy:
Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming, Scheme 2012, Copenhagen, Denmark, September 9-15, 2012. ACM 2012, ISBN 978-1-4503-1895-2 [contents] - 2011
- [j72]Olivier Danvy, Jan Midtgaard:
Abstracting abstract machines: technical perspective. Commun. ACM 54(9): 100 (2011) - [j71]Luca Chiarabini, Olivier Danvy:
A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration. J. Formaliz. Reason. 4(1): 85-109 (2011) - [c67]Olivier Danvy:
Pragmatics for formal semantics. GPCE 2011: 93-94 - [c66]Olivier Danvy, Jacob Johannsen, Ian Zerny:
A walk in the semantic park. PEPM 2011: 1-12 - [e8]Gul Agha, Olivier Danvy, José Meseguer:
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 [contents] - [e7]Manuel M. T. Chakravarty, Zhenjiang Hu, Olivier Danvy:
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 [contents] - [e6]Olivier Danvy, Chung-chieh Shan:
Proceedings IFIP Working Conference on Domain-Specific Languages, DSL 2011, Bordeaux, France, 6-8th September 2011. EPTCS 66, 2011 [contents] - 2010
- [j70]Olivier Danvy, Jacob Johannsen:
Inter-deriving semantic artifacts for object-oriented programming. J. Comput. Syst. Sci. 76(5): 302-323 (2010) - [c65]Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny:
Defunctionalized Interpreters for Call-by-Need Evaluation. FLOPS 2010: 240-256 - [c64]Olivier Danvy, Ian Zerny:
Three Syntactic Theories for Combinatory Graph Reduction. LOPSTR 2010: 1-20
2000 – 2009
- 2009
- [j69]Olivier Danvy, Julian A. Padget:
Editorial. High. Order Symb. Comput. 22(1): 1 (2009) - [j68]Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 22(2): 113 (2009) - [j67]Olivier Danvy:
Peter J. Landin (1930-2009). High. Order Symb. Comput. 22(2): 191-195 (2009) - [j66]Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 22(3): 197 (2009) - [j65]Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 22(4): 293 (2009) - [j64]Olivier Danvy, Kevin Millikin:
Refunctionalization at work. Sci. Comput. Program. 74(8): 534-549 (2009) - [c63]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 - [c62]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 - [c61]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
- [j63]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) - [j62]Olivier Danvy, R. Kent Dybvig, Julia Lawall, Peter Thiemann:
Editorial. High. Order Symb. Comput. 21(3): 237-238 (2008) - [j61]Olivier Danvy, Ian A. Mason:
Editorial. High. Order Symb. Comput. 21(4): 359 (2008) - [j60]Olivier Danvy, Kevin Millikin:
A Rational Deconstruction of Landin's SECD Machine with the J Operator. Log. Methods Comput. Sci. 4(4) (2008) - [c60]Olivier Danvy:
From Reduction-Based to Reduction-Free Normalization. Advanced Functional Programming 2008: 66-164 - [c59]Olivier Danvy:
Defunctionalized interpreters for programming languages. ICFP 2008: 131-142 - [c58]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
- [j59]Olivier Danvy, Kevin Millikin, Lasse R. Nielsen:
On one-pass CPS transformations. J. Funct. Program. 17(6): 793-812 (2007) - [j58]Olivier Danvy:
Editorial. High. Order Symb. Comput. 20(3): 197-198 (2007) - [j57]Olivier Danvy, Hayo Thielecke:
Editorial. High. Order Symb. Comput. 20(4): 337-338 (2007) - [j56]Olivier Danvy, Peter W. O'Hearn, Philip Wadler:
Preface. Theor. Comput. Sci. 375(1-3): 1-2 (2007) - [j55]Malgorzata Biernacka, Olivier Danvy:
A syntactic correspondence between context-sensitive calculi and abstract machines. Theor. Comput. Sci. 375(1-3): 76-108 (2007) - [j54]Malgorzata Biernacka, Olivier Danvy:
A concrete framework for environment machines. ACM Trans. Comput. Log. 9(1): 6 (2007) - [c57]Olivier Danvy, J. Michael Spivey:
On Barron and Strachey's cartesian product function. ICFP 2007: 41-46 - 2006
- [j53]Olivier Danvy, Henning Korsholm Rohde:
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation. Inf. Process. Lett. 99(4): 158-162 (2006) - [j52]Dariusz Biernacki, Olivier Danvy:
Theoretical Pearl: A simple proof of a folklore theorem about delimited control. J. Funct. Program. 16(3): 269-280 (2006) - [j51]Olivier Danvy, Oege de Moor, Julian A. Padget, Peter Thiemann:
Editorial. High. Order Symb. Comput. 19(1): 5 (2006) - [j50]Olivier Danvy, Andrzej Filinski, Jean-Louis Giavitto, Andy King, Pierre-Etienne Moreau, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 19(4): 343-344 (2006) - [j49]Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan:
On the static and dynamic extents of delimited continuations. Sci. Comput. Program. 60(3): 274-297 (2006) - [j48]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) - [c56]Olivier Danvy:
Refunctionalization at Work. MPC 2006: 4 - 2005
- [j47]Olivier Danvy, Mayer Goldberg:
There and Back Again. Fundam. Informaticae 66(4): 397-413 (2005) - [j46]Olivier Danvy, Lasse R. Nielsen:
CPS transformation of beta-redexes. Inf. Process. Lett. 94(5): 217-224 (2005) - [j45]Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan:
On the dynamic extent of delimited continuations. Inf. Process. Lett. 96(1): 7-17 (2005) - [j44]Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi:
Editorial. High. Order Symb. Comput. 18(1-2): 5-6 (2005) - [j43]Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy:
An Operational Foundation for Delimited Continuations in the CPS Hierarchy. Log. Methods Comput. Sci. 1(2) (2005) - [j42]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) - [c55]Olivier Danvy, Kevin Millikin:
A Rational Deconstruction of Landin's J Operator. IFL 2005: 55-73 - [c54]Malgorzata Biernacka, Olivier Danvy, Kristian Støvring:
Program Extraction From Proofs of Weak Head Normalization. MFPS 2005: 169-189 - [e5]Olivier Danvy, Benjamin C. Pierce:
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 [contents] - [i1]Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy:
An Operational Foundation for Delimited Continuations in the CPS Hierarchy. CoRR abs/cs/0508048 (2005) - 2004
- [j41]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) - [j40]Olivier Danvy, Ulrik Pagh Schultz:
Lambda-Lifting in Quadratic Time. J. Funct. Log. Program. 2004 (2004) - [j39]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): 5-6 (2004) - [j38]David A. Basin, Olivier Danvy, Robert Harper:
Editorial. High. Order Symb. Comput. 17(3): 171 (2004) - [j37]Olivier Danvy, Ian A. Mason:
Editorial. High. Order Symb. Comput. 17(4): 275 (2004) - [c53]Olivier Danvy:
A Rational Deconstruction of Landin's SECD Machine. IFL 2004: 52-71 - [c52]Olivier Danvy:
From Reduction-based to Reduction-free Normalization. WRS 2004: 79-100 - 2003
- [j36]Daniel Damian, Olivier Danvy:
Syntactic accidents in program analysis: on the impact of the CPS transformation. J. Funct. Program. 13(5): 867-904 (2003) - [j35]Daniel Damian, Olivier Danvy:
CPS transformation of flow information, Part II: administrative reductions. J. Funct. Program. 13(5): 925-933 (2003) - [j34]Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi:
Editorial: Special Issue Dedicated to Bob Paige. High. Order Symb. Comput. 16(1-2): 5-6 (2003) - [j33]Olivier Danvy, Lasse R. Nielsen:
A first-order one-pass CPS transformation. Theor. Comput. Sci. 308(1-3): 239-257 (2003) - [c51]Olivier Danvy:
A New One-Pass Transformation into Monadic Normal Form. CC 2003: 77-89 - [c50]Olivier Danvy, Pablo E. Martínez López:
Tagging, Encoding, and Jones Optimality. ESOP 2003: 335-347 - [c49]Olivier Danvy:
A Journey from Interpreters to Compilers and Virtual Machines. GPCE 2003: 117 - [c48]Dariusz Biernacki, Olivier Danvy:
From Interpreter to Logic Engine by Defunctionalization. LOPSTR 2003: 143-159 - [c47]Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde:
Fast partial evaluation of pattern matching in strings. PEPM 2003: 3-9 - [c46]Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard:
A functional correspondence between evaluators and abstract machines. PPDP 2003: 8-19 - 2002
- [j32]Daniel Damian, Olivier Danvy:
A Simple CPS Transformation of Control-Flow Information. Log. J. IGPL 10(5): 501-515 (2002) - [j31]Olivier Danvy, Takayasu Ito, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 15(1): 5 (2002) - [j30]Olivier Danvy, Amr Sabry:
Editorial. High. Order Symb. Comput. 15(2-3): 139-140 (2002) - [j29]Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 15(4): 271 (2002) - [c45]Mads Sig Ager, Olivier Danvy, Mayer Goldberg:
A Symmetric Approach to Compilation and Decompilation. The Essence of Computation 2002: 296-331 - [c44]Torben Amtoft, Charles Consel, Olivier Danvy, Karoline Malmkjær:
The Abstraction and Instantiation of String-Matching Programs. The Essence of Computation 2002: 332-357 - [c43]Olivier Danvy, Ulrik Pagh Schultz:
Lambda-Lifting in Quadratic Time. FLOPS 2002: 134-151 - [c42]Olivier Danvy, Lasse R. Nielsen:
A First-Order One-Pass CPS Transformation. FoSSaCS 2002: 98-113 - [c41]Vincent Balat, Olivier Danvy:
Memoization in Type-Directed Partial Evaluation. GPCE 2002: 78-92 - [c40]Olivier Danvy, Mayer Goldberg:
There and back again. ICFP 2002: 230-234 - [c39]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
- [j28]Olivier Danvy, Morten Rhiger, Kristoffer Høgsbro Rose:
Normalization by evaluation with typed abstract syntax. J. Funct. Program. 11(6): 673-680 (2001) - [j27]Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 14(1): 5 (2001) - [j26]Olivier Danvy, Julia L. Lawall:
Editorial. High. Order Symb. Comput. 14(2-3): 99-100 (2001) - [j25]Olivier Danvy, Takayasu Ito, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 14(4): 307 (2001) - [j24]Olivier Danvy, Bernd Grobauer, Morten Rhiger:
A Unifying Approach to Goal-directed Evaluation. New Gener. Comput. 20(1): 53-74 (2001) - [c38]Olivier Danvy, Lasse R. Nielsen:
A Higher-Order Colon Translation. FLOPS 2001: 78-91 - [c37]Olivier Danvy, Morten Rhiger:
A Simple Take on Typed Abstract Syntax in Haskell-like Languages. FLOPS 2001: 343-358 - [c36]Olivier Danvy, Lasse R. Nielsen:
Defunctionalization at Work. PPDP 2001: 162-174 - [c35]Daniel Damian, Olivier Danvy:
Static Transition Compression. SAIG 2001: 92-107 - [c34]Olivier Danvy, Bernd Grobauer, Morten Rhiger:
A Unifying Approach to Goal-Directed Evaluation. SAIG 2001: 108-125 - [c33]Olivier Danvy:
Many Happy Returns. TLCA 2001: 1 - [c32]Olivier Danvy, Lasse R. Nielsen:
Syntactic Theories in Practice. RULE@PLI 2001: 358-374 - [e4]Olivier Danvy, Andrzej Filinski:
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 [contents] - 2000
- [j23]Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 13(1/2): 5-6 (2000) - [j22]Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 13(3): 159-160 (2000) - [j21]Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 13(4): 287-288 (2000) - [j20]Olivier Danvy, Ulrik Pagh Schultz:
Lambda-dropping: transforming recursive equations into programs with block structure. Theor. Comput. Sci. 248(1-2): 243-287 (2000) - [c31]Olivier Danvy:
Formalizing Implementation Strategies for First-Class Continuations. ESOP 2000: 88-103 - [c30]Daniel Damian, Olivier Danvy:
Syntactic accidents in program analysis: on the impact of the CPS transformation. ICFP 2000: 209-220
1990 – 1999
- 1999