Misc / Verschiedenes

• Theses:
• Habilitation thesis: Korrektheit von Programmen und Programmiersprachen - Methoden, Analysen und Anwendungen (2013).
• Dissertation: Semantics of a Call-by-Need Lambda Calculus with McCarthy's amb for Program Equivalence (2008).
  (Published by Verlag Dr. Hut with ISBN 978-3-89963-866-0.)
• Diploma thesis: Realisierung der Ein-/Ausgabe in einem Compiler für Haskell bei Verwendung einer nichtdeterministischen Semantik (2003)
• Modification of the Glasgow Haskell Compiler:
• Project DIAMOND
• Drafts:
  • Implementing Futures in Concurrent Haskell (working draft, January 28, 2009)
• Rewriting Techniques for Correctness of Program Transformations
  • This course was held as part of ISR 2015: International School on Rewriting in Leipzig, Germany, August, 2015.
  • Lecture notes, presentation slides, and further material is available from: http://www.ki.informatik.uni-frankfurt.de/events/isr15/.
• Introduction to Programming and Problem Solving in Haskell.
  • This course was held as part of the Lehrerbildungsforum Informatik in Frankfurt, September, 2015.
  • Presentation slides and further material is available from: http://www.ki.informatik.uni-frankfurt.de/events/lbfi15/.
• Some Slides
  • Slides of the talk at MFPS XXIII: 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007, New Orleans, USA, 12/April/2007:
    Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
  • Slides of the talk at Kolloquium des Instituts für Informatik, Goethe University, Frankfurt, Germany, 19/August/2008:
    Semantics of a Call-by-Need Lambda Calculus with McCarthy's amb for Program Equivalence
  • Slides of my disputation, 30/October/2008:
    Semantics of a Call-by-Need Lambda Calculus with McCarthy's amb for Program Equivalence
  • Sildes of the talk at 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
  • Sildes of the talk at ATPS'09: 4. Arbeitstagung Programmiersprachen 2009, 1/October/2009, Lübeck, Germany:
    Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
  • Slides of the talk at LogInf-16: 16. Jahrestagung der GI-Fachgruppe Logik in der Informatik, Frankfurt am Main, Germany, 6-7/November/2009:
    Proof Methods for Polymorphically Typed Contextual Equivalence
  • Slides of the talk at 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming PPDP 2011, Odense, Denmark, 21/July/2011:
    A Contextual Semantics for Concurrent Haskell with Futures
  • Slides of the talk at FroCoS 2011: 8th International Symposium Frontiers of Combining Systems, Saarbrücken, Germany, 06/October/2011:
    Congruence Closure of Compressed Terms in Polynomial Time
  • Slides of the talk at ATPS 12: 5.Arbeitstagung Programmiersprachen, Berlin, Germany, 27/February/2012:
    An Abstract Machine for Concurrent Haskell with Futures
  • Slides of the talk at LICS 2012: 27th ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia, 25/June/2012:
    Conservative Concurrency in Haskell
  • Slides of the talk at Kolloquium des Instituts für Informatik, Goethe University, Frankfurt, Germany, 13/November/2012:
    Korrektheit von Programmen und Programmiersprachen
  • Slides of my habilitation colloquium, Goethe University, Frankfurt, Germany, 10/June/2013:
    Lock-freies nebenläufiges Programmieren durch Software Transactional Memory
  • Slides of the talk at RTA 2013: 24th International Conference on Rewriting Techniques and Applications, Eindhoven, The Netherlands, 26/June/2013
    Algorithms for Extended Alpha-Equivalence and Complexity
  • Slides of my inaugural lecture for my habilitation, Goethe University, Frankfurt, Germany, 16/July/2013:
    Qualitatives zeitliches Schließen: "Intelligentes Kuchenbacken".
    The web-interface for Allen's interval logic can be found here
  • Slides of the talk at ICFP 2013: The 18th ACM SIGPLAN International Conference on Functional Programming, Boston, MA, USA, 26/September/2013
    Correctness of an STM Haskell Implementation
  • Slides of the talk at Kolloquium Mathematische Informatik, Goethe University, Frankfurt, Germany, 21/January/2014:
    The pi-Calculus with Stop
  • Slides of the talk at ATPS 14: 7.Arbeitstagung Programmiersprachen, Kiel, Germany, 26/February/2014:
    A Haskell-Implementation of STM Haskell with Early Conflict Detection
  • Slides of the talk at 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:
    Structural Rewriting in the pi-Calculus
  • Slides of the talk at 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:
    Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB
  • Slides of the talk at RTA 2015: 26th International Conference on Rewriting Techniques and Applications, Warsaw, Poland, 29/June/2015:
    Transforming Cycle Rewriting into String Rewriting
  • Slides of the talk at WPTE 2015: Second International Workshop on Rewriting Techniques for Program Transformations and Evaluation affiliated with RDP 2015, Warsaw, Poland, 2/July/2015:
    Observing Success in the Pi-Calculus
  • Slides of the talk at IFL 2015: 27th International Symposium on Implementation and Application of Functional Languages, Koblenz, Germany, 14/September/2015:
    Sharing-Aware Improvements in a Call-by-Need Functional Core Language
  • Slides of the talk at ATPS 2016: Arbeitstagung Programmiersprachen 2016 Vienna, Austria, 26/February/2016:
    A Call-by-Need Lambda Calculus with Scoped Work Decorations