Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. - Joachim Niehren; David Sabel; Manfred Schmidt-Schauß; Jan Schwinghammer (MFPS, 2007)

Deciding inclusion of set constants over infinite non-strict data structures. - Manfred Schmidt-Schauß; David Sabel; Marko Schütz (RAIRO Theor. Informatics Appl., 2007)

Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence. - David Sabel (Verlag Dr. Hut, 2008)

Semantik eines verzögert auswertenden Lambdakalküls mit McCarthy's amb für Programmäquivalenz [Semantics of a Call-by-Need Lambda Calculus with McCarthy's Amb for Program Equivalence]. - David Sabel (Ausgezeichnete Informatikdissertationen, 2008)

Adequacy of Compositional Translations for Observational Semantics. - Manfred Schmidt-Schauß; Joachim Niehren; Jan Schwinghammer; David Sabel (IFIP TCS, 2008)

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

A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations. - David Sabel; Manfred Schmidt-Schauß (Math. Struct. Comput. Sci., 2008)

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

Simulation in the Call-by-Need Lambda-Calculus with letrec. - Manfred Schmidt-Schauß; David Sabel; Elena Machkasova (RTA, 2010)

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

On generic context lemmas for higher-order calculi with sharing. - Manfred Schmidt-Schauß; David Sabel (Theor. Comput. Sci., 2010)

Congruence Closure of Compressed Terms in Polynomial Time. - Manfred Schmidt-Schauß; David Sabel; Altug Anis (FroCoS, 2011)

A contextual semantics for concurrent Haskell with futures. - David Sabel; Manfred Schmidt-Schauß (PPDP, 2011)

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

Correctness of Program Transformations as a Termination Problem. - Conrad Rau; David Sabel; Manfred Schmidt-Schauß (IJCAR, 2012)

Conservative Concurrency in Haskell. - David Sabel; Manfred Schmidt-Schauß (LICS, 2012)

An abstract machine for concurrent haskell with futures. - David Sabel (Software Engineering (Workshops), 2012)

Correctness of an STM Haskell implementation. - Manfred Schmidt-Schauß; David Sabel (ICFP, 2013)

Extending Abramsky's Lazy Lambda Calculus: (Non)-Conservativity of Embeddings. - Manfred Schmidt-Schauß; Elena Machkasova; David Sabel (RTA, 2013)

Algorithms for Extended Alpha-Equivalence and Complexity. - Manfred Schmidt-Schauß; Conrad Rau; David Sabel (RTA, 2013)

Parallelizing DPLL in Haskell. - Till Berger; David Sabel (Software Engineering (Workshops), 2013)

A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions. - David Sabel; Manfred Schmidt-Schauß (J. Autom. Reason., 2013)

Structural Rewriting in the pi-Calculus. - David Sabel (WPTE@RTA/TLCA, 2014)

Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB. - Manfred Schmidt-Schauß; David Sabel (RTA-TLCA, 2014)

Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report). - Manfred Schmidt-Schauß; David Sabel (WPTE@RTA/TLCA, 2014)

A Haskell-Implementation of STM Haskell with Early Conflict Detection. - David Sabel (Software Engineering (Workshops), 2014)

Sharing-aware improvements in a call-by-need functional core language. - Manfred Schmidt-Schauß; David Sabel (IFL, 2015)

Improvements in a functional core language with call-by-need operational semantics. - Manfred Schmidt-Schauß; David Sabel (PPDP, 2015)

Observing Success in the Pi-Calculus. - David Sabel; Manfred Schmidt-Schauß (WPTE@RDP, 2015)

Transforming Cycle Rewriting into String Rewriting. - David Sabel; Hans Zantema (RTA, 2015)

Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq. - Manfred Schmidt-Schauß; David Sabel; Elena Machkasova (Log. Methods Comput. Sci., 2015)

Observational program calculi and the correctness of translations. - Manfred Schmidt-Schauß; David Sabel; Joachim Niehren; Jan Schwinghammer (Theor. Comput. Sci., 2015)

Unification of program expressions with recursive bindings. - Manfred Schmidt-Schauß; David Sabel (PPDP, 2016)

A Call-by-Need Lambda Calculus with Scoped Work Decorations. - David Sabel; Manfred Schmidt-Schauß (Software Engineering (Workshops), 2016)

Alpha-renaming of higher-order meta-expressions. - David Sabel (PPDP, 2017)

Termination of Cycle Rewriting by Transformation and Matrix Interpretation. - David Sabel; Hans Zantema (Log. Methods Comput. Sci., 2017)

Improvements in a call-by-need functional core language: Common subexpression elimination and resource preserving translations. - Manfred Schmidt-Schauß; David Sabel (Sci. Comput. Program., 2017)

Sequential and Parallel Improvements in a Concurrent Functional Programming Language. - Manfred Schmidt-Schauß; David Sabel; Nils Dallmeyer (PPDP, 2018)

Nominal Unification with Atom and Context Variables. - Manfred Schmidt-Schauß; David Sabel (FSCD, 2018)

Automating the Diagram Method to Prove Correctness of Program Transformations. - David Sabel (WPTE@FSCD, 2018)

Nominal unification with atom-variables. - Manfred Schmidt-Schauß; David Sabel; Yunus D. K. Kutz (J. Symb. Comput., 2019)

Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars. - Manfred Schmidt-Schauß; David Sabel (EXPRESS/SOS, 2020)

Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version). - Michael Christian Fink Amores; David Sabel (CoRR, 2021)

Minimal Translations from Synchronous Communication to Synchronizing Locks (Extended Version). - Manfred Schmidt-Schauß; David Sabel (CoRR, 2021)

Minimal Translations from Synchronous Communication to Synchronizing Locks. - Manfred Schmidt-Schauß; David Sabel (EXPRESS/SOS, 2021)

Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus. - David Sabel; Manfred Schmidt-Schauß; Luca Maio (PPDP, 2022)

A Probabilistic Call-by-Need Lambda-Calculus - Extended Version. - David Sabel; Manfred Schmidt-Schauß; Luca Maio (CoRR, 2022)

Program equivalence in a typed probabilistic call-by-need functional language. - Manfred Schmidt-Schauß; David Sabel (J. Log. Algebraic Methods Program., 2023)