David Sabel

53 papers A* 1A 2B 2C 11Journal 16Unranked 15
YearRankTypeTitle / Venue / Authors
2023 J jnl
Program equivalence in a typed probabilistic call-by-need functional language.
J. Log. Algebraic Methods Program.
Manfred Schmidt-Schauß, David Sabel
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
2021 J jnl
Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version).
CoRR
Michael Christian Fink Amores, David Sabel
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
2020 — conf
Correctly Implementing Synchronous Message Passing in the Pi-Calculus By Concurrent Haskell's MVars.
EXPRESS/SOS
Manfred Schmidt-Schauß, David Sabel
2019 J jnl
Nominal unification with atom-variables.
J. Symb. Comput.
Manfred Schmidt-Schauß, David Sabel, Yunus D. K. Kutz
2019 — ed.
Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@FSCD 2018, Oxford, England, 8th July 2018.
WPTE@FSCD
Joachim Niehren, David Sabel
2018 — conf
Automating the Diagram Method to Prove Correctness of Program Transformations.
WPTE@FSCD
David Sabel
2018 B conf
Nominal Unification with Atom and Context Variables.
FSCD
Manfred Schmidt-Schauß, David Sabel
2018 — ed.
Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@FSCD 2017, Oxford, UK, 8th September 2017.
WPTE@FSCD
Horatiu Cirstea, David Sabel
2018 C ed.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, PPDP 2018, Frankfurt am Main, Germany, September 03-05, 2018
PPDP
David Sabel, Peter Thiemann
2018 C conf
Sequential and Parallel Improvements in a Concurrent Functional Programming Language.
PPDP
Manfred Schmidt-Schauß, David Sabel, Nils Dallmeyer
2017 C conf
Alpha-renaming of higher-order meta-expressions.
PPDP
David Sabel
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
Termination of Cycle Rewriting by Transformation and Matrix Interpretation.
Log. Methods Comput. Sci.
David Sabel, Hans Zantema
2016 C conf
A Call-by-Need Lambda Calculus with Scoped Work Decorations.
Software Engineering (Workshops)
David Sabel, 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 — 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 — conf
Transforming Cycle Rewriting into String Rewriting.
RTA
David Sabel, Hans Zantema
2014 C conf
A Haskell-Implementation of STM Haskell with Early Conflict Detection.
Software Engineering (Workshops)
David Sabel
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
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 — conf
Structural Rewriting in the pi-Calculus.
WPTE@RTA/TLCA
David Sabel
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 C conf
Parallelizing DPLL in Haskell.
Software Engineering (Workshops)
Till Berger, David Sabel
2012 C conf
An abstract machine for concurrent haskell with futures.
Software Engineering (Workshops)
David Sabel
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ß
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
2010 J jnl
Closures of may-, should- and must-convergences for contextual equivalence.
Inf. Process. Lett.
Manfred Schmidt-Schauß, David Sabel
2010 J jnl
On generic context lemmas for higher-order calculi with sharing.
Theor. Comput. Sci.
Manfred Schmidt-Schauß, David Sabel
2010 — conf
Simulation in the Call-by-Need Lambda-Calculus with letrec.
RTA
Manfred Schmidt-Schauß, David Sabel, Elena Machkasova
2009 — conf
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi.
GI Jahrestagung
David Sabel, Manfred Schmidt-Schauß, Frederik Harwath
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 J jnl
Safety of Nöcker's strictness analysis.
J. Funct. Program.
Manfred Schmidt-Schauß, David Sabel, Marko Schütz
2008 — book
Semantics of a call-by-need lambda calculus with McCarthy's amb for programm equivalence.
David Sabel
2008 — ch.
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].
Ausgezeichnete Informatikdissertationen
David Sabel
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