Morten Heine Sørensen

Stud Logica, 2019

2014

Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem.

[BibT_eX]

[DOI]

Geoff W. Hamilton

Proceedings of the VPT 2014. Second International Workshop on Verification and Program Transformation, 2014

2013

Book Reviews.

[BibT_eX]

[DOI]

Stud Logica, 2013

Use case-driven performance engineering without "concurrent users".

[BibT_eX]

[DOI]

Proceedings of the ACM/SPEC International Conference on Performance Engineering, 2013

2010

A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic.

[BibT_eX]

[DOI]

Pawel Urzyczyn

Notre Dame J. Formal Log., 2010

2008

Strong cut-elimination in sequent calculus using Klop's iota-translation and perpetual reductions.

[BibT_eX]

[DOI]

Pawel Urzyczyn

J. Symb. Log., 2008

2007

A Note on Shortest Developments.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

2003

Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus.

[BibT_eX]

[DOI]

Inge Li Gørtz

Signe Reuss

High. Order Symb. Comput., 2003

2002

Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions.

[BibT_eX]

[DOI]

Peter Møller Neergaard

Inf. Comput., 2002

From checking to inference via driving and dag grammars.

[BibT_eX]

[DOI]

Jens P. Secher

Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '02), 2002

From Type Inference to Configuration.

[BibT_eX]

[DOI]

Jens P. Secher

Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001

Weak normalization implies strong normalization in a class of non-dependent pure type systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

An induction principle for pure type systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

2000

Convergence of program transformers in the metric space of trees.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2000

Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments".

[BibT_eX]

[DOI]

J. Log. Program., 2000

Domain-free pure type systems.

[BibT_eX]

[DOI]

J. Funct. Program., 2000

1999

CPS Translations and Applications: The Cube and Beyond.

[BibT_eX]

[DOI]

High. Order Symb. Comput., 1999

Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments.

[BibT_eX]

[DOI]

J. Log. Program., 1999

Perpetual Reductions in Lambda-Calculus.

[BibT_eX]

[DOI]

Femke van Raamsdonk

Paula Severi

Hongwei Xi

Inf. Comput., 1999

AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem.

[BibT_eX]

[DOI]

Mads Tofte

Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

AnnoDomini: From Type Theory to Year 2000 Conversion Tool.

[BibT_eX]

[DOI]

Mads Tofte

Proceedings of the POPL '99, 1999

On Perfect Supercompilation.

[BibT_eX]

[DOI]

Jens P. Secher

Proceedings of the Perspectives of System Informatics, 1999

1998

Constraints to Stop Deforestation.

[BibT_eX]

[DOI]

Helmut Seidl

Sci. Comput. Program., 1998

Introduction to Supercompilation.

[BibT_eX]

[DOI]

Proceedings of the Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, Copenhagen, Denmark, June 29, 1998

1997

Strong Normalization from Weak Normalization in Typed Lambda-Calculi.

[BibT_eX]

[DOI]

Inf. Comput., 1997

A notion of classical pure type system.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

Constraints to Stop Higher-Order Deforestation.

[BibT_eX]

[DOI]

Helmut Seidl

Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

Reflections on Reflections.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages: Implementations, 1997

Normalization in λ-calculus and type theory.

[BibT_eX]

PhD thesis, 1997

1996

A Positive Supercompiler.

[BibT_eX]

[DOI]

Neil D. Jones

J. Funct. Program., 1996

Controlling Conjunctive Partial Deduction.

[BibT_eX]

[DOI]

Jesper Jørgensen

Bern Martens

Proceedings of the Programming Languages: Implementations, 1996

Redundant Argument Filtering of Logic Programs.

[BibT_eX]

[DOI]

Michael Leuschel

Proceedings of the Logic Programming Synthesis and Transformation, 1996

A Roadmap to Metacomputation by Supercompilation.

[BibT_eX]

[DOI]

Proceedings of the Partial Evaluation, International Seminar, 1996

Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi.

[BibT_eX]

[DOI]

Proceedings of the Trees in Algebra and Programming, 1996

1995

An Algorithm of Generalization in Positive Supercompilation.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 1995

Call-By-Name CPS-Translation as a Binding-Time Improvement

[BibT_eX]

[DOI]

Kristian Nielsen

Proceedings of the Static Analysis, 1995

1994

The Lambda<sub>Delta</sub>-calculus.

[BibT_eX]

[DOI]

Jakob Rehof

Proceedings of the Theoretical Aspects of Computer Software, 1994

Partial Deduction and Driving are Equivalent.

[BibT_eX]

[DOI]

Proceedings of the Programming Language Implementation and Logic Programming, 1994

Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC.

[BibT_eX]

[DOI]

Neil D. Jones

Proceedings of the Programming Languages and Systems, 1994

Grammar-Based Data-Flow Analysis to Stop Deforestation.

[BibT_eX]

[DOI]