Manfred Schmidt-Schauß

According to our database1, Manfred Schmidt-Schauß authored at least 101 papers between 1985 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Nominal unification with atom-variables.
J. Symb. Comput., 2019

A Note on Unification, Subsumption and Unification Type.
Proceedings of the Description Logic, Theory Combination, and All That, 2019

2018
Linear pattern matching of compressed terms and polynomial rewriting.
Mathematical Structures in Computer Science, 2018

Optimizing Space of Parallel Processes.
Proceedings of the Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2018

Nominal Unification with Atom and Context Variables.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Sequential and Parallel Improvements in a Concurrent Functional Programming Language.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

2017
Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations.
Sci. Comput. Program., 2017

Space Improvements and Equivalences in a Functional Core Language.
Proceedings of the Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2017

2016
An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages.
Proceedings of the Proceedings Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2016

A Call-by-Need Lambda Calculus with Scoped Work Decorations.
Proceedings of the Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering 2016 (SE 2016), 2016

Unification of program expressions with recursive bindings.
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

Nominal Unification of Higher Order Expressions with Recursive Let.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2016

2015
Observational program calculi and the correctness of translations.
Theor. Comput. Sci., 2015

Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq.
Logical Methods in Computer Science, 2015

Observing Success in the Pi-Calculus.
Proceedings of the 2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2015

Improvements in a functional core language with call-by-need operational semantics.
Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, 2015

One Context Unification Problems Solvable in Polynomial Time.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Sharing-aware improvements in a call-by-need functional core language.
Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages, 2015

Two-Restricted One Context Unification is in Polynomial Time.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report).
Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2014

Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk).
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Processing Succinct Matrices and Vectors.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions.
J. Autom. Reasoning, 2013

Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract)
Proceedings of the Proceedings 7th International Workshop on Computing with Terms and Graphs, 2013

Algorithms for Extended Alpha-Equivalence and Complexity.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Correctness of an STM Haskell implementation.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
Parameter reduction and automata evaluation for grammar-compressed trees.
J. Comput. Syst. Sci., 2012

Fast equality test for straight-line compressed strings.
Inf. Process. Lett., 2012

Matching of Compressed Patterns with Character-Variables.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Conservative Concurrency in Haskell.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Correctness of Program Transformations as a Termination Problem.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011
Unification and matching on compressed terms.
ACM Trans. Comput. Log., 2011

Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec.
Inf. Process. Lett., 2011

On the complexity of Bounded Second-Order Unification and Stratified Context Unification.
Logic Journal of the IGPL, 2011

Frontmatter, Table of Contents, Preface, Conference Organization.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

A contextual semantics for concurrent Haskell with futures.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

Congruence Closure of Compressed Terms in Polynomial Time.
Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010
On generic context lemmas for higher-order calculi with sharing.
Theor. Comput. Sci., 2010

Context unification with one context variable.
J. Symb. Comput., 2010

Closures of may-, should- and must-convergences for contextual equivalence.
Inf. Process. Lett., 2010

Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi.
Inf. Comput., 2010

Towards Correctness of Program Transformations Through Unification and Critical Pair Computation
Proceedings of the Proceedings 24th International Workshop on Unification, 2010

Simulation in the Call-by-Need Lambda-Calculus with letrec.
Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009
Unification with Singleton Tree Grammars.
Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi.
Proceedings of the Informatik 2009: Im Focus das Leben, 2009

Parameter Reduction in Grammar-Compressed Trees.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

2008
The Complexity of Monadic Second-Order Unification.
SIAM J. Comput., 2008

A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations.
Mathematical Structures in Computer Science, 2008

Safety of Nöcker's strictness analysis.
J. Funct. Program., 2008

A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Context Matching for Compressed Terms.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Adequacy of Compositional Translations for Observational Semantics.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007
Deciding inclusion of set constants over infinite non-strict data structures.
ITA, 2007

Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures.
Electr. Notes Theor. Comput. Sci., 2007

Correctness of Copy in Calculi with Letrec.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2006
Bounded Second-Order Unification Is NP-Complete.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Stratified Context Unification Is NP-Complete.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005
Decidable Variants of Higher-Order Unification.
Proceedings of the Mechanizing Mathematical Reasoning, 2005

2004
The Complexity of Linear and Stratified Context Matching Problems.
Theory Comput. Syst., 2004

Decidability of bounded second order unification.
Inf. Comput., 2004

Monadic Second-Order Unification Is NP-Complete.
Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

2003
Decidability of Arity-Bounded Higher-Order Matching.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
A Decision Algorithm for Stratified Context Unification.
J. Log. Comput., 2002

Decidability of Bounded Higher-Order Unification.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
A Term-Based Approach to Project Scheduling.
Proceedings of the Conceptual Structures: Broadening the Base, 2001

Stratified Context Unification Is in PSPACE.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

Unification Theory.
Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

1999
Decidability of Behavioural Equivalence in Unary PCF.
Theor. Comput. Sci., 1999

Solvability of Context Equations with Two Context Variables is Decidable.
Proceedings of the Automated Deduction, 1999

1998
A Decision Algorithm for Distributive Unification.
Theor. Comput. Sci., 1998

On the Exponent of Periodicity of Minimal Solutions of Context Equation.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

A Non-Deterministic Call-by-Need Lambda Calculus.
Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP '98), 1998

1997
Natural Expert: A Commercial Functional Programming Environment.
J. Funct. Program., 1997

TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language.
Proceedings of the Static Analysis, 4th International Symposium, 1997

1996
Decidability of Unification in the Theory of One-Sided Distributivity and a Multiplicative Unit.
J. Symb. Comput., 1996

An Algorithm for Distributive Unification.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

1995
Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems.
Theor. Comput. Sci., 1995

Abstract Reduction Using a Tableau Calculus
Proceedings of the Static Analysis, 1995

1993
Unification Under One-Sided Distributivity with a Multiplicative Unit.
Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

1991
Attributive Concept Descriptions with Complements.
Artif. Intell., 1991

External Function Calls in a Functional Language.
Proceedings of the Functional Programming, 1991

1990
Subsumption Algorithms for Concept Description Languages.
Proceedings of the 9th European Conference on Artificial Intelligence, 1990

1989
Attributive Concept Descriptions with Unions and Complements
IWBS Report, 1989

Unification in Permutative Equational Theories is Undecidable.
J. Symb. Comput., 1989

On Equational Theories, Unification, and (Un)Decidability.
J. Symb. Comput., 1989

Unification in Boolean Rings and Abelian Groups.
J. Symb. Comput., 1989

Subsumption in KL-ONE is Undecidable.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

Computational Aspects of an Order-Sorted Logic with Term Declarations
Lecture Notes in Computer Science 395, Springer, ISBN: 3-540-51705-7, 1989

1988
Implication of Clauses is Undecidable.
Theor. Comput. Sci., 1988

Bericht zur 9th Conference on Automated Deduction.
KI, 1988

Unification in Free Extensions of Boolean Rings and Abelian Groups
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Unification in a Combination of Arbitrary Disjoint Equational Theories.
Proceedings of the 9th International Conference on Automated Deduction, 1988

Computational aspects of an order-sorted logic with term declarations.
PhD thesis, 1988

1987
On Equational Theories, Unification and Decidability.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

1986
Unification under Associativity and Idempotence is of Type Nullary.
J. Autom. Reasoning, 1986

Unification in Many-Sorted Eqational Theories.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985
The Lion and the Unicorn.
J. Autom. Reasoning, 1985

Unification in a Many-sorted Calculus with Declarations.
Proceedings of the GWAI-85, 1985

A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985


  Loading...