Zobrazeno 1 - 10
of 331
pro vyhledávání: '"DANVY, OLIVIER"'
Autor:
Danvy, Olivier
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 function that enumerates the successive terms in a reduction sequence -- t
Externí odkaz:
http://arxiv.org/abs/2302.10455
Autor:
Danvy, Olivier
Publikováno v:
Fundamenta Informaticae, Volume 185, Issue 2 (May 6, 2022) fi:9159
"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 TABA examples, refines existing ones, and formalizes both their contro
Externí odkaz:
http://arxiv.org/abs/2203.00145
Autor:
Danvy, Olivier, de'Liguoro, Ugo
Publikováno v:
EPTCS 212, 2016
The notion of continuation is ubiquitous in many different areas of computer science, including systems programming, programming languages, algorithmics, semantics, logic, and constructive mathematics. In fact the concept of continuation nicely reali
Externí odkaz:
http://arxiv.org/abs/1606.05839
Autor:
DANVY, OLIVIER1 danvy@acm.org
Publikováno v:
ACM Transactions on Programming Languages & Systems. Mar2023, Vol. 45 Issue 1, p1-35. 35p.
Publikováno v:
EPTCS 129, 2013
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 occasion of his sixtieth birthday.
Externí odkaz:
http://arxiv.org/abs/1309.4557
Autor:
Danvy, Olivier, Shan, Chung-chieh
Publikováno v:
EPTCS 66, 2011
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 articles selected by the program committee from 14 submissions, and 6 lect
Externí odkaz:
http://arxiv.org/abs/1109.0323
Autor:
Danvy, Olivier, Millikin, Kevin
Publikováno v:
Logical Methods in Computer Science, Volume 4, Issue 4 (November 29, 2008) lmcs:1112
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 languages, and was specified by an extension of the SECD machine. We presen
Externí odkaz:
http://arxiv.org/abs/0811.3231
Publikováno v:
Logical Methods in Computer Science, Volume 1, Issue 2 (November 8, 2005) lmcs:2269
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. The abstract machine is derived from an evaluator in continuation-passi
Externí odkaz:
http://arxiv.org/abs/cs/0508048
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 21 August 2014 546:244-256