Fortgeschrittene Funktionale Programmierung, Wintersemester 2011/12
Für die entsprechende Vorlesung im Wintersemester 2015/16, siehe hier.
Einträge im Vorlesungsverzeichnis:
Voraussetzung:
Gastvorlesungen:
- Joachim Breitner zum Thema "Performance-Tuning in Haskell"
- Axel Simon zum Thema "Deriving a Type Inference for Hindley Milner that Delivers Best Types (aka Principal Typings)"
- Andres Löh zum Thema "Deterministic Parallel Programming in Haskell"
Literatur / zum Weiterlesen:
- Why Functional Programming Matters, article by John Hughes
- Using Circular Programs to Eliminate Multiple Traversals of Data, article by Richard Bird (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- Haskell-Wiki, zur Verwendung von seq
- Algebraic Dynamic Programming homepage (Uni Bielefeld)
- Monads for functional programming, tutorial by Philip Wadler (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- State in Haskell, article by John Launchbury and Simon Peyton Jones (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- Beauty in the Beast: A Functional Semantics for the Awkward Squad, article by Wouter Swierstra and Thorsten Altenkirch (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- Towards a theory of type structure, article by John Reynolds (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- Types, Abstraction and Parametric Polymorphism, article by John Reynolds
- Theorems for Free!, article by Philip Wadler (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- Logical Abstractions in Haskell, article by Nancy A. Day et al.
- Much Ado about Two: A Pearl on Parallel Prefix Computation, article by Janis Voigtländer (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- Functional and dynamic programming in the design of parallel prefix networks, article by Mary Sheeran
- Free Theorems in the Presence of seq, article by Patricia Johann and Janis Voigtländer (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- Parametricity and Unboxing with Unpointed Types, article by John Launchbury and Ross Paterson (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
- Automatically Generating Counterexamples to Naive Free Theorems, article by Daniel Seidel and Janis Voigtländer (wenn in Uni-Netz eingeloggt, kostenfrei aufrufbar)
Referenzen:
Online-Ressourcen:
- Haskell homepage
- Functional Programming Fundamentals, online lectures by Erik Meijer (based on Graham Hutton's book): chapter 1, chapter 2, chapter 3, chapter 4, chapter 5, chapter 6, chapter 7, chapter 8, chapter 9, chapter 10, chapter 11, chapter 12, chapter 13
- Advanced Functional Programming, online lectures by Ralf Lämmel: lecture 1, lecture 2, lecture 3, lecture 4, lecture 5
- Real World Haskell, book by Bryan O'Sullivan, Don Stewart, and John Goerzen, freely available online
- Haskell Kurs, deutsch, von Ralf Hinze
- Automatic generation of free theorems, our online generator (implementation described here)
- Automatically Generating Counterexamples to Naive Free Theorems, web interface to the tool described in the article of same name
Zuletzt geändert: März 2012, Janis Voigtlaender.