David Sabel

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)

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

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

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)

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ß, David Sabel: Closures of may-, should- and must-convergences for contextual equivalence. Inf. Process. Lett. 110(6): 232-235 (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

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

David Sabel: Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence. Verlag Dr. Hut 2008, isbn 978-3-89963-866-0, pp. I-XXX, 1-358

David Sabel: Semantics of a call-by-need lambda calculus with McCarthy's amb for program equivalence. Goethe University Frankfurt am Main 2008, isbn 978-3-89963-866-0, pp. 1-358

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)

David Sabel: Semantics of a Call-by-Need Lambda Calculus with McCarthy's Amb for Program Equivalence. Ausgezeichnete Informatikdissertationen 2008: 221-230

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

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)