31 citations · 43 across the 7 of their papers we have counts for
7 papers
A Deforestation of Reducts: Refocusing
Olivier Danvy
In a small-step semantics with a deterministic reduction strategy, refocusing is a transformation that connects a reduction-based normalization function (i.e., a normalization func…
Getting There and Back Again
Olivier Danvy
"There and Back Again" (TABA) is a programming pattern where the recursive calls traverse one data structure and the subsequent returns traverse another. This article presents new…
Proceedings of the Workshop on Continuations
Olivier Danvy, Ugo de'Liguoro
The notion of continuation is ubiquitous in many different areas of computer science, including systems programming, programming languages, algorithmics, semantics, logic, and cons…
Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday
Anindya Banerjee, Olivier Danvy, Kyung-Goo Doh +1
This Liber Amicorum is a collection of essays ranging from personal memories to technical contributions. It is a tribute to Dave Schmidt and his career, and was composed at the occ…
Proceedings IFIP Working Conference on Domain-Specific Languages
Olivier Danvy, Chung-chieh Shan
This volume is the proceedings of the second IFIP Working Conference on Domain-Specific Languages (DSL 2011). It contains 2 abstracts of invited presentations, 7 peer-reviewed arti…
A Rational Deconstruction of Landin's SECD Machine with the J Operator
Olivier Danvy, Kevin Millikin
Landin's SECD machine was the first abstract machine for applicative expressions, i.e., functional programs. Landin's J operator was the first control operator for functional langu…
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. T…