Olivier Danvy's DSc material, April 2006
Dissertation:
[0] Olivier Danvy:
An
Analytical Approach to Programs as Data Objects.
(version
without hyper-references)
Journals:
[1]
Malgorzata Biernacka
and
Olivier Danvy:
A concrete framework for environment machines.
ACM Transactions on Computational Logic, 2006. To appear.
Available as the technical report
BRICS RS-06-3
(February 2006).
[2]
Dariusz Biernacki,
Olivier Danvy,
and
Chung-chieh Shan:
On the static and dynamic extents of delimited continuations.
Science of Computer Programming, 2006. To appear.
Available as the technical report
BRICS RS-05-36
(December 2005).
[3]
Malgorzata Biernacka,
Dariusz Biernacki,
and
Olivier Danvy:
An
operational foundation for delimited continuations in the CPS hierarchy.
Logical Methods in Computer Science, 1(2:5):1-39, November 2005.
[4]
Olivier Danvy
and
Henning Korsholm Rohde:
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation.
Information Processing Letters, 99(4):158-162, 2006.
Available as the technical report
BRICS RS-05-14
(April 2005).
[5]
Dariusz Biernacki
and
Olivier Danvy:
A simple proof of a folklore theorem about delimited control.
Journal of Functional Programming, 2006. To appear.
Available as the technical report
BRICS RS-05-10
(March 2005).
[6]
Mads Sig Ager,
Olivier Danvy,
and
Henning Korsholm Rohde:
Fast partial evaluation of pattern matching in strings.
ACM Transactions on Programming Languages and Systems, 28(4):696-714, 2006.
Available as the technical report
BRICS RS-04-40
(December 2004).
[7]
Mads Sig Ager,
Olivier Danvy,
and
Jan Midtgaard:
A
functional correspondence between monadic evaluators and abstract
machines for languages with computational effects.
Theoretical Computer Science, 342(1):149-172, 2005.
Extended version available as the technical report
BRICS RS-04-28
(December 2004).
[8]
Olivier Danvy
and
Mayer Goldberg:
There
and back again.
Fundamenta Informaticae, 66(4):397-413, 2005.
[9]
Olivier Danvy
and
Ulrik P. Schultz:
Lambda-lifting
in quadratic time.
Journal of Functional and Logic Programming, 10(1), July 2004.
Locally available as the technical report
BRICS RS-02-30 (June 2002).
[10]
Mads Sig Ager,
Olivier Danvy,
and
Jan Midtgaard:
A
functional correspondence between call-by-need evaluators
and lazy abstract machines.
Information Processing Letters, 90(5):223-232, 2004.
Extended version available as the technical report
BRICS RS-04-3
(February 2004).
[11]
Olivier Danvy
and
Lasse R. Nielsen:
A
first-order one-pass CPS transformation.
Theoretical Computer Science, 308(1-3):239-257, 2003.
[12]
Daniel Damian
and
Olivier Danvy:
Syntactic
accidents in program analysis:
On the impact of the CPS transformation.
Journal of Functional Programming, 13(5):867-904, 2003.
[13]
Daniel Damian
and
Olivier Danvy:
CPS
transformation of flow information, part II:
Administrative reductions.
Journal of Functional Programming, 13(5):925-934, 2003.
[14]
Olivier Danvy,
Bernd Grobauer,
and
Morten Rhiger:
A unifying approach to goal-directed evaluation.
New Generation Computing, 20(1):53-73, 2002.
Extended version available as the technical report
BRICS RS-01-29
(July 2001).
[15]
Olivier Danvy
and
Ulrik P. Schultz:
Lambda-dropping:
Transforming recursive equations into programs with block structure.
Theoretical Computer Science, 248(1-2):243-287, 2000.
[16]
Olivier Danvy:
Functional unparsing.
Journal of Functional Programming, 8(6):621-625, 1998.
[17]
Olivier Danvy:
Back to direct style.
Science of Computer Programming, 22(3):183-195, 1994.
Conferences:
[18]
Mads Sig Ager,
Dariusz Biernacki,
Olivier Danvy,
and
Jan Midtgaard:
A
functional correspondence between evaluators and abstract machines.
Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative
Programming (PPDP'03).
pages 8-19, Uppsala, Sweden, August 2003. ACM Press.
[19]
Dariusz Biernacki
and
Olivier Danvy:
From
interpreter to logic engine by defunctionalization.
Logic Based Program Synthesis and Transformation, 13th International
Symposium, LOPSTR 2003.
Number 3018 in Lecture Notes in Computer Science, pages 143-159.
Uppsala, Sweden, August 2003. Springer-Verlag.
[20]
Olivier Danvy:
A
new one-pass transformation into monadic normal form.
Compiler Construction, 12th International Conference, CC 2003
Number 2622 in Lecture Notes in Computer Science, pages 77-89.
Warsaw, Poland, April 2003. Springer-Verlag.
[21]
Mads Sig Ager,
Olivier Danvy,
and
Henning Korsholm Rohde:
On
obtaining Knuth, Morris, and Pratt's string matcher
by partial evaluation.
2002 ACM SIGPLAN Asian Symposium on Partial Evaluation and
Semantics-Based Program Manipulation
Pages 32-46, Aizu, Japan, September 2002. ACM Press.
Extended version available as the technical report
BRICS RS-02-32
(July 2002).
[22]
Olivier Danvy
and
Lasse R. Nielsen
Defunctionalization
at work.
Third International ACM SIGPLAN Conference on Principles and Practice of
Declarative Programming (PPDP'01).
Pages 162-174, Firenze, Italy, September 2001. ACM Press.
Extended version available as the technical report
BRICS RS-01-23
(July 2001).
[23]
Olivier Danvy:
Formalizing
implementation strategies for first-class continuations.
Ninth European Symposium on Programming, ESOP 2000.
Number 1782 in Lecture Notes in Computer Science, pages 88-103.
Berlin, Germany, March 2000. Springer-Verlag.
[24]
Olivier Danvy:
An extensional characterization of lambda-lifting and lambda-dropping.
Functional and Logic Programming, 4th International Symposium, FLOPS 1999.
Number 1722 in Lecture Notes in Computer Science, pages 241-250.
Tsukuba, Japan, November 1999. Springer-Verlag.
Extended version available as the technical report
BRICS RS-99-21
(July 2001).
[25]
Olivier Danvy
Type-directed
partial evaluation.
Twenty-Third Annual ACM Symposium on Principles of Programming Languages
Pages 242-257, St. Petersburg Beach, Florida, January 1996. ACM Press.
Refereed workshops:
[26]
Olivier Danvy
and
Kevin Millikin:
A rational deconstruction of Landin's J operator.
Implementation and Application of Functional Languages,
17th International Workshop, IFL'05.
Number ? in Lecture Notes in Computer Science, pages ?-?.
Dublin, Ireland, September 2005. Springer-Verlag.
Extended version available as the technical report
BRICS RS-06-4
(February 2006).
[27]
Olivier Danvy:
A
rational deconstruction of Landin's SECD machine.
Implementation and Application of Functional Languages,
16th International Workshop, IFL'04.
Number 3474 in Lecture Notes in Computer Science, pages 52-71.
Lübeck, Germany, September 2004. Springer-Verlag.
Extended version available as the technical report
BRICS RS-03-33
(October 2003).
Book chapters:
[28]
Olivier Danvy:
Type-directed
partial evaluation.
Partial Evaluation -- Practice and Theory;
Proceedings of the 1998 DIKU Summer School.
Number 1706 in Lecture Notes in Computer Science, pages 367-411.
Copenhagen, Denmark, July 1998. Springer-Verlag.
Invited:
[29]
Olivier Danvy:
On
evaluation contexts, continuations, and the rest of the computation.
Fourth ACM SIGPLAN Workshop on Continuations (CW'04)
Technical report CSR-04-1, Department of Computer Science, Queen Mary's College, pages 13-23.
Venice, Italy, January 2004.
Work in progress:
[30]
Malgorzata Biernacka
and
Olivier Danvy:
A
syntactic correspondence
between context-sensitive calculi and abstract machines.
Technical report BRICS RS-05-38 (December 2005).
Accepted for publication in Theoretical Computer Science, March 2006.
[31]
Dariusz Biernacki, Olivier Danvy, and Kevin Millikin:
A
dynamic continuation-passing style for dynamic delimited continuations.
Technical report BRICS RS-05-16 (May 2005).
[32]
Olivier Danvy
and
Lasse R. Nielsen:
Refocusing
in reduction semantics.
Technical report BRICS RS-04-26 (November 2004).