2007 |
36 | EE | Morten Heine Sørensen:
A Note on Shortest Developments
CoRR abs/0708.0200: (2007) |
35 | EE | Morten Heine Sørensen:
A Note on Shortest Developments.
Logical Methods in Computer Science 3(4): (2007) |
2003 |
34 | EE | Inge Li Gørtz,
Signe Reuss,
Morten Heine Sørensen:
Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus.
Higher-Order and Symbolic Computation 16(3): 253-285 (2003) |
2002 |
33 | EE | Jens P. Secher,
Morten Heine Sørensen:
From checking to inference via driving and dag grammars.
PEPM 2002: 41-51 |
32 | EE | Morten Heine Sørensen,
Jens P. Secher:
From Type Inference to Configuration.
The Essence of Computation 2002: 436-472 |
31 | EE | Peter Møller Neergaard,
Morten Heine Sørensen:
Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions.
Inf. Comput. 178(1): 149-179 (2002) |
2001 |
30 | EE | Gilles Barthe,
John Hatcliff,
Morten Heine Sørensen:
An induction principle for pure type systems.
Theor. Comput. Sci. 266(1-2): 773-818 (2001) |
29 | EE | Gilles Barthe,
John Hatcliff,
Morten Heine Sørensen:
Weak normalization implies strong normalization in a class of non-dependent pure type systems.
Theor. Comput. Sci. 269(1-2): 317-361 (2001) |
2000 |
28 | | Gilles Barthe,
Morten Heine Sørensen:
Domain-free pure type systems.
J. Funct. Program. 10(5): 417-452 (2000) |
27 | | Danny De Schreye,
Robert Glück,
Jesper Jørgensen,
Michael Leuschel,
Bern Martens,
Morten Heine Sørensen:
Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments".
J. Log. Program. 43(3): 265 (2000) |
26 | | Morten Heine Sørensen:
Convergence of program transformers in the metric space of trees.
Sci. Comput. Program. 37(1-3): 163-205 (2000) |
1999 |
25 | EE | Jens P. Secher,
Morten Heine Sørensen:
On Perfect Supercompilation.
Ershov Memorial Conference 1999: 113-127 |
24 | EE | Peter Harry Eidorff,
Fritz Henglein,
Christian Mossin,
Henning Niss,
Morten Heine Sørensen,
Mads Tofte:
AnnoDomini: From Type Theory to Year 2000 Conversion Tool.
POPL 1999: 1-14 |
23 | EE | Peter Harry Eidorff,
Fritz Henglein,
Christian Mossin,
Henning Niss,
Morten Heine Sørensen,
Mads Tofte:
AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem.
TLCA 1999: 6-13 |
22 | | Gilles Barthe,
John Hatcliff,
Morten Heine Sørensen:
CPS Translations and Applications: The Cube and Beyond.
Higher-Order and Symbolic Computation 12(2): 125-170 (1999) |
21 | | Femke van Raamsdonk,
Paula Severi,
Morten Heine Sørensen,
Hongwei Xi:
Perpetual Reductions in Lambda-Calculus.
Inf. Comput. 149(2): 173-225 (1999) |
20 | | Danny De Schreye,
Robert Glück,
Jesper Jørgensen,
Michael Leuschel,
Bern Martens,
Morten Heine Sørensen:
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments.
J. Log. Program. 41(2-3): 231-277 (1999) |
1998 |
19 | EE | Morten Heine Sørensen:
Convergence of Program Transformers in the Metric Space of Trees.
MPC 1998: 315-337 |
18 | | Morten Heine Sørensen,
Robert Glück:
Introduction to Supercompilation.
Partial Evaluation 1998: 246-270 |
17 | | Helmut Seidl,
Morten Heine Sørensen:
Constraints to Stop Deforestation.
Sci. Comput. Program. 32(1-3): 73-107 (1998) |
1997 |
16 | | Gilles Barthe,
Morten Heine Sørensen:
Domain-Free Pure Type Systems.
LFCS 1997: 9-20 |
15 | | Gilles Barthe,
John Hatcliff,
Morten Heine Sørensen:
Reflections on Reflections.
PLILP 1997: 241-258 |
14 | EE | Helmut Seidl,
Morten Heine Sørensen:
Constraints to Stop Higher-Order Deforestation.
POPL 1997: 400-413 |
13 | EE | Gilles Barthe,
John Hatcliff,
Morten Heine Sørensen:
A notion of classical pure type system.
Electr. Notes Theor. Comput. Sci. 6: 4-59 (1997) |
12 | | Morten Heine Sørensen:
Strong Normalization from Weak Normalization in Typed Lambda-Calculi.
Inf. Comput. 133(1): 35-71 (1997) |
1996 |
11 | | Morten Heine Sørensen:
Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi.
CAAP 1996: 287-301 |
10 | | Robert Glück,
Morten Heine Sørensen:
A Roadmap to Metacomputation by Supercompilation.
Dagstuhl Seminar on Partial Evaluation 1996: 137-160 |
9 | | Michael Leuschel,
Morten Heine Sørensen:
Redundant Argument Filtering of Logic Programs.
LOPSTR 1996: 83-103 |
8 | | Robert Glück,
Jesper Jørgensen,
Bern Martens,
Morten Heine Sørensen:
Controlling Conjunctive Partial Deduction.
PLILP 1996: 152-166 |
7 | | Morten Heine Sørensen,
Robert Glück,
Neil D. Jones:
A Positive Supercompiler.
J. Funct. Program. 6(6): 811-838 (1996) |
1995 |
6 | | Morten Heine Sørensen,
Robert Glück:
An Algorithm of Generalization in Positive Supercompilation.
ILPS 1995: 465-479 |
5 | | Kristian Nielsen,
Morten Heine Sørensen:
Call-By-Name CPS-Translation as a Binding-Time Improvement
SAS 1995: 296-313 |
1994 |
4 | | Morten Heine Sørensen:
Grammar-Based Data-Flow Analysis to Stop Deforestation.
CAAP 1994: 335-351 |
3 | | Morten Heine Sørensen,
Robert Glück,
Neil D. Jones:
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC.
ESOP 1994: 485-500 |
2 | | Robert Glück,
Morten Heine Sørensen:
Partial Deduction and Driving are Equivalent.
PLILP 1994: 165-181 |
1 | | Jakob Rehof,
Morten Heine Sørensen:
The LambdaDelta-calculus.
TACS 1994: 516-542 |