David Sabel

Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus
PPDP 2022: 24th International Symposium on Principles and Practice of Declarative Programming , Tbilisi, Georgia and Virtual, 22/September/2022
Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language
WPTE 2022: 9th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, Haifa, Israel, 31/July/2022

Minimal Translations from Synchronous Communication to Synchronizing Locks
EXPRESS/SOS 2021: Combined 28th International Workshop on Expressiveness in Concurrency and 18th Workshop on Structural Operational Semantics, Paris, France, held online, 23/August/2021

Correctly Implementing Synchronous Message Passing in the Pi-Calculus by Concurrent Haskell's MVars.
EXPRESS/SOS 2020: Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics , Vienna, Austria, held online, 31/August/2020, talk on Youtube

On Impossibility of Simple Modular Translations of Concurrent Calculi.
WPTE 2020:7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, Paris, France, held online, 29/June/2020, talk on Youtube

On Impossibility of Simple Modular Translations of Concurrent Calculi.
Colloquium of the TCS group, LMU, Munich, Germany, 26/June/2020

Encoding the pi-Calculus into Concurrent Haskell.
Colloquium of the TCS group, LMU, Munich, Germany, 18/January/2019

Automating the Diagram Method to Prove Correctness of Program Transformations.
WPTE 2018: Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation , Oxford, UK, 08/July/2018
Correctness of Program Transformations: Automating Diagram-Based Proofs.
Colloquium of the TCS group, LMU, Munich, Germany, 29/May/2018

Alpha-Renaming of Higher-Order Meta-Expressions.
PPDP 2017: 19th International Symposium on Principles and Practice of Declarative Programming , Namur, Belgium, 11/October/2017
Matching of Meta-Expressions with Recursive Bindings.
UNIF 2017: 31st International Workshop on Unification, Oxford, UK, 03/September/2017

Unification of Program Expressions with Recursive Bindings.
PPDP 2016: 18th International Symposium on Principles and Practice of Declarative Programming , Edinburgh, Scotland, UK, 07/September/2016
A Call-by-Need Lambda Calculus with Scoped Work Decorations.
ATPS 2016: 9. Arbeitstagung Programmiersprachen, Vienna, Austria, 26/February/2016.

Einführung in die Programmierung und das Problemlösen in Haskell.
Lehrbildungsforum Informatik, Frankfurt, Germany, 29/September/2015
Sharing-Aware Improvements in a Call-by-Need Functional Core Language.
IFL 2015: 27th International Symposium on Implementation and Application of Functional Languages, Koblenz, Germany, 14/September/2015.
Rewriting Techniques for Correctness of Program Transformations.
ISR 2015: International School on Rewriting, Leipzig, Germany, 13+14/August/2015
Observing Success in the Pi-Calculus.
WPTE 2015: Second International Workshop on Rewriting Techniques for Program Transformations and Evaluation affiliated with RDP 2015, Warsaw, Poland, 2/July/2015.
Transforming Cycle Rewriting into String Rewriting.
RTA 2015: 26th International Conference on Rewriting Techniques and Applications, Warsaw, Poland, 29/June/2015.

Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB.
RTA/TLCA 2014: Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications, Vienna Summer of Logic 2014, Vienna, Austria, 14/July/2014.
Structural Rewriting in the pi-Calculus.
WPTE 14: First International Workshop on Rewriting Techniques for Program Transformations and Evaluation affiliated with RTA/TLCA 2014, Vienna Summer of Logic 2014, Vienna, Austria, 13/July/2014.
A Haskell-Implementation of STM Haskell with Early Conflict Detection.
ATPS 14: 7. Arbeitstagung Programmiersprachen, Kiel, Germany, 26/February/2014.
The pi-Calculus with Stop.
Kolloquium Mathematische Informatik, Goethe University, Frankfurt, Germany, 21/January/2014.

Correctness of an STM Haskell Implementation.
ICFP 2013: The 18th ACM SIGPLAN International Conference on Functional Programming, Boston, MA, USA, 26/September/2013.
Qualitatives zeitliches Schließen: "Intelligentes Kuchenbacken".
Inaugural lecture for my habilitation, Goethe University, Frankfurt, Germany, 16/July/2013:
Algorithms for Extended Alpha-Equivalence and Complexity.
RTA 2013: 24th International Conference on Rewriting Techniques and Applications, Eindhoven, The Netherlands, 26/June/2013.
Lock-freies nebenläufiges Programmieren durch Software Transactional Memory.
Habilitation colloquium, Goethe University, Frankfurt, Germany, 10/June/2013.

Korrektheit von Programmen und Programmiersprachen.
Kolloquium des Instituts für Informatik, Goethe University, Frankfurt, Germany, 13/November/2012.
Conservative Concurrency in Haskell.
LICS 2012: 27th ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia, 25/June/2012.
An Abstract Machine for Concurrent Haskell with Futures.
ATPS 12: 5.Arbeitstagung Programmiersprachen, Berlin, Germany, 27/February/2012.

Congruence Closure of Compressed Terms in Polynomial Time.
FroCoS 2011: 8th International Symposium Frontiers of Combining Systems, Saarbrücken, Germany, 06/October/2011.
A Contextual Semantics for Concurrent Haskell with Futures.
PPDP 2011: 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, Odense, Denmark, 21/July/2011.

Proof Methods for Polymorphically Typed Contextual Equivalence.
LogInf-16: 16. Jahrestagung der GI-Fachgruppe Logik in der Informatik, Frankfurt am Main, Germany, 6-7/November/2009.
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi.
ATPS'09: 4. Arbeitstagung Programmiersprachen 2009, 1/October/2009, Lübeck, Germany
Semantics of a Call-by-Need Lambda Calculus with McCarthy's amb for Program Equivalence.
Kolloqium zum GI-Preis 2008, 20/May/2009, Dagstuhl, Germany.

Semantics of a Call-by-Need Lambda Calculus with McCarthy's amb for Program Equivalence.
Disputation, Goethe-University, Frankfurt, Germany, 30/October/2008.
Semantics of a Call-by-Need Lambda Calculus with McCarthy's amb for Program Equivalence.
Kolloquium des Instituts für Informatik, Goethe University, Frankfurt, Germany, 19/August/2008.

Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures.
MFPS XXIII: 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007, New Orleans, USA, 12/April/2007.

(c) David Sabel, Legal notice | Privacy Policy