Manfred Schmidt-Schauß

129 papers A* 6A 11B 10C 9Misc 2Journal 51Unranked 34

Year	Rank	Type	Title / Venue / Authors
2025	C	`conf`	Equational Generalization Problems with Atom-Variables. CICM Alexander Baumgartner, Temur Kutsia, Daniele Nantes-Sobrinho, Manfred Schmidt-Schauß
2025	J	`jnl`	Generalization Problems with Atom-Variables in Languages with Binders and Equational Theories. CoRR Daniele Nantes-Sobrinho, Manfred Schmidt-Schauß, Alexander Baumgartner, Temur Kutsia
2023	J	`jnl`	Program equivalence in a typed probabilistic call-by-need functional language. J. Log. Algebraic Methods Program. Manfred Schmidt-Schauß, David Sabel
2023	A	`conf`	Towards Fast Nominal Anti-unification of Letrec-Expressions. CADE Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho
2022	J	`jnl`	A Probabilistic Call-by-Need Lambda-Calculus - Extended Version. CoRR David Sabel, Manfred Schmidt-Schauß, Luca Maio
2022	C	`conf`	Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus. PPDP David Sabel, Manfred Schmidt-Schauß, Luca Maio
2022	B	`conf`	Nominal Anti-Unification with Atom-Variables. FSCD Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho
2022	J	`jnl`	Nominal Unification and Matching of Higher Order Expressions with Recursive Let. Fundam. Informaticae Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus D. K. Kutz
2021	J	`jnl`	Minimal Translations from Synchronous Communication to Synchronizing Locks (Extended Version). CoRR Manfred Schmidt-Schauß, David Sabel
2021	—	`conf`	Minimal Translations from Synchronous Communication to Synchronizing Locks. EXPRESS/SOS Manfred Schmidt-Schauß, David Sabel
2021	J	`jnl`	Nominal Unification and Matching of Higher Order Expressions with Recursive Let. CoRR Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret, Yunus D. K. Kutz
2020	—	`conf`	Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars. EXPRESS/SOS Manfred Schmidt-Schauß, David Sabel
2020	—	`conf`	Nominal Algorithms: Applications and Extensions. UNIF Manfred Schmidt-Schauß
2020	C	`conf`	Nominal Unification with Letrec and Environment-Variables. LOPSTR Manfred Schmidt-Schauß, Yunus D. K. Kutz
2020	J	`jnl`	Rewriting with generalized nominal unification. Math. Struct. Comput. Sci. Yunus D. K. Kutz, Manfred Schmidt-Schauß
2019	—	`conf`	A Note on Unification, Subsumption and Unification Type. Description Logic, Theory Combination, and All That Manfred Schmidt-Schauß
2019	J	`jnl`	Nominal unification with atom-variables. J. Symb. Comput. Manfred Schmidt-Schauß, David Sabel, Yunus D. K. Kutz
2018	J	`jnl`	Linear pattern matching of compressed terms and polynomial rewriting. Math. Struct. Comput. Sci. Manfred Schmidt-Schauß
2018	B	`conf`	Nominal Unification with Atom and Context Variables. FSCD Manfred Schmidt-Schauß, David Sabel
2018	—	`conf`	Optimizing Space of Parallel Processes. WPTE@FSCD Manfred Schmidt-Schauß, Nils Dallmeyer
2018	C	`conf`	Sequential and Parallel Improvements in a Concurrent Functional Programming Language. PPDP Manfred Schmidt-Schauß, David Sabel, Nils Dallmeyer
2017	J	`jnl`	Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations. Sci. Comput. Program. Manfred Schmidt-Schauß, David Sabel
2017	J	`jnl`	Processing Succinct Matrices and Vectors. Theory Comput. Syst. Markus Lohrey, Manfred Schmidt-Schauß
2017	—	`conf`	Space Improvements and Equivalences in a Functional Core Language. WPTE@FSCD Manfred Schmidt-Schauß, Nils Dallmeyer
2016	C	`conf`	A Call-by-Need Lambda Calculus with Scoped Work Decorations. Software Engineering (Workshops) David Sabel, Manfred Schmidt-Schauß
2016	—	`conf`	An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages. WPTE@FSCD Nils Dallmeyer, Manfred Schmidt-Schauß
2016	C	`conf`	Nominal Unification of Higher Order Expressions with Recursive Let. LOPSTR Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret
2016	J	`jnl`	Nominal Unification of Higher Order Expressions with Recursive Let. CoRR Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret
2016	—	`ed.`	Proceedings of the 30th International Workshop on Unification, UNIF 2016, Porto, Portugal, June 26, 2016. UNIF Silvio Ghilardi, Manfred Schmidt-Schauß
2016	C	`conf`	Unification of program expressions with recursive bindings. PPDP Manfred Schmidt-Schauß, David Sabel
2015	—	`ed.`	2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RDP 2015, Warsaw, Poland, July 2, 2015 WPTE@RDP Yuki Chiba, Santiago Escobar, Naoki Nishida, David Sabel, Manfred Schmidt-Schauß
2015	C	`conf`	Improvements in a functional core language with call-by-need operational semantics. PPDP Manfred Schmidt-Schauß, David Sabel
2015	J	`jnl`	Observational program calculi and the correctness of translations. Theor. Comput. Sci. Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer
2015	—	`conf`	Observing Success in the Pi-Calculus. WPTE@RDP David Sabel, Manfred Schmidt-Schauß
2015	A*	`conf`	One Context Unification Problems Solvable in Polynomial Time. LICS Adrià Gascón, Ashish Tiwari, Manfred Schmidt-Schauß
2015	—	`conf`	Sharing-aware improvements in a call-by-need functional core language. IFL Manfred Schmidt-Schauß, David Sabel
2015	J	`jnl`	Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq. Log. Methods Comput. Sci. Manfred Schmidt-Schauß, David Sabel, Elena Machkasova
2015	B	`conf`	Two-Restricted One Context Unification is in Polynomial Time. CSL Adrià Gascón, Manfred Schmidt-Schauß, Ashish Tiwari
2014	—	`conf`	Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB. RTA-TLCA Manfred Schmidt-Schauß, David Sabel
2014	—	`conf`	Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk). RTA-TLCA Manfred Schmidt-Schauß
2014	—	`conf`	Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report). WPTE@RTA/TLCA Manfred Schmidt-Schauß, David Sabel
2014	—	`ed.`	First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RTA 2014, Vienna, Austria, July 13, 2014 WPTE@RTA/TLCA Manfred Schmidt-Schauß, Masahiko Sakai, David Sabel, Yuki Chiba
2014	Misc	`conf`	Processing Succinct Matrices and Vectors. CSR Markus Lohrey, Manfred Schmidt-Schauß
2014	J	`jnl`	Processing Succinct Matrices and Vectors. CoRR Markus Lohrey, Manfred Schmidt-Schauß
2013	J	`jnl`	A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions. J. Autom. Reason. David Sabel, Manfred Schmidt-Schauß
2013	—	`conf`	Algorithms for Extended Alpha-Equivalence and Complexity. RTA Manfred Schmidt-Schauß, Conrad Rau, David Sabel
2013	A	`conf`	Correctness of an STM Haskell implementation. ICFP Manfred Schmidt-Schauß, David Sabel
2013	—	`conf`	Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings. RTA Manfred Schmidt-Schauß, Elena Machkasova, David Sabel
2013	—	`conf`	Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract) TERMGRAPH Manfred Schmidt-Schauß
2012	A*	`conf`	Conservative Concurrency in Haskell. LICS David Sabel, Manfred Schmidt-Schauß
2012	A	`conf`	Correctness of Program Transformations as a Termination Problem. IJCAR Conrad Rau, David Sabel, Manfred Schmidt-Schauß
2012	J	`jnl`	Fast equality test for straight-line compressed strings. Inf. Process. Lett. Manfred Schmidt-Schauß, Georg Schnitger
2012	—	`conf`	Matching of Compressed Patterns with Character-Variables. RTA Manfred Schmidt-Schauß
2012	J	`jnl`	Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß
2011	—	`conf`	A Unification Algorithm to Compute Overlaps in a Call-by-Need Lambda-Calculus with Variable-Binding Chains. UNIF Conrad Rau, Manfred Schmidt-Schauß
2011	C	`conf`	A contextual semantics for concurrent Haskell with futures. PPDP David Sabel, Manfred Schmidt-Schauß
2011	—	`conf`	Congruence Closure of Compressed Terms in Polynomial Time. FroCoS Manfred Schmidt-Schauß, David Sabel, Altug Anis
2011	J	`jnl`	Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec. Inf. Process. Lett. Manfred Schmidt-Schauß, David Sabel, Elena Machkasova
2011	—	`conf`	Frontmatter, Table of Contents, Preface, Conference Organization. RTA Manfred Schmidt-Schauß
2011	J	`jnl`	On the complexity of Bounded Second-Order Unification and Stratified Context Unification. Log. J. IGPL Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
2011	—	`ed.`	Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, Novi Sad, Serbia, May 30 - June 1, 2011 RTA Manfred Schmidt-Schauß
2011	J	`jnl`	Unification and matching on compressed terms. ACM Trans. Comput. Log. Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
2010	J	`jnl`	Closures of may-, should- and must-convergences for contextual equivalence. Inf. Process. Lett. Manfred Schmidt-Schauß, David Sabel
2010	J	`jnl`	Context unification with one context variable. J. Symb. Comput. Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß, Ashish Tiwari
2010	J	`jnl`	On generic context lemmas for higher-order calculi with sharing. Theor. Comput. Sci. Manfred Schmidt-Schauß, David Sabel
2010	J	`jnl`	Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. Inf. Comput. Matthias Mann, Manfred Schmidt-Schauß
2010	—	`conf`	Simulation in the Call-by-Need Lambda-Calculus with letrec. RTA Manfred Schmidt-Schauß, David Sabel, Elena Machkasova
2010	—	`conf`	Towards Correctness of Program Transformations Through Unification and Critical Pair Computation UNIF Conrad Rau, Manfred Schmidt-Schauß
2010	J	`jnl`	Unification and Matching on Compressed Terms CoRR Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
2009	B	`conf`	Parameter Reduction in Grammar-Compressed Trees. FoSSaCS Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß
2009	—	`conf`	Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi. GI Jahrestagung David Sabel, Manfred Schmidt-Schauß, Frederik Harwath
2009	—	`conf`	Unification with Singleton Tree Grammars. RTA Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
2008	—	`conf`	A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case. RTA Manfred Schmidt-Schauß, Elena Machkasova
2008	J	`jnl`	A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations. Math. Struct. Comput. Sci. David Sabel, Manfred Schmidt-Schauß
2008	—	`conf`	Adequacy of Compositional Translations for Observational Semantics. IFIP TCS Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel
2008	A*	`conf`	Context Matching for Compressed Terms. LICS Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
2008	J	`jnl`	Safety of Nöcker's strictness analysis. J. Funct. Program. Manfred Schmidt-Schauß, David Sabel, Marko Schütz
2008	J	`jnl`	The Complexity of Monadic Second-Order Unification. SIAM J. Comput. Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
2007	—	`conf`	Correctness of Copy in Calculi with Letrec. RTA Manfred Schmidt-Schauß
2007	J	`jnl`	Deciding inclusion of set constants over infinite non-strict data structures. RAIRO Theor. Informatics Appl. Manfred Schmidt-Schauß, David Sabel, Marko Schütz
2007	B	`conf`	Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. MFPS Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer
2006	—	`conf`	Bounded Second-Order Unification Is NP-Complete. RTA Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
2006	A	`conf`	Stratified Context Unification Is NP-Complete. IJCAR Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
2005	J	`jnl`	Decidability of bounded higher-order unification. J. Symb. Comput. Manfred Schmidt-Schauß, Klaus U. Schulz
2005	—	`conf`	Decidable Variants of Higher-Order Unification. Mechanizing Mathematical Reasoning Manfred Schmidt-Schauß
2004	J	`jnl`	Decidability of bounded second order unification. Inf. Comput. Manfred Schmidt-Schauß
2004	—	`conf`	Monadic Second-Order Unification Is NP-Complete. RTA Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
2004	J	`jnl`	The Complexity of Linear and Stratified Context Matching Problems. Theory Comput. Syst. Manfred Schmidt-Schauß, Jürgen Stuber
2003	A	`conf`	Decidability of Arity-Bounded Higher-Order Matching. CADE Manfred Schmidt-Schauß
2002	J	`jnl`	A Decision Algorithm for Stratified Context Unification. J. Log. Comput. Manfred Schmidt-Schauß
2002	B	`conf`	Decidability of Bounded Higher-Order Unification. CSL Manfred Schmidt-Schauß, Klaus U. Schulz
2002	J	`jnl`	Solvability of Context Equations with Two Context Variables is Decidable. J. Symb. Comput. Manfred Schmidt-Schauß, Klaus U. Schulz
2001	Misc	`conf`	A Term-Based Approach to Project Scheduling. ICCS Pok-Son Kim, Manfred Schmidt-Schauß
2001	B	`conf`	Stratified Context Unification Is in PSPACE. CSL Manfred Schmidt-Schauß
2000	J	`jnl`	A Lambda-Calculus with letrec, case, constructors and non-determinism CoRR Manfred Schmidt-Schauß, Michael Huber
1999	J	`jnl`	Decidability of Behavioural Equivalence in Unary PCF. Theor. Comput. Sci. Manfred Schmidt-Schauß
1999	A	`conf`	Solvability of Context Equations with Two Context Variables is Decidable. CADE Manfred Schmidt-Schauß, Klaus U. Schulz
1998	J	`jnl`	A Decision Algorithm for Distributive Unification. Theor. Comput. Sci. Manfred Schmidt-Schauß
1998	A	`conf`	A Non-Deterministic Call-by-Need Lambda Calculus. ICFP Arne Kutzner, Manfred Schmidt-Schauß
1998	—	`conf`	On the Exponent of Periodicity of Minimal Solutions of Context Equation. RTA Manfred Schmidt-Schauß, Klaus U. Schulz
1997	J	`jnl`	Natural Expert: A Commercial Functional Programming Environment. J. Funct. Program. Nigel W. O. Hutchison, Ute Neuhaus, Manfred Schmidt-Schauß, Cordelia V. Hall
1997	B	`conf`	TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. SAS Sven Eric Panitz, Manfred Schmidt-Schauß
1996	—	`conf`	An Algorithm for Distributive Unification. RTA Manfred Schmidt-Schauß
1996	J	`jnl`	Decidability of Unification in the Theory of One-Sided Distributivity and a Multiplicative Unit. J. Symb. Comput. Manfred Schmidt-Schauß
1995	B	`conf`	Abstract Reduction Using a Tableau Calculus SAS Manfred Schmidt-Schauß, Sven Eric Panitz, Marko Schütz
1995	—	`conf`	An Algorithm for Distributive Unification. UNIF Manfred Schmidt-Schauß
1995	J	`jnl`	Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems. Theor. Comput. Sci. Manfred Schmidt-Schauß, Massimo Marchiori, Sven Eric Panitz
1993	B	`conf`	Unification Under One-Sided Distributivity with a Multiplicative Unit. LPAR Manfred Schmidt-Schauß
1991	J	`jnl`	Attributive Concept Descriptions with Complements. Artif. Intell. Manfred Schmidt-Schauß, Gert Smolka
1991	A	`conf`	External Function Calls in a Functional Language. Functional Programming Manfred Schmidt-Schauß
1990	A	`conf`	Subsumption Algorithms for Concept Description Languages. ECAI Bernhard Hollunder, Werner Nutt, Manfred Schmidt-Schauß
1989	J	`jnl`	Attributive Concept Descriptions with Unions and Complements IWBS Report Manfred Schmidt-Schauß, Gert Smolka
1989	—	`book`	Computational Aspects of an Order-Sorted Logic with Term Declarations Manfred Schmidt-Schauß
1989	J	`jnl`	On Equational Theories, Unification, and (Un)Decidability. J. Symb. Comput. Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß
1989	A*	`conf`	Subsumption in KL-ONE is Undecidable. KR Manfred Schmidt-Schauß
1989	J	`jnl`	Unification in Boolean Rings and Abelian Groups. J. Symb. Comput. Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß
1989	J	`jnl`	Unification in Permutative Equational Theories is Undecidable. J. Symb. Comput. Manfred Schmidt-Schauß
1989	J	`jnl`	Unification in a Combination of Arbitrary Disjoint Equational Theories. J. Symb. Comput. Manfred Schmidt-Schauß
1988	J	`jnl`	Bericht zur 9th Conference on Automated Deduction. Künstliche Intell. Hans Jürgen Ohlbach, Manfred Schmidt-Schauß
1988	—	`—`	Computational aspects of an order-sorted logic with term declarations. Manfred Schmidt-Schauß
1988	J	`jnl`	Implication of Clauses is Undecidable. Theor. Comput. Sci. Manfred Schmidt-Schauß
1988	A*	`conf`	Unification in Free Extensions of Boolean Rings and Abelian Groups LICS Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß
1988	A	`conf`	Unification in a Combination of Arbitrary Disjoint Equational Theories. CADE Manfred Schmidt-Schauß
1987	—	`conf`	On Equational Theories, Unification and Decidability. RTA Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß
1986	A	`conf`	Unification in Many-Sorted Eqational Theories. CADE Manfred Schmidt-Schauß
1986	J	`jnl`	Unification under Associativity and Idempotence is of Type Nullary. J. Autom. Reason. Manfred Schmidt-Schauß
1985	A*	`conf`	A Many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation. IJCAI Manfred Schmidt-Schauß
1985	J	`jnl`	The Lion and the Unicorn. J. Autom. Reason. Hans Jürgen Ohlbach, Manfred Schmidt-Schauß
1985	—	`conf`	Unification in a Many-sorted Calculus with Declarations. GWAI Manfred Schmidt-Schauß