Search Results - "Danvy, Olivier"

The Tortoise and the Hare Algorithm for Finite Lists, Compositionally.

Authors: DANVY, OLIVIER¹, danvy@acm.org

Source: ACM Transactions on Programming Languages & Systems; Mar2023, Vol. 45 Issue 1, p1-35, 35p

Folding left and right matters: Direct style, accumulators, and continuations.

Authors: DANVY, OLIVIER¹ (AUTHOR) danvy@acm.org

Source: Journal of Functional Programming. 2023, Vol. 33, p1-40. 40p.

Getting There and Back Again.

Authors: Danvy, Olivier¹, danvy@acm.org

Source: Fundamenta Informaticae; 2022, Vol. 185 Issue 2, p115-183, 69p

Fold–unfold lemmas for reasoning about recursive programs using the Coq proof assistant.

Authors: DANVY, OLIVIER¹ (AUTHOR) danvy@acm.org

Source: Journal of Functional Programming. 2022, Vol. 32, p1-27. 27p.

Folding left and right over Peano numbers.

Authors: DANVY, OLIVIER¹ danvy@acm.org

Source: Journal of Functional Programming. 2019, Vol. 29, p1-12. 12p.

Fast Partial Evaluation of Pattern Matching in Strings.

Authors: Ager, Mads Sig Danvy, Olivier Rohde, Henning Korsholm

Source: ACM Transactions on Programming Languages & Systems; July 2006, Vol. 28 Issue 4, p696-714, 19p

Eta-expansion does The Trick.

Authors: Danvy, Olivier Malmkjær, Karoline Palsberg, Jens

Source: ACM Transactions on Programming Languages & Systems; November 1996, Vol. 18, p730-751, 22p

Resource-bounded partial evaluation.

Authors: Danvy, Olivier Hentze, Nevin Malmkjær, Karoline

Source: ACM Computing Surveys; June 1996, Vol. 28, p329-332, 4p

1998 Symposium on Partial Evaluation.

Authors: Danvy, Olivier Glück, Robert Thiemann, Peter

Source: ACM Computing Surveys; September 1998, Vol. 30 Issue 3, p285-290, 6p

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations.

Authors: BIERNACKI, DARIUSZ DANVY, OLIVIER MILLIKIN, KEVIN

Source: ACM Transactions on Programming Languages & Systems; Oct2015, Vol. 38 Issue 1, p2:1-2:25, 25p

Abstracting Abstract Machines.

Authors: Danvy, Olivier Midtgaard, Jan

Source: Communications of the ACM; September 2011, Vol. 54 Issue 9, p100-100, 1p

Three Syntactic Theories for Combinatory Graph Reduction.

Authors: DANVY, OLIVIER ZERNY, IAN

Source: ACM Transactions on Computational Logic; Nov2013, Vol. 14 Issue 4, p1-27, 27p

There and Back Again.

Authors: Danvy, Olivier Goldberg, Mayer

Source: Fundamenta Informaticae; 2005, Vol. 66 Issue 4, p397-413, 17p, 2 Diagrams

A Simple CPS Transformation of Control-Flow Information.

Authors: Damian, Daniel Danvy, Olivier

Source: Logic Journal of the IGPL; 2002, Vol. 10 Issue 5, p501-515, 15p

Normalization by evaluation with typed abstract syntax.

Authors: DANVY, OLIVIER RHIGER, MORTEN ROSE, KRISTOFFER H.

Source: Journal of Functional Programming. Nov2001, Vol. 11 Issue 6, p673-680. 8p.

Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant – ERRATUM.

Authors: DANVY, OLIVIER (AUTHOR)

Source: Journal of Functional Programming. 2023, Vol. 33, p1-1. 1p.

A computational formalization for partial evaluation.

Authors: HATCLIFF, JOHN DANVY, OLIVIER

Source: Mathematical Structures in Computer Science. 10/01/1997, Vol. 7 Issue 5, p507-541. 35p.

Thunks and the »-calculus.

Authors: HATCLIFF, JOHN DANVY, OLIVIER

Source: Journal of Functional Programming. 05/01/1997, Vol. 7 Issue 3, p303-319. 17p.

Refunctionalization at work

Authors: Danvy, Olivier Millikin, Kevin

Source: Science of Computer Programming. Jun2009, Vol. 74 Issue 8, p534-549. 16p.

Subjects: Machine theory, Algorithms, Mathematical logic, Mathematical models

On the static and dynamic extents of delimited continuations

Authors: Biernacki, Dariusz Danvy, Olivier Shan, Chung-chieh

Source: Science of Computer Programming. May2006, Vol. 60 Issue 3, p274-297. 24p.

Subjects: Statics, Dynamics, Search algorithms, Computer systems