Aarhus University logo
Find
For students
For PhDs
For employees
Local study portal
Computer Science
IT Product Development
Local PhD portal
Application Guide
Computer Science
Pages for all PhD students
phd.au.dk
Local staff information
Department of Computer Science
Pages for staff members at AU
medarbejdere.au.dk/en/
Department of
Computer Science
About Us
Strategy
Anniversary
Organisation
Honorary doctor and professors
Vacancies
Code of Conduct
Research
Algorithms, Data Structures and Foundations of Machine Learning
Collaboration and Computer-Human Interaction
Computational Complexity and Game Theory
Data-Intensive Systems
Cryptography and Security
Logic and Semantics
Programming Languages
Ubiquitous Computing and Interaction
Bioinformatics
Use, Design and Innovation
Modelling and Validation of Distributed Systems
Centers
Publications
PhD Studies
Education
Studievalg
Bachelor
Master
PhD
Continuing education
Study environment
ALICE
Mød vores kandidater
Graduation at Department of Computer Science
ChomskyLab
Business Collaboration
Research Collaboration
Student Collaboration
CS Business Club
Business Committee
Continuing Education
CS Alumni
News & Events
News
Events
CS Colloquium
Camps and Competitions
Contact
Management and Heads of Research
Researchers
All employees
For the press
Gymnasiesamarbejde
Department of Computer Science
Research
Programming Languages
Publications
Research
Algorithms, Data Structures and Foundations of Machine Learning
Collaboration and Computer-Human Interaction
Computational Complexity and Game Theory
Data-Intensive Systems
Cryptography and Security
Logic and Semantics
Programming Languages
Projects
People
Publications
Ubiquitous Computing and Interaction
Bioinformatics
Use, Design and Innovation
Modelling and Validation of Distributed Systems
Centers
Publications
PhD Studies
Publications
Sort by
: Date
Sort by
Author
Date
Title
Type
Type and 1st author
Year
Year and 1st author
Year, type and 1st author
Sort in
Ascending order
Descending order
Danvy, O.
, de Moor, O., Padget, J. & Thiemann, P. (2006).
Editorial
.
Higher-Order and Symbolic Computation
,
19
(1), 5-5.
Ager, M. S.
, Danvy, O.
& Rohde, H. K.
(2006).
Fast Partial Evaluation of Pattern Matching in Strings
.
A C M Transactions on Programming Languages and Systems
,
28
(4), 696-714.
https://doi.org/10.1145/1146809.1146812
Danvy, O.
(2006).
Interview in popular science program at the Estonian National Radio
.
Danvy, O.
& Rohde, H. K.
(2006).
On Obtaining the Boyer-Moore String-Matching Algorithm by Partial Evaluation
.
Information Processing Letters
,
99
(4), 158-162.
Biernacki, D. P.
, Danvy, O.
& Shan, C. (2006).
On the Static and Dynamic Extents of Delimited Continuations
.
Science of Computer Programming
,
60
(3), 274-297.
Danvy, O. (Ed.)
, O’Hearn, P. & Wadler, P. (2006).
Preface, Festschrift for John C. Reynolds's 70th birthday
. In
Theoretical Computer Science, Volume 375, Issues 1–3,
(pp. 1-2). Elsevier.
Møller, A.
(2006).
Static Analysis for Event-Based XML Processing
.
B R I C S Report Series
, (RS-06-16).
Kirkegaard, C.
& Møller, A.
(2006).
Static Analysis for Java Servlets and JSP
. In K. Yi (Ed.),
Static Analysis: 13th International Symposium, SAS 2006, Seoul, Korea, August 29-31, 2006. Proceedings
(pp. 336-352). Springer.
https://doi.org/10.1007/11823230_22
Kirkegaard, C.
& Møller, A.
(2006).
Type Checking with XML Schema in XACT
. Paper presented at PLAN-X 2006: ACM SIGPLAN Workshop on Programming Language Technologies for XML, Charleston, SC, United States.
Biernacki, D.
, Danvy, O.
& Millikin, K. S.
(2005).
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
.
B R I C S Report Series
, (RS-05-16), 1-26.
Ager, M. S.
, Danvy, O.
& Midtgaard, J.
(2005).
A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects
.
Theoretical Computer Science
,
342
(1), 149-172.
Biernacka, M.
, Biernacki, D.
& Danvy, O.
(2005).
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
.
Logical Methods in Computer Science
,
1
(2).
https://doi.org/10.2168/LMCS-1(2:5)2005
Biernacki, D.
& Danvy, O.
(2005).
A Simple Proof of a Folklore Theorem about Delimited Control
.
B R I C S Report Series
, (RS-05-25).
Biernacka, M.
& Danvy, O.
(2005).
A Syntactic Correspondence between Context-Sensitive Calculi and Abstract Machines
.
B R I C S Report Series
, (RS-05-38).
Danvy, O.
& Nielsen, L. (2005).
CPS Transformation of Beta-Redexes
.
Information Processing Letters
,
94
(5), 217-224.
https://doi.org/10.1016/j.ipl.2005.02.002
Brabrand, C.
, Møller, A.
& Schwartzbach, M. I.
(2005).
Dual Syntax for XML Languages
. In
Database Programming Languages: 10th International Workshop, DBPL 2005, Trondheim, Norway, August 28-29, 2005, Revised Selected Papers
(pp. 27-41). Springer.
https://doi.org/10.1007/11601524_2
Danvy, O.
, Henglein, F., Mairson, H. & Pettorossi, A. (Eds.) (2005).
Editorial
.
Higher-Order and Symbolic Computation
,
18
(1-2), 5-6.
Biernacka, M.
, Danvy, O.
& Sørensen, K. S.
(2005).
Extracting Evaluators from Proofs of Weak Head Normalization
. In
Electronic Notes in Theoretical Computer Science
Elsevier Science Publishers.
Danvy, O.
(2005).
From Reduction-based to Reduction-free Normalization
.
Electronic Notes in Theoretical Computer Science
,
124
(2), 79-100.
Biernacki, D.
, Danvy, O.
& Shan, K. (2005).
On the Dynamic Extent of Delimited Continuations
.
Information Processing Letters
,
96
(1), 7-17.
https://doi.org/10.1016/j.ipl.2005.04.003
Biernacki, D.
& Danvy, O.
(2005).
On the Static and Dynamic Extent of Delimited Continuations
.
B R I C S Report Series
, (RS-05-36).
Biernacka, M.
, Danvy, O.
& Støvring, K.
(2005).
Program Extraction from Proofs of Weak Head Normalization
.
B R I C S Report Series
, (RS-05-12).
Møller, A.
& Schwartzbach, M. I.
(2005).
The Design Space of Type Checkers for XML Transformation Languages
. In
Database Theory - ICDT 2005: 10th International Conference, Edinburgh, UK, January 5-7, 2005. Proceedings
(pp. 17-36). Springer.
https://doi.org/10.1007/978-3-540-30570-5_2
Danvy, O.
& Goldberg, M. (2005).
There and Back Again
.
Fundamenta Informaticae
,
66
(4), 397-413.
Ager, M. S.
, Danvy, O.
& Midtgaard, J.
(2004).
A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines
.
Information Processing Letters
,
90
(5), 223-232.
https://doi.org/10.1016/j.ipl.2004.02.012
Ager, M. S.
, Danvy, O.
& Midtgaard, J.
(2004).
A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines
.
B R I C S Report Series
, (RS-04-3).
Ager, M. S.
, Danvy, O.
& Midtgaard, J.
(2004).
A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects
.
B R I C S Report Series
, (RS-04-28).
Biernacka, M.
, Biernacki, D.
& Danvy, O.
(2004).
An Operational Foundation for Delimited Continuations
. In
Proceedings of the Fourth ACM SIGPLAN Workshop on Continuations
(pp. 25-33). Association for Computing Machinery.
Biernacka, M.
, Biernacki, D.
& Danvy, O.
(2004).
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
.
B R I C S Report Series
, (RS-04-29).
Christensen, A. S.
, Kirkegaard, C.
& Møller, A.
(2004).
A Runtime System for XML Transformations in Java
. In Z. Bellahsene, T. Milo, M. Rys, D. Suciu & R. Unland (Eds.),
Database and XML Technologies: Second International XML Database Symposium, XSym 2004, Toronto, Canada, August 29-30, 2004. Proceedings
(pp. 143-157). Springer.
https://doi.org/10.1007/978-3-540-30081-6_11
Danvy, O.
& Nielsen, L. R. (2004).
CPS Transformation of Beta-Redexes
.
B R I C S Report Series
, (RS-04-39).
Basin, D. A.
, Danvy, O.
& Harper, R. (2004).
Editorial
.
Higher-Order and Symbolic Computation
,
17
(3), 171-171.
https://doi.org/10.1023/B:LISP.0000029480.20108.7d
Chin, W.
, Danvy, O.
& Thiemann, P. (2004).
Editorial: Theme Issue on Partial Evaluation and Semantics-Based Program Manipulation
.
Higher-Order and Symbolic Computation
,
17
(1-2), 5-6.
https://doi.org/10.1023/B:LISP.0000029481.73168.ef
Ager, M. S.
, Danvy, O.
& Rohde, H. K.
(2004).
Fast Partial Evaluation of Pattern Matching in Strings
.
B R I C S Report Series
, (RS-04-40).
Biernacki, D.
& Danvy, O.
(2004).
From Interpreter to logic Engine by Defunctionalization
. In M. Bruynooghe (Ed.),
Logic Based Program Synthesis and Transformation: 13th International Symposium, LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers
(pp. 143-159). Springer.
https://doi.org/10.1007/978-3-540-25938-1_13
Biernacki, D.
& Danvy, O.
(2004).
From Interpreter to Logic Engine by Defunctionalization
.
B R I C S Report Series
, (RS-04-5).
Danvy, O.
(2004).
From Reduction-Based to Reduction-Free Normalization
.
B R I C S Report Series
, (RS-04-30).
Danvy, O.
& Schultz, U. P.
(2004).
Lambda-lifting in Quadratic Time
.
Journal of Functional and Logic Programming (JFLP)
,
2004
(1).
Danvy, O.
& Schultz, U. P.
(2004).
Lambda-Lifting in Quadratic Time
.
B R I C S Report Series
, (RS-04-12).
Danvy, O.
(2004).
On Evaluation Contexts, Continuations, and the Rest of the Computation
. In
Ikke angivet
(CSR-04-1 of Technical Reports ed., pp. 13-23). School of Computer Science, University of Birmingham.
Danvy, O.
& Nielsen, L. R. (2004).
Refocusing in Reduction Semantics
.
B R I C S Report Series
, (RS-04-26).
Kirkegaard, C.
, Møller, A.
& Schwartzbach, M. I.
(2004).
Static Analysis of XML Transformations in Java
.
I E E E Transactions on Software Engineering
,
30
(3), 181-192.
https://doi.org/10.1109/TSE.2004.1271173
Danvy, O.
(2004).
Sur un Exemple de Patrick Greussay
.
B R I C S Report Series
, (RS-04-41).
Danvy, O.
& Nielsen, L. R. (2003).
A First-Order One-Pass CPS Transformation
.
Theoretical Computer Science
,
308
(1), 239-257.
Ager, M. S.
, Danvy, O.
& Midtgaard, J.
(2003).
A Functional Correspondence between Call-by-Need Evaluators and Lazy Abstract Machines
.
B R I C S Report Series
, (RS-03-24).
Ager, M. S.
, Biernacki, D.
, Danvy, O.
& Midtgaard, J.
(2003).
A Functional Correspondence Between Evaluators and Abstract Machines
. In K. Sagonas & D. Miller (Eds.),
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
(pp. 8-19). Association for Computing Machinery.
https://doi.org/10.1145/888251.888254
Ager, M. S.
, Danvy, O.
& Midtgaard, J.
(2003).
A Functional Correspondence between Monadic Evaluators and Abstract Machines for Languages with Computational Effects
.
B R I C S Report Series
, (RS-03-35).
Danvy, O.
(2003).
A Journey from Interpreters to Compilers and Virtual Machines
. In F. Pfenning & Y. Smaragdakis (Eds.),
Generative Programming and Component Engineering: Second International Conference, GPCE 2003, Erfurt, Germany, September 22-25, 2003. Proceedings
(pp. 117). Springer.
https://doi.org/10.1007/978-3-540-39815-8_7
Danvy, O.
(2003).
A New One-Pass Transformation into Monadic Normal Form
. In G. Hedin (Ed.),
Compiler Construction: 12th International Conference, CC 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings
(pp. 77-89). Springer.
https://doi.org/10.1007/3-540-36579-6_6
Biernacka, M.
, Biernacki, D.
& Danvy, O.
(2003).
An Operational Foundation for Delimited Continuations
.
B R I C S Report Series
, (RS-03-41).
Displaying results
251 to 300
out of
439
Previous
1
2
3
4
5
6
7
8
9
Next
Faculty
Magnus
Madsen
Assistant Professor
M
magnusm@cs.au.dk
Andreas
Pavlogiannis
Associate Professor
M
pavlogiannis@cs.au.dk
Revised 17.04.2023
-
Sofia Hedegaard Rasmussen