I am glad that Manfred introduced me to functional programming. Right now I am doing some work on statical analysis of functional programs. This combines nicely my knowledge of automated theorem proving with functional programming.

My official bibliography

Some recent papers and drafts are:

• Panitz, S. E., Schmidt-Schauß, M.,
  TEA: Automatically proving termination of programs in a non-strict higher-order functional language,
  Proc. of the Static Analysis Symposium, LNCS 1???, Springer-Verlag, pp. ?-?, (1997)

• Schmidt-Schauß, M., Panitz, S. E.,
  Proving Termination of Higher-Order Functional Programs with a Tableau-like Calculus,
  Position paper presented at the Tableaux '97

• S. E. Panitz
  "Tinte: developing a prototype for typesetting music in Clean -- a case study"

  description of the implementation of an typesetting program for classical guitar music in Concurrent Clean. Some example music typeset with this system can be found here.

• S. E. Panitz,M. Schmidt-Schauß
  "TEA: A system for proving termination of a non-strict higher-order functional language"

  description of the fully automatic termination analyzer TEA

• M. Schmidt-Schauß, S. E. Panitz, M. Schütz:
  "Strictness Analysis by Abstract Reduction Using a Tableau Calculus"

  presented at the Statical Analysis Symposium 1995 in Glasgow.

• S. E. Panitz:
  "Termination Poofs for a Lazy Functional Language by Abstract Reduction"
  

  Technical Report Frank 06

• S. E. Panitz:
  "Theorem Proving in a Russian Room and in Haskell"

  draft

• S. E. Panitz:
  "Default Reasoning with a Constraint Resolution Principle"

  presented at the LPAR 1993 in St. Petersburg.

• S. E. Panitz:
  Non-strict higher-order functional programming in Prolog (DRAFT)

• S. E. Panitz:
  "Abstract Reduction in Logical Form"

  draft, which certainly needs a bit more polishing.

• S. E. Panitz:
  "Abstract Reduction Proofs for Local Semantical Predicates"

  draft, which certainly needs a bit more than just polishing.

You might also be interested in some material which has been written for courses in functional programming. But be warned it is full of smaller mistakes and I will not enhance it until the corresponding courses are being held again. Do also not be surprised to find it in German.

• Parsen für Programmierlaien (dvi) (postscript)
• Eine Führung durch Monaden für junge Anwender(dvi) (postscript)
• Eliza in Haskell (postscript)
• Kurzeinführung in Caml Light
• abstrakte Interpretation zur Stricktheitsanalyse
• Praktikum: funktionales Programmieren

• Natural Language Queries about the Solar System
• Core-Fp Interpreter