Morten Heine Sørensen

Morten Heine Sørensen, Pawel Urzyczyn: A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic. Notre Dame Journal of Formal Logic 51(4): 457-473 (2010)

Morten Heine Sørensen, Pawel Urzyczyn: Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions. J. Symb. Log. 73(3): 919-932 (2008)

Morten Heine Sørensen: A Note on Shortest Developments. Logical Methods in Computer Science 3(4) (2007)

Morten Heine Sørensen: A Note on Shortest Developments. CoRR abs/0708.0200 (2007)

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)

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)

Morten Heine Sørensen, Jens P. Secher: From Type Inference to Configuration. The Essence of Computation 2002: 436-472

Jens P. Secher, Morten Heine Sørensen: From checking to inference via driving and dag grammars. PEPM 2002: 41-51

Gilles Barthe, John Hatcliff, Morten Heine Sørensen: An induction principle for pure type systems. Theor. Comput. Sci. 266(1-2): 773-818 (2001)

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)

Gilles Barthe, Morten Heine Sørensen: Domain-free pure type systems. J. Funct. Program. 10(5): 417-452 (2000)

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)

Morten Heine Sørensen: Convergence of program transformers in the metric space of trees. Sci. Comput. Program. 37(1-3): 163-205 (2000)

Femke van Raamsdonk, Paula Severi, Morten Heine Sørensen, Hongwei Xi: Perpetual Reductions in Lambda-Calculus. Inf. Comput. 149(2): 173-225 (1999)

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)

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)

Jens P. Secher, Morten Heine Sørensen: On Perfect Supercompilation. Ershov Memorial Conference 1999: 113-127

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

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

Helmut Seidl, Morten Heine Sørensen: Constraints to Stop Deforestation. Sci. Comput. Program. 32(1-3): 73-107 (1998)

Morten Heine Sørensen: Convergence of Program Transformers in the Metric Space of Trees. MPC 1998: 315-337

Morten Heine Sørensen, Robert Glück: Introduction to Supercompilation. Partial Evaluation 1998: 246-270

Gilles Barthe, John Hatcliff, Morten Heine Sørensen: A notion of classical pure type system. Electr. Notes Theor. Comput. Sci. 6: 4-59 (1997)

Morten Heine Sørensen: Strong Normalization from Weak Normalization in Typed Lambda-Calculi. Inf. Comput. 133(1): 35-71 (1997)

Gilles Barthe, Morten Heine Sørensen: Domain-Free Pure Type Systems. LFCS 1997: 9-20

Gilles Barthe, John Hatcliff, Morten Heine Sørensen: Reflections on Reflections. PLILP 1997: 241-258

Helmut Seidl, Morten Heine Sørensen: Constraints to Stop Higher-Order Deforestation. POPL 1997: 400-413

Morten Heine Sørensen, Robert Glück, Neil D. Jones: A Positive Supercompiler. J. Funct. Program. 6(6): 811-838 (1996)

Morten Heine Sørensen: Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi. CAAP 1996: 287-301

Robert Glück, Morten Heine Sørensen: A Roadmap to Metacomputation by Supercompilation. Dagstuhl Seminar on Partial Evaluation 1996: 137-160

Michael Leuschel, Morten Heine Sørensen: Redundant Argument Filtering of Logic Programs. LOPSTR 1996: 83-103

Robert Glück, Jesper Jørgensen, Bern Martens, Morten Heine Sørensen: Controlling Conjunctive Partial Deduction. PLILP 1996: 152-166

Kristian Nielsen, Morten Heine Sørensen: Call-By-Name CPS-Translation as a Binding-Time Improvement. SAS 1995: 296-313

Morten Heine Sørensen, Robert Glück: An Algorithm of Generalization in Positive Supercompilation. ILPS 1995: 465-479

Morten Heine Sørensen: Grammar-Based Data-Flow Analysis to Stop Deforestation. CAAP 1994: 335-351

Morten Heine Sørensen, Robert Glück, Neil D. Jones: Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. ESOP 1994: 485-500

Robert Glück, Morten Heine Sørensen: Partial Deduction and Driving are Equivalent. PLILP 1994: 165-181

Jakob Rehof, Morten Heine Sørensen: The Lambda_Delta-calculus. TACS 1994: 516-542