1. Vorbesprechung: Di 22.07.2003, 16:15 Uhr
Es sind noch Themen zu vergeben (siehe unten).

2. Vorbesprechung: Di 21.10.2003, 16:15 Uhr, HS III (Multimediaraum), Lahnberge

1. Co-Induktion und schwache Bisimularität für While-Programme
   18.11.2003, Ivo Pacák
   Literatur:
   • J.J.M.M. Rutten A note on coinduction and weak bisimilarity for while programs. Technical Report SEN-R9826, CWI, Amsterdam, 1998. Appeared also in Theoretical Informatics and Applications (RAIRO) Vol. 33, 1999, pp. 393-400
2. Automaten und Co-Induktion
   25.11.2003, Olga Andriyenko
   Literatur:
   • J.J.M.M. Rutten: Automata and coinduction (an exercise in coalgebra). Technical Report SEN-R9803, CWI, Amsterdam, 1998. Also in: Proceedings of CONCUR '98, D. Sangiorigi and R. de Simone (eds.), LNCS 1466, Springer, 1998, pp. 194-218.
3. Ein coalgebraischer Kalkül von Strömen und Anwendungen 1
   2.12.2003, Christian Stump
   Literatur:
   • J.J.M.M. Rutten: Elements of stream calculus (an extensive exercise in coinduction). Technical Report SEN-R0120, CWI, Amsterdam, 2001, pp. 1--54.
4. Ein coalgebraischer Kalkül von Strömen und Anwendungen 2
   9.12.2003, Daniel Djawadi
   Literatur:
   • J.J.M.M. Rutten: Coinductive counting with weighted automata, Technical Report SEN-R0224, CWI, Amsterdam, 2002, pp. 1--30.
5. Automatic skeletons in Template Haskell
   16.12.2003, Dr. Kevin Hammond, University of St. Andrews, UK
   Literatur:
   • K. Hammond, J. Berthold, R. Loogen: Automatic skeletons in Template Haskell, International Workshop on High-Level Parallel Programming and Applications (HLPP) 2003
6. Beweismethoden für co-rekursive Programme
   13.1.2004, Sylvia Pott
   Literatur:
   • Jeremy Gibbons and Graham Hutton (2000). Proof Methods for Corecursive Programs. Submitted for publication, October 2000.
   • Graham Hutton and Jeremy Gibbons (2000). The Generic Approximation Lemma. Information Processing Letters 79(4) p197-201, August 2001.
7. Funktionale Programmierung mit Rekursionsoperatoren
   20.1.2004, Valeri Kuznecov
   Literatur:
   • Erik Meijer, Maarten Fokkinga, Ross Patterson: Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire, ACM Conference on Functional Programming and Computer Architecture 1991.
   • Erik Meijer and Graham Hutton. Bananas in Space: Extending fold and unfold to Exponential Types. In Proc. ACM Conference on Functional Programming and Computer Architecture (FPCA) 1995.
   • Erik Meijer and Johan Jeuring. Merging Maps and Folds for Functional Programming. LNCS 925, 1995.
8. Generische funktionale Programmierung 1
   27.1.2004, Shaojie Hu
   Literatur:
   • Ralf Hinze. A new approach to generic functional programming. Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. January 2000.
   • Ralf Hinze and Simon Peyton Jones. Derivable Type Classes. In Graham Hutton, editor. Proceedings of the 2000 ACM SIGPLAN Haskell Workshop, Montreal, Canada, September 17, 2000. Volume 41.1 of Electronic Notes in Theoretical Computer Science, Elsevier Science, August 2001.
   • R. Hinze and J. Jeuring. Generic Haskell: Practice and Theory. To appear in the lecture notes of the Summer School on Generic Programming, LNCS © Springer-Verlag, 2003.
     siehe auch: Generisches Haskell
9. Generische funktionale Programmierung 2
   3.2.2004, Johannes Juch
   Literatur:
   • T. Sheard, S. Peyton Jones. Template Meta-programming for Haskell Submitted to the Haskell Workshop 2002.
   • I. Lynagh. Template Haskell: A Report From The Field Unpublished.
10. Generische funktionale Programmierung 3
    10.2.2004, Jan Eric Schmidt
    Literatur:
    • R. Lämmel, E. Visser, J. Visser. The Essence of Strategic Programming Ongoing Work
    • R. Lämmel, J. Visser. Design Patterns for Functional Strategic Programming In Proceedings of Third ACM SIGPLAN Workshop on Rule-Based Programming RULE'02, Pittsburgh, USA, October 2002. ACM Press.
    • R. Lämmel, S. Peyton Jones. Scrap Your Boilerplate: A Practical Design Pattern for Generic Programming In Proceedings of ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI 2003), New Orleans, Jan 2003.
11. Coalgebraische Spezifikation und Verifikation
    17.2.2004, Eugen Walter
    Literatur:
    • B. Jacobs: Exercises in Coalgebraic Specification In: R. Backhouse, R. Crole and J. Gibbons (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction Exercises in Coalgebraic Specification, (Springer LNCS 2297, 2002), p.237-280. (Manuscript for the proceedings of the Mathematics for Information Technology summer school, Oxford, 10-14 April 2000.)
    • U. Hensel and B. Jacobs: Coalgebraic Theories of Sequences in PVS. Journal of Logic and Computation 9(4), 1999, p.463-500.
    • F. Bartels: Verfeinerung von Zustandsübergangssystemen. Diplomarbeit, Universität Ulm, 1999.