| 2009 |
| 32 | EE | Torben Æ. Mogensen:
Troll, a language for specifying dice-rolls.
SAC 2009: 1910-1915 |
| 2008 |
| 31 | EE | Torben Æ. Mogensen:
Semi-inversion of functional parameters.
PEPM 2008: 21-29 |
| 2006 |
| 30 | EE | Torben Æ. Mogensen:
Report on an Implementation of a Semi-inverter.
Ershov Memorial Conference 2006: 322-334 |
| 2005 |
| 29 | EE | Torben Æ. Mogensen:
Semi-inversion of Guarded Equations.
GPCE 2005: 189-204 |
| 2003 |
| 28 | EE | Torben Æ. Mogensen:
Linear Types for Cashflow Reengineering.
Ershov Memorial Conference 2003: 13-21 |
| 27 | EE | Torben Æ. Mogensen:
Roll : A Language for Specifying Die-Rolls.
PADL 2003: 145-159 |
| 2002 |
| 26 | | Torben Æ. Mogensen,
David A. Schmidt,
Ivan Hal Sudborough:
The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]
Springer 2002 |
| 2001 |
| 25 | EE | Torben Æ. Mogensen:
An Investigation of Compact and Efficient Number Representations in the Pure Lambda Calculus.
Ershov Memorial Conference 2001: 205-213 |
| 2000 |
| 24 | | Torben Æ. Mogensen:
Linear-Time Self-Interpretation of the Pure Lambda Calculus.
Higher-Order and Symbolic Computation 13(3): 217-237 (2000) |
| 23 | | Torben Æ. Mogensen:
Glossary for Partial Evaluation and Related Topics.
Higher-Order and Symbolic Computation 13(4): 355-368 (2000) |
| 1999 |
| 22 | | John Hatcliff,
Torben Æ. Mogensen,
Peter Thiemann:
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, Copenhagen, Denmark, June 29 - July 10, 1998
Springer 1999 |
| 21 | EE | Torben Æ. Mogensen:
Linear Time Self-Interpretation of the Pure Lambda Calculus.
Ershov Memorial Conference 1999: 128-142 |
| 20 | | Torben Æ. Mogensen:
Gödelization in the Untyped lambda-Calculus.
PEPM 1999: 19-24 |
| 19 | | Jakob Rehof,
Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices.
Sci. Comput. Program. 35(2): 191-221 (1999) |
| 1998 |
| 18 | | Torben Æ. Mogensen:
Partial Evaluation: Concepts and Applications.
Partial Evaluation 1998: 1-19 |
| 17 | | Torben Æ. Mogensen:
Inherited Limits.
Partial Evaluation 1998: 189-202 |
| 16 | EE | Torben Æ. Mogensen:
Inherited Limits.
ACM Comput. Surv. 30(3es): 5 (1998) |
| 1997 |
| 15 | EE | Torben Æ. Mogensen:
Types for 0, 1 or Many Uses.
Implementation of Functional Languages 1997: 112-122 |
| 1996 |
| 14 | | Torben Æ. Mogensen:
Evolution of Partial Evaluators: Removing Inherited Limits.
Dagstuhl Seminar on Partial Evaluation 1996: 303-321 |
| 13 | | Torben Æ. Mogensen:
A Semantics-Based Determinacy Analysis for Prolog with Cut.
Ershov Memorial Conference 1996: 374-385 |
| 12 | | Jakob Rehof,
Torben Æ. Mogensen:
Tractable Constraints in Finite Semilattices.
SAS 1996: 285-300 |
| 1995 |
| 11 | | Torben Æ. Mogensen:
Self-applicable Online Partial Evaluation of Pure Lambda Calculus.
PEPM 1995: 39-44 |
| 1994 |
| 10 | | Torben Æ. Mogensen:
WORM-2DPDAs: An Extension to 2DPDAs that can be Simulated in Linear Time.
Inf. Process. Lett. 52(1): 15-22 (1994) |
| 1993 |
| 9 | | Torben Æ. Mogensen:
Constructor Spezialization.
PEPM 1993: 22-32 |
| 1992 |
| 8 | | Torben Æ. Mogensen,
Anders Bondorf:
Logimix: A Self-Applicable Partial Evaluator for Prolog.
LOPSTR 1992: 214-227 |
| 7 | | Torben Æ. Mogensen:
Self-applicable Partial Evaluation for Pure Lambda Calculus.
PEPM 1992: 116-121 |
| 6 | | Torben Æ. Mogensen:
Efficient Self-Interpretations in lambda Calculus.
J. Funct. Program. 2(3): 345-363 (1992) |
| 1990 |
| 5 | | Thomas P. Jensen,
Torben Æ. Mogensen:
A Backwards Analysis for Compile-time Garbage Collection.
ESOP 1990: 227-239 |
| 4 | | Neil D. Jones,
Carsten K. Gomard,
Anders Bondorf,
Olivier Danvy,
Torben Æ. Mogensen:
A Self-Applicable Partial Evaluator for the Lambda Calculus.
ICCL 1990: 49-58 |
| 1989 |
| 3 | EE | Torben Æ. Mogensen:
Separating Binding Times in Language Specifications.
FPCA 1989: 14-25 |
| 2 | | Torben Æ. Mogensen:
Binding Time Analysis for Polymorphically Typed Higher Order Languages.
TAPSOFT, Vol.2 1989: 298-312 |
| 1988 |
| 1 | | Torben Æ. Mogensen,
Carsten Kehler Holst:
Terminology.
New Generation Comput. 6(2&3): 303-307 (1988) |