Morten Heine Sørensen

43 papers A* 2A 1B 4C 2Misc 1Journal 19Unranked 13
YearRankTypeTitle / Venue / Authors
2019 J jnl
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.
Stud Logica
Morten Heine Sørensen
2014 — conf
Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem.
VPT@CAV
Geoff W. Hamilton, Morten Heine Sørensen
2013 J jnl
Book Reviews.
Stud Logica
Morten Heine Sørensen
2013 B conf
Use case-driven performance engineering without "concurrent users".
ICPE
Morten Heine Sørensen
2010 J jnl
A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic.
Notre Dame J. Formal Log.
Morten Heine Sørensen, Pawel Urzyczyn
2008 J jnl
Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions.
J. Symb. Log.
Morten Heine Sørensen, Pawel Urzyczyn
2007 J jnl
A Note on Shortest Developments
CoRR
Morten Heine Sørensen
2007 J jnl
A Note on Shortest Developments.
Log. Methods Comput. Sci.
Morten Heine Sørensen
2003 J jnl
Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus.
High. Order Symb. Comput.
Inge Li Gørtz, Signe Reuss, Morten Heine Sørensen
2002 J jnl
Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions.
Inf. Comput.
Peter Møller Neergaard, Morten Heine Sørensen
2002 — conf
From Type Inference to Configuration.
The Essence of Computation
Morten Heine Sørensen, Jens P. Secher
2002 C conf
From checking to inference via driving and dag grammars.
PEPM
Jens P. Secher, Morten Heine Sørensen
2001 J jnl
An induction principle for pure type systems.
Theor. Comput. Sci.
Gilles Barthe, John Hatcliff, Morten Heine Sørensen
2001 J jnl
Weak normalization implies strong normalization in a class of non-dependent pure type systems.
Theor. Comput. Sci.
Gilles Barthe, John Hatcliff, Morten Heine Sørensen
2000 J jnl
Convergence of program transformers in the metric space of trees.
Sci. Comput. Program.
Morten Heine Sørensen
2000 J jnl
Domain-free pure type systems.
J. Funct. Program.
Gilles Barthe, Morten Heine Sørensen
2000 J jnl
Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments".
J. Log. Program.
Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen
1999 — conf
AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem.
TLCA
Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte
1999 A* conf
AnnoDomini: From Type Theory to Year 2000 Conversion Tool.
POPL
Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte
1999 J jnl
CPS Translations and Applications: The Cube and Beyond.
High. Order Symb. Comput.
Gilles Barthe, John Hatcliff, Morten Heine Sørensen
1999 J jnl
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments.
J. Log. Program.
Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen
1999 — conf
On Perfect Supercompilation.
Ershov Memorial Conference
Jens P. Secher, Morten Heine Sørensen
1999 J jnl
Perpetual Reductions in Lambda-Calculus.
Inf. Comput.
Femke van Raamsdonk, Paula Severi, Morten Heine Sørensen, Hongwei Xi
1998 J jnl
Constraints to Stop Deforestation.
Sci. Comput. Program.
Helmut Seidl, Morten Heine Sørensen
1998 B conf
Convergence of Program Transformers in the Metric Space of Trees.
MPC
Morten Heine Sørensen
1998 — conf
Introduction to Supercompilation.
Partial Evaluation
Morten Heine Sørensen, Robert Glück
1997 B conf
A notion of classical pure type system.
MFPS
Gilles Barthe, John Hatcliff, Morten Heine Sørensen
1997 A* conf
Constraints to Stop Higher-Order Deforestation.
POPL
Helmut Seidl, Morten Heine Sørensen
1997 Misc conf
Domain-Free Pure Type Systems.
LFCS
Gilles Barthe, Morten Heine Sørensen
1997 — —
Normalization in λ-calculus and type theory.
Morten Heine Sørensen
1997 — conf
Reflections on Reflections.
PLILP
Gilles Barthe, John Hatcliff, Morten Heine Sørensen
1997 J jnl
Strong Normalization from Weak Normalization in Typed Lambda-Calculi.
Inf. Comput.
Morten Heine Sørensen
1996 J jnl
A Positive Supercompiler.
J. Funct. Program.
Morten Heine Sørensen, Robert Glück, Neil D. Jones
1996 — conf
A Roadmap to Metacomputation by Supercompilation.
Dagstuhl Seminar on Partial Evaluation
Robert Glück, Morten Heine Sørensen
1996 — conf
Controlling Conjunctive Partial Deduction.
PLILP
Robert Glück, Jesper Jørgensen, Bern Martens, Morten Heine Sørensen
1996 — conf
Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi.
CAAP
Morten Heine Sørensen
1996 C conf
Redundant Argument Filtering of Logic Programs.
LOPSTR
Michael Leuschel, Morten Heine Sørensen
1995 — conf
An Algorithm of Generalization in Positive Supercompilation.
ILPS
Morten Heine Sørensen, Robert Glück
1995 B conf
Call-By-Name CPS-Translation as a Binding-Time Improvement
SAS
Kristian Nielsen, Morten Heine Sørensen
1994 — conf
Grammar-Based Data-Flow Analysis to Stop Deforestation.
CAAP
Morten Heine Sørensen
1994 — conf
Partial Deduction and Driving are Equivalent.
PLILP
Robert Glück, Morten Heine Sørensen
1994 — conf
The Lambda
TACS
Jakob Rehof, Morten Heine Sørensen
1994 A conf
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC.
ESOP
Morten Heine Sørensen, Robert Glück, Neil D. Jones