Manfred Schmidt-Schauß

ORCID

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 27

Top Venues

Kaiserslautern University of Technology, Germany (PHD)

Education History

Kaiserslautern University of Technology, Germany

PHD

Publications

Manfred Schmidt-Schauß, David Sabel
Program equivalence in a typed probabilistic call-by-need functional language. J. Log. Algebraic Methods Program. 135 (2023)
Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho
Towards Fast Nominal Anti-unification of Letrec-Expressions. CADE (2023)
David Sabel, Manfred Schmidt-Schauß, Luca Maio
A Probabilistic Call-by-Need Lambda-Calculus - Extended Version. CoRR (2022)
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) (2022)
David Sabel, Manfred Schmidt-Schauß, Luca Maio
Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus. PPDP (2022)
Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho
Nominal Anti-Unification with Atom-Variables. FSCD (2022)
Manfred Schmidt-Schauß, David Sabel
Minimal Translations from Synchronous Communication to Synchronizing Locks. EXPRESS/SOS (2021)
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 (2021)
Manfred Schmidt-Schauß, David Sabel
Minimal Translations from Synchronous Communication to Synchronizing Locks (Extended Version). CoRR (2021)
Yunus D. K. Kutz, Manfred Schmidt-Schauß
Rewriting with generalized nominal unification. Math. Struct. Comput. Sci. 30 (6) (2020)
Manfred Schmidt-Schauß, David Sabel
Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars. EXPRESS/SOS (2020)
Manfred Schmidt-Schauß, Yunus D. K. Kutz
Nominal Unification with Letrec and Environment-Variables. LOPSTR (2020)
Manfred Schmidt-Schauß
Nominal Algorithms: Applications and Extensions. UNIF (2020)
Manfred Schmidt-Schauß
A Note on Unification, Subsumption and Unification Type. Description Logic, Theory Combination, and All That (2019)
Manfred Schmidt-Schauß, David Sabel, Yunus D. K. Kutz
Nominal unification with atom-variables. J. Symb. Comput. 90 (2019)
Manfred Schmidt-Schauß, David Sabel, Nils Dallmeyer
Sequential and Parallel Improvements in a Concurrent Functional Programming Language. PPDP (2018)
Manfred Schmidt-Schauß, Nils Dallmeyer
Optimizing Space of Parallel Processes. WPTE@FSCD (2018)
Manfred Schmidt-Schauß, David Sabel
Nominal Unification with Atom and Context Variables. FSCD (2018)
Manfred Schmidt-Schauß
Linear pattern matching of compressed terms and polynomial rewriting. Math. Struct. Comput. Sci. 28 (8) (2018)
Manfred Schmidt-Schauß, Nils Dallmeyer
Space Improvements and Equivalences in a Functional Core Language. WPTE@FSCD (2017)
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 (2017)
Markus Lohrey, Manfred Schmidt-Schauß
Processing Succinct Matrices and Vectors. Theory Comput. Syst. 61 (2) (2017)
Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret
Nominal Unification of Higher Order Expressions with Recursive Let. CoRR (2016)
Manfred Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret
Nominal Unification of Higher Order Expressions with Recursive Let. LOPSTR (2016)
Manfred Schmidt-Schauß, David Sabel
Unification of program expressions with recursive bindings. PPDP (2016)
Nils Dallmeyer, Manfred Schmidt-Schauß
An Environment for Analyzing Space Optimizations in Call-by-Need Functional Languages. WPTE@FSCD (2016)
David Sabel, Manfred Schmidt-Schauß
A Call-by-Need Lambda Calculus with Scoped Work Decorations. Software Engineering (Workshops) (2016)
Adrià Gascón, Ashish Tiwari, Manfred Schmidt-Schauß
One Context Unification Problems Solvable in Polynomial Time. LICS (2015)
Manfred Schmidt-Schauß, David Sabel
Improvements in a functional core language with call-by-need operational semantics. PPDP (2015)
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)
David Sabel, Manfred Schmidt-Schauß
Observing Success in the Pi-Calculus. WPTE@RTA/TLCA (2015)
Adrià Gascón, Manfred Schmidt-Schauß, Ashish Tiwari
Two-Restricted One Context Unification is in Polynomial Time. CSL (2015)
Manfred Schmidt-Schauß, David Sabel, Joachim Niehren, Jan Schwinghammer
Observational program calculi and the correctness of translations. Theor. Comput. Sci. 577 (2015)
Manfred Schmidt-Schauß, David Sabel
Sharing-aware improvements in a call-by-need functional core language. IFL (2015)
Markus Lohrey, Manfred Schmidt-Schauß
Processing Succinct Matrices and Vectors. CoRR (2014)
Manfred Schmidt-Schauß, David Sabel
Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB. RTA-TLCA (2014)
Markus Lohrey, Manfred Schmidt-Schauß
Processing Succinct Matrices and Vectors. CSR (2014)
Manfred Schmidt-Schauß, David Sabel
Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report). WPTE@RTA/TLCA (2014)
Manfred Schmidt-Schauß
Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk). RTA-TLCA (2014)
David Sabel, Manfred Schmidt-Schauß
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions. J. Autom. Reason. 50 (4) (2013)
Manfred Schmidt-Schauß, Conrad Rau, David Sabel
Algorithms for Extended Alpha-Equivalence and Complexity. RTA (2013)
Manfred Schmidt-Schauß
Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract) TERMGRAPH (2013)
Manfred Schmidt-Schauß, Elena Machkasova, David Sabel
Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings. RTA (2013)
Manfred Schmidt-Schauß, David Sabel
Correctness of an STM Haskell implementation. ICFP (2013)
Manfred Schmidt-Schauß
Matching of Compressed Patterns with Character-Variables. RTA (2012)
David Sabel, Manfred Schmidt-Schauß
Conservative Concurrency in Haskell. LICS (2012)
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß
Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. 78 (5) (2012)
Conrad Rau, David Sabel, Manfred Schmidt-Schauß
Correctness of Program Transformations as a Termination Problem. IJCAR (2012)
Manfred Schmidt-Schauß, Georg Schnitger
Fast equality test for straight-line compressed strings. Inf. Process. Lett. 112 (8-9) (2012)
Conrad Rau, Manfred Schmidt-Schauß
A Unification Algorithm to Compute Overlaps in a Call-by-Need Lambda-Calculus with Variable-Binding Chains. UNIF (2011)
Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
On the complexity of Bounded Second-Order Unification and Stratified Context Unification. Log. J. IGPL 19 (6) (2011)
David Sabel, Manfred Schmidt-Schauß
A contextual semantics for concurrent Haskell with futures. PPDP (2011)
Manfred Schmidt-Schauß
Frontmatter, Table of Contents, Preface, Conference Organization. RTA (2011)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Unification and matching on compressed terms. ACM Trans. Comput. Log. 12 (4) (2011)
Manfred Schmidt-Schauß, David Sabel, Altug Anis
Congruence Closure of Compressed Terms in Polynomial Time. FroCoS (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) (2011)
Conrad Rau, Manfred Schmidt-Schauß
Towards Correctness of Program Transformations Through Unification and Critical Pair Computation UNIF (2010)
Manfred Schmidt-Schauß, David Sabel
On generic context lemmas for higher-order calculi with sharing. Theor. Comput. Sci. 411 (11-13) (2010)
Manfred Schmidt-Schauß, David Sabel
Closures of may-, should- and must-convergences for contextual equivalence. Inf. Process. Lett. 110 (6) (2010)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß, Ashish Tiwari
Context unification with one context variable. J. Symb. Comput. 45 (2) (2010)
Manfred Schmidt-Schauß, David Sabel, Elena Machkasova
Simulation in the Call-by-Need Lambda-Calculus with letrec. RTA (2010)
Matthias Mann, Manfred Schmidt-Schauß
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi. Inf. Comput. 208 (3) (2010)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Unification and Matching on Compressed Terms CoRR (2010)
David Sabel, Manfred Schmidt-Schauß, Frederik Harwath
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi. GI Jahrestagung (2009)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Unification with Singleton Tree Grammars. RTA (2009)
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß
Parameter Reduction in Grammar-Compressed Trees. FoSSaCS (2009)
Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß
Context Matching for Compressed Terms. LICS (2008)
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) (2008)
Manfred Schmidt-Schauß, David Sabel, Marko Schütz
Safety of Nöcker's strictness analysis. J. Funct. Program. 18 (4) (2008)
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)
Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
The Complexity of Monadic Second-Order Unification. SIAM J. Comput. 38 (3) (2008)
Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel
Adequacy of Compositional Translations for Observational Semantics. IFIP TCS (2008)
Manfred Schmidt-Schauß
Correctness of Copy in Calculi with Letrec. RTA (2007)
Joachim Niehren, David Sabel, Manfred Schmidt-Schauß, Jan Schwinghammer
Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. MFPS (2007)
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) (2007)
Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
Bounded Second-Order Unification Is NP-Complete. RTA (2006)
Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
Stratified Context Unification Is NP-Complete. IJCAR (2006)
Manfred Schmidt-Schauß, Klaus U. Schulz
Decidability of bounded higher-order unification. J. Symb. Comput. 40 (2) (2005)
Manfred Schmidt-Schauß
Decidable Variants of Higher-Order Unification. Mechanizing Mathematical Reasoning (2005)
Manfred Schmidt-Schauß
Decidability of bounded second order unification. Inf. Comput. 188 (2) (2004)
Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret
Monadic Second-Order Unification Is NP-Complete. RTA (2004)
Manfred Schmidt-Schauß, Jürgen Stuber
The Complexity of Linear and Stratified Context Matching Problems. Theory Comput. Syst. 37 (6) (2004)
Manfred Schmidt-Schauß
Decidability of Arity-Bounded Higher-Order Matching. CADE (2003)
Manfred Schmidt-Schauß, Klaus U. Schulz
Decidability of Bounded Higher-Order Unification. CSL (2002)
Manfred Schmidt-Schauß
A Decision Algorithm for Stratified Context Unification. J. Log. Comput. 12 (6) (2002)
Manfred Schmidt-Schauß, Klaus U. Schulz
Solvability of Context Equations with Two Context Variables is Decidable. J. Symb. Comput. 33 (1) (2002)
Manfred Schmidt-Schauß
Stratified Context Unification Is in PSPACE. CSL (2001)
Pok-Son Kim, Manfred Schmidt-Schauß
A Term-Based Approach to Project Scheduling. ICCS (2001)
Manfred Schmidt-Schauß, Michael Huber
A Lambda-Calculus with letrec, case, constructors and non-determinism CoRR (2000)
Manfred Schmidt-Schauß, Klaus U. Schulz
Solvability of Context Equations with Two Context Variables is Decidable. CADE (1999)
Manfred Schmidt-Schauß
Decidability of Behavioural Equivalence in Unary PCF. Theor. Comput. Sci. 216 (1-2) (1999)
Manfred Schmidt-Schauß
A Decision Algorithm for Distributive Unification. Theor. Comput. Sci. 208 (1-2) (1998)
Manfred Schmidt-Schauß, Klaus U. Schulz
On the Exponent of Periodicity of Minimal Solutions of Context Equation. RTA (1998)
Arne Kutzner, Manfred Schmidt-Schauß
A Non-Deterministic Call-by-Need Lambda Calculus. ICFP (1998)
Nigel W. O. Hutchison, Ute Neuhaus, Manfred Schmidt-Schauß, Cordelia V. Hall
Natural Expert: A Commercial Functional Programming Environment. J. Funct. Program. 7 (2) (1997)
Sven Eric Panitz, Manfred Schmidt-Schauß
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. SAS (1997)
Manfred Schmidt-Schauß
Decidability of Unification in the Theory of One-Sided Distributivity and a Multiplicative Unit. J. Symb. Comput. 22 (3) (1996)
Manfred Schmidt-Schauß
An Algorithm for Distributive Unification. RTA (1996)
Manfred Schmidt-Schauß, Massimo Marchiori, Sven Eric Panitz
Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems. Theor. Comput. Sci. 149 (2) (1995)
Manfred Schmidt-Schauß
An Algorithm for Distributive Unification. UNIF (1995)

Manfred Schmidt-Schauß.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Manfred Schmidt-Schauß