Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManfred Schmidt-Schauß
Person information
- affiliation: Goethe University of Frankfurt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j41]Manfred Schmidt-Schauß
, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus D. K. Kutz:
Nominal Unification and Matching of Higher Order Expressions with Recursive Let. Fundam. Informaticae 185(3): 247-283 (2022)- [c67]Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho:
Nominal Anti-Unification with Atom-Variables. FSCD 2022: 7:1-7:22 - [c66]David Sabel, Manfred Schmidt-Schauß, Luca Maio:
Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus. PPDP 2022: 4:1-4:15 - [i8]David Sabel, Manfred Schmidt-Schauß, Luca Maio:
A Probabilistic Call-by-Need Lambda-Calculus - Extended Version. CoRR abs/2205.14916 (2022) - 2021
- [c65]Manfred Schmidt-Schauß, David Sabel:
Minimal Translations from Synchronous Communication to Synchronizing Locks. EXPRESS/SOS 2021: 59-75 - [i7]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus D. K. Kutz:
Nominal Unification and Matching of Higher Order Expressions with Recursive Let. CoRR abs/2102.08146 (2021) - [i6]Manfred Schmidt-Schauß, David Sabel:
Minimal Translations from Synchronous Communication to Synchronizing Locks (Extended Version). CoRR abs/2107.14651 (2021) - 2020
- [j40]Yunus D. K. Kutz, Manfred Schmidt-Schauß:
Rewriting with generalized nominal unification. Math. Struct. Comput. Sci. 30(6): 710-735 (2020) - [c64]Manfred Schmidt-Schauß, Yunus D. K. Kutz:
Nominal Unification with Letrec and Environment-Variables. LOPSTR 2020: 95-112 - [c63]Manfred Schmidt-Schauß, David Sabel:
Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars. EXPRESS/SOS 2020: 88-105
2010 – 2019
- 2019
- [j39]Manfred Schmidt-Schauß, David Sabel, Yunus D. K. Kutz:
Nominal unification with atom-variables. J. Symb. Comput. 90: 42-64 (2019) - [c62]Manfred Schmidt-Schauß:
A Note on Unification, Subsumption and Unification Type. Description Logic, Theory Combination, and All That 2019: 562-572 - 2018
- [j38]Manfred Schmidt-Schauß:
Linear pattern matching of compressed terms and polynomial rewriting. Math. Struct. Comput. Sci. 28(8): 1415-1450 (2018) - [c61]Manfred Schmidt-Schauß, David Sabel, Nils Dallmeyer:
Sequential and Parallel Improvements in a Concurrent Functional Programming Language. PPDP 2018: 20:1-20:13 - [c60]Manfred Schmidt-Schauß, David Sabel:
Nominal Unification with Atom and Context Variables. FSCD 2018: 28:1-28:20 - [c59]Manfred Schmidt-Schauß, Nils Dallmeyer:
Optimizing Space of Parallel Processes. WPTE@FSCD 2018: 53-67 - 2017
- [j37]Markus Lohrey, Manfred Schmidt-Schauß:
Processing Succinct Matrices and Vectors. Theory Comput. Syst. 61(2): 322-351 (2017) - [j36]Manfred Schmidt-Schauß, David Sabel:
Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations. Sci. Comput. Program. 147: 3-26 (2017) - [c58]Manfred Schmidt-Schauß, Nils Dallmeyer:
Space Improvements and Equivalences in a Functional Core Language. WPTE@FSCD 2017: 98-112 - 2016
- [c57]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Unification of Higher Order Expressions with Recursive Let. LOPSTR 2016: 328-344 - [c56]Manfred Schmidt-Schauß, David Sabel:
Unification of program expressions with recursive bindings. PPDP 2016: 160-173 - [c55]David Sabel, Manfred Schmidt-Schauß:
A Call-by-Need Lambda Calculus with Scoped Work Decorations. Software Engineering (Workshops) 2016: 70-90 - [c54]Nils Dallmeyer, Manfred Schmidt-Schauß:
An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages. WPTE@FSCD 2016: 78-92 - [i5]Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret:
Nominal Unification of Higher Order Expressions with Recursive Let. CoRR abs/1608.03771 (2016) - 2015
- [j35]Manfred Schmidt-Schauß, David Sabel, Elena Machkasova:
Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq. Log. Methods Comput. Sci. 11(1) (2015) - [j34]Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer:
Observational program calculi and the correctness of translations. Theor. Comput. Sci. 577: 98-124 (2015) - [c53]Adrià Gascón, Manfred Schmidt-Schauß, Ashish Tiwari:
Two-Restricted One Context Unification is in Polynomial Time. CSL 2015: 405-422 - [c52]Manfred Schmidt-Schauß, David Sabel:
Sharing-aware improvements in a call-by-need functional core language. IFL 2015: 6:1-6:12 - [c51]Adrià Gascón, Ashish Tiwari, Manfred Schmidt-Schauß:
One Context Unification Problems Solvable in Polynomial Time. LICS 2015: 499-510 - [c50]Manfred Schmidt-Schauß, David Sabel:
Improvements in a functional core language with call-by-need operational semantics. PPDP 2015: 220-231 - [c49]David Sabel, Manfred Schmidt-Schauß:
Observing Success in the Pi-Calculus. WPTE@RDP 2015: 31-46 - [e3]Yuki Chiba, Santiago Escobar, Naoki Nishida, David Sabel, Manfred Schmidt-Schauß:
2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RDP 2015, July 2, 2015, Warsaw, Poland. OASIcs 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-94-1 [contents] - 2014
- [c48]Markus Lohrey, Manfred Schmidt-Schauß:
Processing Succinct Matrices and Vectors. CSR 2014: 245-258 - [c47]Manfred Schmidt-Schauß:
Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk). RTA-TLCA 2014: 21-30 - [c46]Manfred Schmidt-Schauß, David Sabel:
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report). WPTE@RTA/TLCA 2014: 63-74 - [c45]Manfred Schmidt-Schauß, David Sabel:
Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB. RTA-TLCA 2014: 379-394 - [e2]Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, Yuki Chiba:
First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RTA 2014, July 13, 2014, Vienna, Austria. OASIcs 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-70-5 [contents] - [i4]Markus Lohrey, Manfred Schmidt-Schauß:
Processing Succinct Matrices and Vectors. CoRR abs/1402.3452 (2014) - 2013
- [j33]David Sabel, Manfred Schmidt-Schauß:
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions. J. Autom. Reason. 50(4): 383-421 (2013) - [c44]Manfred Schmidt-Schauß, David Sabel:
Correctness of an STM Haskell implementation. ICFP 2013: 161-172 - [c43]Manfred Schmidt-Schauß, Elena Machkasova, David Sabel:
Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings. RTA 2013: 239-254 - [c42]Manfred Schmidt-Schauß, Conrad Rau, David Sabel:
Algorithms for Extended Alpha-Equivalence and Complexity. RTA 2013: 255-270 - [c41]Manfred Schmidt-Schauß:
Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract). TERMGRAPH 2013: 29-40 - 2012
- [j32]Manfred Schmidt-Schauß, Georg Schnitger:
Fast equality test for straight-line compressed strings. Inf. Process. Lett. 112(8-9): 341-345 (2012) - [j31]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) - [c40]Conrad Rau, David Sabel, Manfred Schmidt-Schauß:
Correctness of Program Transformations as a Termination Problem. IJCAR 2012: 462-476 - [c39]David Sabel, Manfred Schmidt-Schauß:
Conservative Concurrency in Haskell. LICS 2012: 561-570 - [c38]Manfred Schmidt-Schauß:
Matching of Compressed Patterns with Character-Variables. RTA 2012: 272-287 - 2011
- [j30]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
On the complexity of Bounded Second-Order Unification and Stratified Context Unification. Log. J. IGPL 19(6): 763-789 (2011) - [j29]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) - [j28]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification and matching on compressed terms. ACM Trans. Comput. Log. 12(4): 26:1-26:37 (2011) - [c37]Manfred Schmidt-Schauß, David Sabel, Altug Anis:
Congruence Closure of Compressed Terms in Polynomial Time. FroCoS 2011: 227-242 - [c36]David Sabel, Manfred Schmidt-Schauß:
A contextual semantics for concurrent Haskell with futures. PPDP 2011: 101-112 - [c35]Manfred Schmidt-Schauß:
Frontmatter, Table of Contents, Preface, Conference Organization. RTA 2011: i-xvi - [e1]Manfred Schmidt-Schauß:
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 für Informatik 2011, ISBN 978-3-939897-30-9 [contents] - 2010
- [j27]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) - [j26]Manfred Schmidt-Schauß, David Sabel:
Closures of may-, should- and must-convergences for contextual equivalence. Inf. Process. Lett. 110(6): 232-235 (2010) - [j25]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß, Ashish Tiwari:
Context unification with one context variable. J. Symb. Comput. 45(2): 173-193 (2010) - [j24]Manfred Schmidt-Schauß, David Sabel:
On generic context lemmas for higher-order calculi with sharing. Theor. Comput. Sci. 411(11-13): 1521-1541 (2010) - [c34]Manfred Schmidt-Schauß, David Sabel, Elena Machkasova:
Simulation in the Call-by-Need Lambda-Calculus with letrec. RTA 2010: 295-310 - [c33]Conrad Rau, Manfred Schmidt-Schauß:
Towards Correctness of Program Transformations Through Unification and Critical Pair Computation. UNIF 2010: 39-53 - [i3]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification and Matching on Compressed Terms. CoRR abs/1003.1632 (2010)
2000 – 2009
- 2009
- [c32]Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß:
Parameter Reduction in Grammar-Compressed Trees. FoSSaCS 2009: 212-226 - [c31]David Sabel, Manfred Schmidt-Schauß, Frederik Harwath:
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi. GI Jahrestagung 2009: 2931-2945 - [c30]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification with Singleton Tree Grammars. RTA 2009: 365-379 - 2008
- [j23]Manfred Schmidt-Schauß, David Sabel, Marko Schütz:
Safety of Nöcker's strictness analysis. J. Funct. Program. 18(4): 503-551 (2008) - [j22]David Sabel, Manfred Schmidt-Schauß:
A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations. Math. Struct. Comput. Sci. 18(3): 501-553 (2008) - [j21]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
The Complexity of Monadic Second-Order Unification. SIAM J. Comput. 38(3): 1113-1140 (2008) - [c29]Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel:
Adequacy of Compositional Translations for Observational Semantics. IFIP TCS 2008: 521-535 - [c28]Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Context Matching for Compressed Terms. LICS 2008: 93-102 - [c27]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 - 2007
- [j20]Manfred Schmidt-Schauß, David Sabel, Marko Schütz:
Deciding inclusion of set constants over infinite non-strict data structures. RAIRO Theor. Informatics Appl. 41(2): 225-241 (2007) - [c26]Manfred Schmidt-Schauß:
Correctness of Copy in Calculi with Letrec. RTA 2007: 329-343 - [c25]Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer:
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. MFPS 2007: 313-337 - 2006
- [c24]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Stratified Context Unification Is NP-Complete. IJCAR 2006: 82-96 - [c23]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Bounded Second-Order Unification Is NP-Complete. RTA 2006: 400-414 - 2005
- [j19]Manfred Schmidt-Schauß, Klaus U. Schulz:
Decidability of bounded higher-order unification. J. Symb. Comput. 40(2): 905-954 (2005) - [c22]Manfred Schmidt-Schauß:
Decidable Variants of Higher-Order Unification. Mechanizing Mathematical Reasoning 2005: 154-168 - 2004
- [j18]Manfred Schmidt-Schauß:
Decidability of bounded second order unification. Inf. Comput. 188(2): 143-178 (2004) - [j17]Manfred Schmidt-Schauß, Jürgen Stuber:
The Complexity of Linear and Stratified Context Matching Problems. Theory Comput. Syst. 37(6): 717-740 (2004) - [c21]Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Monadic Second-Order Unification Is NP-Complete. RTA 2004: 55-69 - 2003
- [c20]Manfred Schmidt-Schauß:
Decidability of Arity-Bounded Higher-Order Matching. CADE 2003: 488-502 - 2002
- [j16]Manfred Schmidt-Schauß, Klaus U. Schulz:
Solvability of Context Equations with Two Context Variables is Decidable. J. Symb. Comput. 33(1): 77-122 (2002) - [j15]Manfred Schmidt-Schauß:
A Decision Algorithm for Stratified Context Unification. J. Log. Comput. 12(6): 929-953 (2002) - [c19]Manfred Schmidt-Schauß, Klaus U. Schulz:
Decidability of Bounded Higher-Order Unification. CSL 2002: 522-536 - 2001
- [c18]Manfred Schmidt-Schauß:
Stratified Context Unification Is in PSPACE. CSL 2001: 498-512 - [c17]Pok-Son Kim, Manfred Schmidt-Schauß:
A Term-Based Approach to Project Scheduling. ICCS 2001: 304-318 - 2000
- [i2]Manfred Schmidt-Schauß, Michael Huber:
A Lambda-Calculus with letrec, case, constructors and non-determinism. CoRR cs.PL/0011008 (2000)
1990 – 1999
- 1999
- [j14]Manfred Schmidt-Schauß:
Decidability of Behavioural Equivalence in Unary PCF. Theor. Comput. Sci. 216(1-2): 363-373 (1999) - [c16]Manfred Schmidt-Schauß, Klaus U. Schulz:
Solvability of Context Equations with Two Context Variables is Decidable. CADE 1999: 67-81 - 1998
- [j13]Manfred Schmidt-Schauß:
A Decision Algorithm for Distributive Unification. Theor. Comput. Sci. 208(1-2): 111-148 (1998) - [c15]Arne Kutzner, Manfred Schmidt-Schauß:
A Non-Deterministic Call-by-Need Lambda Calculus. ICFP 1998: 324-335 - [c14]Manfred Schmidt-Schauß, Klaus U. Schulz:
On the Exponent of Periodicity of Minimal Solutions of Context Equation. RTA 1998: 61-75 - 1997
- [j12]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) - [c13]Sven Eric Panitz, Manfred Schmidt-Schauß:
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. SAS 1997: 345-360 - 1996
- [j11]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) - [c12]Manfred Schmidt-Schauß:
An Algorithm for Distributive Unification. RTA 1996: 287-301 - 1995
- [j10]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) - [c11]Manfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz:
Abstract Reduction Using a Tableau Calculus. SAS 1995: 348-365 - 1993
- [c10]Manfred Schmidt-Schauß:
Unification Under One-Sided Distributivity with a Multiplicative Unit. LPAR 1993: 289-300 - 1991
- [j9]Manfred Schmidt-Schauß, Gert Smolka:
Attributive Concept Descriptions with Complements. Artif. Intell. 48(1): 1-26 (1991) - [c9]Manfred Schmidt-Schauß:
External Function Calls in a Functional Language. Functional Programming 1991: 324-331 - 1990
- [c8]Bernhard Hollunder, Werner Nutt, Manfred Schmidt-Schauß:
Subsumption Algorithms for Concept Description Languages. ECAI 1990: 348-353
1980 – 1989
- 1989
- [b2]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 - [j8]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) - [j7]Manfred Schmidt-Schauß:
Unification in a Combination of Arbitrary Disjoint Equational Theories. J. Symb. Comput. 8(1/2): 51-99 (1989) - [j6]Manfred Schmidt-Schauß:
Unification in Permutative Equational Theories is Undecidable. J. Symb. Comput. 8(4): 415-421 (1989) - [j5]Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß:
Unification in Boolean Rings and Abelian Groups. J. Symb. Comput. 8(5): 449-477 (1989) - [c7]Manfred Schmidt-Schauß:
Subsumption in KL-ONE is Undecidable. KR 1989: 421-431 - [i1]Manfred Schmidt-Schauß, Gert Smolka:
Attributive Concept Descriptions with Unions and Complements. IWBS Report 68 (1989) - 1988
- [b1]Manfred Schmidt-Schauß:
Computational aspects of an order-sorted logic with term declarations. Kaiserslautern University of Technology, Germany, 1988, pp. 1-226 - [j4]Hans Jürgen Ohlbach, Manfred Schmidt-Schauß:
Bericht zur 9th Conference on Automated Deduction. Künstliche Intell. 2(4): 18-19 (1988) - [j3]Manfred Schmidt-Schauß:
Implication of Clauses is Undecidable. Theor. Comput. Sci. 59: 287-296 (1988) - [c6]Manfred Schmidt-Schauß:
Unification in a Combination of Arbitrary Disjoint Equational Theories. CADE 1988: 378-396 - [c5]Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß:
Unification in Free Extensions of Boolean Rings and Abelian Groups. LICS 1988: 121-130 - 1987
- [c4]Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß:
On Equational Theories, Unification and Decidability. RTA 1987: 204-215 - 1986
- [j2]Manfred Schmidt-Schauß:
Unification under Associativity and Idempotence is of Type Nullary. J. Autom. Reason. 2(3): 277-281 (1986) - [c3]Manfred Schmidt-Schauß:
Unification in Many-Sorted Eqational Theories. CADE 1986: 538-552 - 1985
- [j1]Hans Jürgen Ohlbach, Manfred Schmidt-Schauß:
The Lion and the Unicorn. J. Autom. Reason. 1(3): 327-332 (1985) - [c2]Manfred Schmidt-Schauß:
A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation. IJCAI 1985: 1162-1168 - [c1]Manfred Schmidt-Schauß:
Unification in a Many-sorted Calculus with Declarations. GWAI 1985: 118-132