Manfred Schmidt-Schauß

David Sabel, Manfred Schmidt-Schauß: A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions. J. Autom. Reasoning 50(4): 383-421 (2013)

Manfred Schmidt-Schauß: Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract). TERMGRAPH 2013: 29-40

Manfred Schmidt-Schauß, Georg Schnitger: Fast equality test for straight-line compressed strings. Inf. Process. Lett. 112(8-9): 341-345 (2012)

Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß: Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. 78(5): 1651-1669 (2012)

Conrad Rau, David Sabel, Manfred Schmidt-Schauß: Correctness of Program Transformations as a Termination Problem. IJCAR 2012: 462-476

David Sabel, Manfred Schmidt-Schauß: Conservative Concurrency in Haskell. LICS 2012: 561-570

Manfred Schmidt-Schauß: Matching of Compressed Patterns with Character-Variables. RTA 2012: 272-287

Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: On the complexity of Bounded Second-Order Unification and Stratified Context Unification. Logic Journal of the IGPL 19(6): 763-789 (2011)

Manfred Schmidt-Schauß, David Sabel, Elena Machkasova: Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec. Inf. Process. Lett. 111(14): 711-716 (2011)

Adria Gascón, Guillem Godoy, Manfred Schmidt-Schauß: Unification and matching on compressed terms. ACM Trans. Comput. Log. 12(4): 26 (2011)

Manfred Schmidt-Schauß, David Sabel, Altug Anis: Congruence Closure of Compressed Terms in Polynomial Time. FroCoS 2011: 227-242

David Sabel, Manfred Schmidt-Schauß: A contextual semantics for concurrent Haskell with futures. PPDP 2011: 101-112

Manfred Schmidt-Schauß: Frontmatter, Table of Contents, Preface, Conference Organization. RTA 2011: i-xvi

Manfred Schmidt-Schauß (Ed.): Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30 - June 1, 2011, Novi Sad, Serbia. LIPIcs 10, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011, isbn 978-3-939897-30-9

Matthias Mann, Manfred Schmidt-Schauß: Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. Inf. Comput. 208(3): 276-291 (2010)

Manfred Schmidt-Schauß, David Sabel: Closures of may-, should- and must-convergences for contextual equivalence. Inf. Process. Lett. 110(6): 232-235 (2010)

Adria Gascón, Guillem Godoy, Manfred Schmidt-Schauß, Ashish Tiwari: Context unification with one context variable. J. Symb. Comput. 45(2): 173-193 (2010)

Manfred Schmidt-Schauß, David Sabel: On generic context lemmas for higher-order calculi with sharing. Theor. Comput. Sci. 411(11-13): 1521-1541 (2010)

Manfred Schmidt-Schauß, David Sabel, Elena Machkasova: Simulation in the Call-by-Need Lambda-Calculus with letrec. RTA 2010: 295-310

Conrad Rau, Manfred Schmidt-Schauß: Towards Correctness of Program Transformations Through Unification and Critical Pair Computation. UNIF 2010: 39-53

Adria Gascón, Guillem Godoy, Manfred Schmidt-Schauß: Unification and Matching on Compressed Terms. CoRR abs/1003.1632 (2010)

Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß: Parameter Reduction in Grammar-Compressed Trees. FOSSACS 2009: 212-226

David Sabel, Manfred Schmidt-Schauß, Frederik Harwath: Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi. GI Jahrestagung 2009: 2931-2945

Adria Gascón, Guillem Godoy, Manfred Schmidt-Schauß: Unification with Singleton Tree Grammars. RTA 2009: 365-379

Manfred Schmidt-Schauß, David Sabel, Marko Schütz: Safety of Nöcker's strictness analysis. J. Funct. Program. 18(4): 503-551 (2008)

David Sabel, Manfred Schmidt-Schauß: A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations. Mathematical Structures in Computer Science 18(3): 501-553 (2008)

Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: The Complexity of Monadic Second-Order Unification. SIAM J. Comput. 38(3): 1113-1140 (2008)

Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel: Adequacy of Compositional Translations for Observational Semantics. IFIP TCS 2008: 521-535

Adria Gascón, Guillem Godoy, Manfred Schmidt-Schauß: Context Matching for Compressed Terms. LICS 2008: 93-102

Manfred Schmidt-Schauß, Elena Machkasova: A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case. RTA 2008: 321-335

Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer: Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. Electr. Notes Theor. Comput. Sci. 173: 313-337 (2007)

Manfred Schmidt-Schauß, David Sabel, Marko Schütz: Deciding inclusion of set constants over infinite non-strict data structures. ITA 41(2): 225-241 (2007)

Manfred Schmidt-Schauß: Correctness of Copy in Calculi with Letrec. RTA 2007: 329-343

Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: Stratified Context Unification Is NP-Complete. IJCAR 2006: 82-96

Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: Bounded Second-Order Unification Is NP-Complete. RTA 2006: 400-414

Manfred Schmidt-Schauß, Klaus U. Schulz: Decidability of bounded higher-order unification. J. Symb. Comput. 40(2): 905-954 (2005)

Manfred Schmidt-Schauß: Decidable Variants of Higher-Order Unification. Mechanizing Mathematical Reasoning 2005: 154-168

Manfred Schmidt-Schauß: Decidability of bounded second order unification. Inf. Comput. 188(2): 143-178 (2004)

Manfred Schmidt-Schauß, Jürgen Stuber: The Complexity of Linear and Stratified Context Matching Problems. Theory Comput. Syst. 37(6): 717-740 (2004)

Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret: Monadic Second-Order Unification Is NP-Complete. RTA 2004: 55-69

Manfred Schmidt-Schauß: Decidability of Arity-Bounded Higher-Order Matching. CADE 2003: 488-502

Manfred Schmidt-Schauß, Klaus U. Schulz: Solvability of Context Equations with Two Context Variables is Decidable. J. Symb. Comput. 33(1): 77-122 (2002)

Manfred Schmidt-Schauß: A Decision Algorithm for Stratified Context Unification. J. Log. Comput. 12(6): 929-953 (2002)

Manfred Schmidt-Schauß, Klaus U. Schulz: Decidability of Bounded Higher-Order Unification. CSL 2002: 522-536

Manfred Schmidt-Schauß: Stratified Context Unification Is in PSPACE. CSL 2001: 498-512

Pok-Son Kim, Manfred Schmidt-Schauß: A Term-Based Approach to Project Scheduling. ICCS 2001: 304-318

Manfred Schmidt-Schauß, Michael Huber: A Lambda-Calculus with letrec, case, constructors and non-determinism. CoRR cs.PL/0011008 (2000)

Manfred Schmidt-Schauß: Decidability of Behavioural Equivalence in Unary PCF. Theor. Comput. Sci. 216(1-2): 363-373 (1999)

Manfred Schmidt-Schauß, Klaus U. Schulz: Solvability of Context Equations with Two Context Variables is Decidable. CADE 1999: 67-81

Manfred Schmidt-Schauß: A Decision Algorithm for Distributive Unification. Theor. Comput. Sci. 208(1-2): 111-148 (1998)

Arne Kutzner, Manfred Schmidt-Schauß: A Non-Deterministic Call-by-Need Lambda Calculus. ICFP 1998: 324-335

Manfred Schmidt-Schauß, Klaus U. Schulz: On the Exponent of Periodicity of Minimal Solutions of Context Equation. RTA 1998: 61-75

Nigel W. O. Hutchison, Ute Neuhaus, Manfred Schmidt-Schauß, Cordelia V. Hall: Natural Expert: A Commercial Functional Programming Environment. J. Funct. Program. 7(2): 163-182 (1997)

Sven Eric Panitz, Manfred Schmidt-Schauß: TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. SAS 1997: 345-360

Manfred Schmidt-Schauß: Decidability of Unification in the Theory of One-Sided Distributivity and a Multiplicative Unit. J. Symb. Comput. 22(3): 315-344 (1996)

Manfred Schmidt-Schauß: An Algorithm for Distributive Unification. RTA 1996: 287-301

Manfred Schmidt-Schauß, Massimo Marchiori, Sven Eric Panitz: Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems. Theor. Comput. Sci. 149(2): 361-374 (1995)

Manfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz: Abstract Reduction Using a Tableau Calculus. SAS 1995: 348-365

Manfred Schmidt-Schauß: Unification Under One-Sided Distributivity with a Multiplicative Unit. LPAR 1993: 289-300

Manfred Schmidt-Schauß, Gert Smolka: Attributive Concept Descriptions with Complements. Artif. Intell. 48(1): 1-26 (1991)

Manfred Schmidt-Schauß: External Function Calls in a Functional Language. Functional Programming 1991: 324-331

Bernhard Hollunder, Werner Nutt, Manfred Schmidt-Schauß: Subsumption Algorithms for Concept Description Languages. ECAI 1990: 348-353

Manfred Schmidt-Schauß: Computational Aspects of an Order-Sorted Logic with Term Declarations. Lecture Notes in Computer Science 395, Springer 1989, isbn 3-540-51705-7

Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß: On Equational Theories, Unification, and (Un)Decidability. J. Symb. Comput. 8(1/2): 3-49 (1989)

Manfred Schmidt-Schauß: Unification in a Combination of Arbitrary Disjoint Equational Theories. J. Symb. Comput. 8(1/2): 51-99 (1989)

Manfred Schmidt-Schauß: Unification in Permutative Equational Theories is Undecidable. J. Symb. Comput. 8(4): 415-421 (1989)

Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß: Unification in Boolean Rings and Abelian Groups. J. Symb. Comput. 8(5): 449-477 (1989)

Manfred Schmidt-Schauß: Subsumption in KL-ONE is Undecidable. KR 1989: 421-431

Manfred Schmidt-Schauß, Gert Smolka: Attributive Concept Descriptions with Unions and Complements. IWBS Report 68 (1989)

Manfred Schmidt-Schauß: Computational aspects of an order-sorted logic with term declarations. Universität Kaiserslautern 1988, pp. 1-226

Hans Jürgen Ohlbach, Manfred Schmidt-Schauß: Bericht zur 9th Conference on Automated Deduction. KI 2(4): 18-19 (1988)

Manfred Schmidt-Schauß: Implication of Clauses is Undecidable. Theor. Comput. Sci. 59: 287-296 (1988)

Manfred Schmidt-Schauß: Unification in a Combination of Arbitrary Disjoint Equational Theories. CADE 1988: 378-396

Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß: Unification in Free Extensions of Boolean Rings and Abelian Groups. LICS 1988: 121-130

Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß: On Equational Theories, Unification and Decidability. RTA 1987: 204-215

Manfred Schmidt-Schauß: Unification under Associativity and Idempotence is of Type Nullary. J. Autom. Reasoning 2(3): 277-281 (1986)

Manfred Schmidt-Schauß: Unification in Many-Sorted Eqational Theories. CADE 1986: 538-552

Hans Jürgen Ohlbach, Manfred Schmidt-Schauß: The Lion and the Unicorn. J. Autom. Reasoning 1(3): 327-332 (1985)

Manfred Schmidt-Schauß: A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation. IJCAI 1985: 1162-1168

Manfred Schmidt-Schauß: Unification in a Many-sorted Calculus with Declarations. GWAI 1985: 118-132