- JFP 18 (4): 503551, 2008. c 2007 Cambridge University Press doi:10.1017/S0956796807006624 First published online 8 November 2007 Printed in the United Kingdom
- This is a reconstruction of the paper Subsumption in KL-ONE is Undecidable
- International Conference on Rewriting Techniques and Applications 2010 (Edinburgh), pp. 295-310 http://rewriting.loria.fr/rta/
- A Decision Algorithm for Distributive Unification Manfred SchmidtSchau
- Simulation in the Call-by-Need Lambda-Calculus with letrec
- FUNDIO: A Lambda-Calculus With letrec, case, Constructors, and an IO-Interface
- Closures of May and Must Convergence for Contextual Equivalence
- Fast Equality Test for Straight-Line Compressed Strings
- On the exponent of periodicity of minimal solutions of context equations
- Deciding subset relationship of co-inductively defined set constants
- Towards Correctness of Program Transformations Through Unification and Critical Pair Computation
- A NonDeterministic CallbyNeed Lambda Calculus Arne Kutzner, Manfred SchmidtSchau
- A Partial Rehabilitation of SideEffecting I/O: NonDeterminism in NonStrict Functional Languages
- On the complexity of linear and strati ed context matching problems
- On Equivalences and Standardization in a Non-Deterministic
- On Equivalences and Standardization in a Non-Deterministic
- FUNDIO: A Lambda-Calculus With letrec, case, Constructors, and an IO-Interface
- Proving Termination of HigherOrder Functional Programs with a Tableaulike Calculus
- Fast Equality Test for Straight-Line Compressed Manfred Schmidt-Schau1
- A Contextual Semantics for Concurrent Haskell with Futures
- Pattern Matching of Compressed Terms and Contexts and Polynomial Rewriting
- Reconstructing a Logic for Inductive Proofs of Properties of Functional Programs
- Reconstruction of a Logic for Inductive Proofs of Properties of Functional Programs
- Maribel Fernandez (Ed.): 24th International Workshop on Unification (UNIF2010).
- On the Complexity of Bounded Second-order Unification
- Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
- Counterexamples to Simulation in Non-Deterministic Call-by-Need Lambda-Calculi
- Parameter Reduction in Grammar-Compressed Trees Markus Lohrey1
- Adequacy of Compositional Translations for Observational Semantics
- Adequacy of Compositional Translations for Observational Semantics
- Adequacy of Compositional Translations for Observational Semantics
- A Finite Simulation Method in a Non-Deterministic Call-by-Need Calculus with
- On Generic Context Lemmas for Lambda Calculi with Sharing
- On Generic Context Lemmas for Lambda Calculi with Sharing
- Correctness of Copy in Calculi with Letrec, Case, Constructors and Por
- Program Equivalence for a Concurrent Lambda Calculus with Futures
- Equivalence of Call-By-Name and Call-By-Need for Lambda-Calculi with Letrec
- A Call-by-Need Lambda-Calculus with Locally Bottom-Avoiding Choice
- Deciding subset relationship of co-inductively defined set constants
- How to Prove Similarity a Precongruence in Non-Deterministic Call-by-Need
- Polynomial Equality Testing for Terms with Shared Substructures
- A Complete Proof of Nocker's Strictness Analysis
- On the Safety of Nocker's Strictness Analysis Manfred Schmidt-Schau1
- Modular Termination of r-Consistent and Left-Linear, Term Rewriting Systems
- Unification Algebras: An Axiomatic Approach to
- Decidability of Uni cation in the Theory of One-Sided Distributivity and a Multiplicative Unit
- TEA: Automatically proving termination of programs in a nonstrict higherorder functional
- An Algorithm for Distributive Unification Manfred SchmidtSchau
- Unification of Stratified SecondOrder Terms Manfred SchmidtSchau,
- Adequacy of Compositional Translations for Observational Semantics
- Fast Equality Test for Straight-Line Compressed Strings Manfred Schmidt-Schau
- A Decision Algorithm for Stratified Context Unification
- Correctness of Copy in Calculi with Letrec, Case and Constructors
- Strictness Analysis by Abstract Reduction Using a Tableau Calculus
- C d C : d e 1 Introduction
- Adequacy of Compositional Translations for Observational Semantics
- On Correctness of Buffer Implementations in a Concurrent Lambda Calculus with Futures
- Equivalence of Call-By-Name and Call-By-Need for Lambda-Calculi with Letrec
- On Equivalences and Standardization in a Non-Deterministic
- 1 Introduction On the Semantics and Interpretation of Rule
- A Termination Proof of Reduction in a Simply Typed Calculus with Constructors
- Unification in Permutative Equational Theories is Undecidable
- An Algorithm for Distributive Unification Manfred SchmidtSchau
- Modular Termination of r-Consistent and Left-Linear, Term Rewriting Systems
- Decidability of Behavioral Equivalence in Unary Manfred SchmidtSchau
- Reconstructing a Logic for Inductive Proofs of Properties of Functional Programs
- Contextual Equivalence in Lambda-Calculi extended with letrec and with a Parametric
- On Proving the Equivalence of Concurrency Primitives
- Decidability of Bounded Higher-Order Manfred Schmidt-Schau 1 & Klaus U. Schulz 2
- On Generic Context Lemmas for Lambda Calculi with Sharing
- Towards Correctness of Program Transformations Through Unification and Critical Pair Computation
- Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
- An Optimized Decision Algorithm for Stratified Context Unification
- Decidability of Bounded Second Order Unification
- Program Transformation for Functional Circuit Descriptions
- On Correctness of Buffer Implementations in a Concurrent Lambda Calculus with Futures
- Reconstruction of a logic for inductive proofs of properties of functional programs
- Automatic Extraction of Context Information from Programs Using Abstract Reduction
- This is a reconstruction of the paper Subsumption in KL-ONE is Undecidable
- Computing Overlappings by Unification in the Deterministic Lambda Calculus LR with letrec,
- A Contextual Semantics for Concurrent Haskell with Futures
- Congruence Closure of Compressed Terms in Polynomial Time
- A Unification Algorithm to Compute Overlaps in a Call-by-Need Lambda-Calculus with
- On Conservativity of Concurrent Haskell David Sabel and Manfred Schmidt-Schauss
- Encoding Induction in Correctness Proofs of Program Transformations as a Termination