Invited papers:

• AnnoDomini: From Type Theory to Year 2000 Conversion Tool. POPL 99.
• AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem. TLCA 99.

Journal papers:

• A Positive Supercompiler. JFP 96.
• Strong Normalization From Weak Normalization in Typed Lambda-Calculi. IC 97.
• Constraints to Stop Deforestation. SCP 98.
• Perpetual Reductions in Lambda-Calculus. IC 99. To appear.
• Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. JLP ??. To appear.
• CPS-Translations and Applications: The Cube and Beyond. HOSC ??. To appear.

Refereed conference and workshop papers:

• A New Means of Ensuring Termination of Deforestation ... GCW-ILPS 93.
• A Grammar-based Data-flow Analysis to Stop Deforestation. CAAP 94.
• Towards Unifying Deforestation, Partial Evaluation, Supercompilation, and GPC. ESOP 94.
• Partial Deduction and Driving are equivalent. PLILP 94.
• The lambda-Delta calculus. TACS 94.
• Call-by-name CPS Translation as a Binding-Time Improvement. SAS 95.
• An Algorithm of Generalization in Positive Supercompilation. ILPS 95.
• A Roadmap to Metacomputation by Supercompilation. Dagstuhl Seminar 96.
• Controlling Conjunctive Partial Deduction of Definite Logic Programs. PLILP 96.
• Redundant Argument Filtering of Logic Programs. LOPSTR 96.
• Effective Longest and Infinite Reduction Paths in Untyped lambda-Calculi. CAAP 96.
• Constraints to Stop Higher-Order Deforestation. POPL 97.
• CPS-Translations and Applications: the Cube and Beyond. CW 97.
• A Notion of Classical Pure Type Systems. MFPS 97.
• Reflections on reflections. PLILP 97.
• Domain-free Pure Type Systems. LFCS 97.
• Properties of Infinite Reduction Paths in Untyped lambda-Calculus. TSLLC 98.
• Convergence of Program Transformers in the Metric Space of Trees. MPC 98.
• On Perfect Supercompilation. PSI 99. To appear.

Book chapters:

• Hilbert's Tenth Problem. Textbook chapter 97.
• Introduction to Supercompilation. Chapter in Summer school proceedings ??. To appear.

Theses and lecture notes:

• Turchin's Supercompiler Revisited. Master's Thesis 94.
• Normalization in Lambda-Calculus and Type Theory. PhD Thesis 97.
• Lectures on the Curry Howard Isomophism. Lecture Notes 98.
  

Technical reports:

• The lambda-Delta calculus. Report 93.
• A New Means of Ensuring Termination of Deforestation. Report 93.
• Controlling Conjunctive Partial Deduction of Definite Logic Programs. Report 96.

Unrefereed workshop papers:

• Embeddings and Infinite Reduction Paths in Untyped Lambda-Calculus. WOT 95.

Newspaper and magazine articles:

• We have world-class IT-research (in Danish). In ComputerWorld 20, May 29, 1998 (with changes). CW 98.
• AnnoDomini: From Type Theory to Year 2000 Conversion Tool. In ERCIM News 36. ERCIM 98.