Grammar-Based Data-Flow Analysis to Stop Deforestation. - Morten Heine Sørensen (CAAP, 1994)

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

Partial Deduction and Driving are Equivalent. - Robert Glück; Morten Heine Sørensen (PLILP, 1994)

The LambdaDelta-calculus. - Jakob Rehof; Morten Heine Sørensen (TACS, 1994)

Call-By-Name CPS-Translation as a Binding-Time Improvement - Kristian Nielsen; Morten Heine Sørensen (SAS, 1995)

An Algorithm of Generalization in Positive Supercompilation. - Morten Heine Sørensen; Robert Glück (ILPS, 1995)

Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi. - Morten Heine Sørensen (CAAP, 1996)

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

Redundant Argument Filtering of Logic Programs. - Michael Leuschel; Morten Heine Sørensen (LOPSTR, 1996)

Controlling Conjunctive Partial Deduction. - Robert Glück; Jesper Jørgensen; Bern Martens; Morten Heine Sørensen (PLILP, 1996)

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

Normalization in λ-calculus and type theory. - Morten Heine Sørensen (1997)

Reflections on Reflections. - Gilles Barthe; John Hatcliff; Morten Heine Sørensen (PLILP, 1997)

Constraints to Stop Higher-Order Deforestation. - Helmut Seidl; Morten Heine Sørensen (POPL, 1997)

A notion of classical pure type system. - Gilles Barthe; John Hatcliff; Morten Heine Sørensen (MFPS, 1997)

Strong Normalization from Weak Normalization in Typed Lambda-Calculi. - Morten Heine Sørensen (Inf. Comput., 1997)

Introduction to Supercompilation. - Morten Heine Sørensen; Robert Glück (Partial Evaluation, 1998)

Constraints to Stop Deforestation. - Helmut Seidl; Morten Heine Sørensen (Sci. Comput. Program., 1998)

On Perfect Supercompilation. - Jens P. Secher; Morten Heine Sørensen (Ershov Memorial Conference, 1999)

AnnoDomini: From Type Theory to Year 2000 Conversion Tool. - Peter Harry Eidorff; Fritz Henglein; Christian Mossin; Henning Niss; Morten Heine Sørensen; Mads Tofte (POPL, 1999)

AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem. - Peter Harry Eidorff; Fritz Henglein; Christian Mossin; Henning Niss; Morten Heine Sørensen; Mads Tofte (TLCA, 1999)

Perpetual Reductions in Lambda-Calculus. - Femke van Raamsdonk; Paula Severi; Morten Heine Sørensen; Hongwei Xi 001 (Inf. Comput., 1999)

Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. - Danny De Schreye; Robert Glück; Jesper Jørgensen; Michael Leuschel; Bern Martens; Morten Heine Sørensen (J. Log. Program., 1999)

CPS Translations and Applications: The Cube and Beyond. - Gilles Barthe; John Hatcliff; Morten Heine Sørensen (High. Order Symb. Comput., 1999)

Domain-free pure type systems. - Gilles Barthe; Morten Heine Sørensen (J. Funct. Program., 2000)

Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments". - Danny De Schreye; Robert Glück; Jesper Jørgensen; Michael Leuschel; Bern Martens; Morten Heine Sørensen (J. Log. Program., 2000)

Convergence of program transformers in the metric space of trees. - Morten Heine Sørensen (Sci. Comput. Program., 2000)

An induction principle for pure type systems. - Gilles Barthe; John Hatcliff; Morten Heine Sørensen (Theor. Comput. Sci., 2001)

Weak normalization implies strong normalization in a class of non-dependent pure type systems. - Gilles Barthe; John Hatcliff; Morten Heine Sørensen (Theor. Comput. Sci., 2001)

From Type Inference to Configuration. - Morten Heine Sørensen; Jens P. Secher (The Essence of Computation, 2002)

From checking to inference via driving and dag grammars. - Jens P. Secher; Morten Heine Sørensen (PEPM, 2002)

Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions. - Peter Møller Neergaard; Morten Heine Sørensen (Inf. Comput., 2002)

Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus. - Inge Li Gørtz; Signe Reuss; Morten Heine Sørensen (High. Order Symb. Comput., 2003)

A Note on Shortest Developments. - Morten Heine Sørensen (Log. Methods Comput. Sci., 2007)

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

A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic. - Morten Heine Sørensen; Pawel Urzyczyn (Notre Dame J. Formal Log., 2010)

Use case-driven performance engineering without "concurrent users". - Morten Heine Sørensen (ICPE, 2013)

Book Reviews. - Morten Heine Sørensen (Stud Logica, 2013)

Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem. - Geoff W. Hamilton; Morten Heine Sørensen (VPT@CAV, 2014)

Raymond Smullyan, A Beginner's Further Guide to Mathematical Logic - World Scientific Publishing 2017, pp. 288; ISBN-10: 9814725722 (hardback) £45.00, ISBN-13: 978-9814725729 (paperback) £24.00, (kindle) £13.49. - Morten Heine Sørensen (Stud Logica, 2019)