Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Danvy, Olivier"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of Moessner's sieve
Christian Clausen
,
Olivier Danvy
,
Moe Masuko
Theoretical Computer Science
546
, 2014, pp. 244-256
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation
Olivier Danvy
,
Kevin Millikin
,
Johan Munk
,
Ian Zerny
Theoretical Computer Science
435
, 2012, pp. 21-42
Inter-deriving semantic artifacts for object-oriented programming
Olivier Danvy
,
Jacob Johannsen
Journal of Computer and System Sciences
76
(5), 2010, pp. 302-323
On the equivalence between small-step and big-step abstract machines: A simple application of lightweight fusion
Olivier Danvy
,
Kevin Millikin
Information Processing Letters
106
(3), 2008, pp. 100-109
A syntactic correspondence between context-sensitive calculi and abstract machines
MaĆgorzata Biernacka
,
Olivier Danvy
Theoretical Computer Science
375
(1-3), 2007, pp. 76-108
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
Olivier Danvy
,
Henning Korsholm Rohde
Information Processing Letters
99
(4), 2006, pp. 158-162
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
Mads Sig Ager
,
Olivier Danvy
,
Jan Midtgaard
Theoretical Computer Science
342
(1), 2005, pp. 149-172
On the dynamic extent of delimited continuations
Dariusz Biernacki
,
Olivier Danvy
,
Chung-chieh Shan
Information Processing Letters
96
(1), 2005, pp. 7-17
CPS transformation of beta-redexes
Olivier Danvy
,
Lasse R. Nielsen
Information Processing Letters
94
(5), 2005, pp. 217-224
A functional correspondence between call-by-need evaluators and lazy abstract machines
Mads Sig Ager
,
Olivier Danvy
,
Jan Midtgaard
Information Processing Letters
90
(5), 2004, pp. 223-232
A first-order one-pass CPS transformation
Olivier Danvy
,
Lasse R. Nielsen
Theoretical Computer Science
308
(1-3), 2003, pp. 239-257
Lambda-dropping: Transforming recursive equations into programs with block structure
Olivier Danvy
,
Ulrik P. Schultz
Theoretical Computer Science
248
(1-2), 2000, pp. 243-287
A simple solution to type specialization
Olivier Danvy
Lecture Notes in Computer Science
1443
, 1998, pp. 908-917
Semantics-directed compilation of nonlinear patterns
Olivier Danvy
Information Processing Letters
37
, 1991, pp. 315-322
Partial evaluation of pattern matching in strings
Charles Consel
,
Olivier Danvy
Information Processing Letters
30
, 1989, pp. 79-86