3. Talks

T56 IFIP WG 2.8 meeting (Nesjavellir). NEW
Closed and Open Recursion (1 slide per page: 168K PDF).
T55 Central European Functional Programming School, CEFP2007. NEW
Generic Programming, Now! (1 slide per page: 559K PDF). NB. This is a revised version of the talk T49.
T54 Oxford University, Computing Laboratory. NEW
Foundations of Object-Oriented Programming. (1 slide per page: 251K PDF)
T53 Universität Greifswald. NEW
Objektorientierung - Schritt für Schritt. (1 slide per page: 347K PDF)
T52 IFIP WG 2.1 meeting (Namur). NEW
Growing an Object-oriented Language. (1 slide per page: 264K PDF, accompanying material: Account.bpl/Account.his, an interpreter for the language can be downloaded here)
T51 Fachbereich Mathematik und Informatik der Philipps-Universität Marburg. NEW
Embedding Generic Programming into Haskell. (1 slide per page: 252K PDF)
T50 MPC 2006. NEW
"Scrap Your Boilerplate" Revolutions. (1 slide per page: 180K PDF)
T49 Spring School on Datatype-Generic Programming. NEW
Generic Programming, Now! (1 slide per page: 555K PDF)
T48 Fachbereich Informatik, Universität Koblenz.
Verträge für die funktionale Programmierung - Design und Implementierung. (1 slide per page: 154K PDF)
T47 Fachbereich Informatik, Universität Koblenz.
Fehlerbehandlung in Programmiersystemen. (1 slide per page: 131K PDF)
T46 Institut für Informatik, Universität Innsbruck.
Verträge für die funktionale Programmierung - Design und Implementierung. (1 slide per page: 154K PDF)
T45 IFIP WG 2.8 meeting (Kalvi Manor, Estonia).
Generic grouping and sorting. (1 slide per page: 89K PDF)
T44 Informatik 2005 - Informatik LIVE! 35. Jahrestagung der Gesellschaft für Informatik, Tag der Schule.
Rechnen und rechnen lassen. (1 slide per page: 714K PDF)
T43 Workshop on Datatype-Generic Programming 2005.
An algebra of contracts. (1 slide per page: 171K PDF)
T42 Institut für Informatik, Universität Osnabrück.
Generic programming - Or: write everything once. (1 slide per page: 212K PDF)
T41 Institut für Informatik, Universität Osnabrück.
Warum Programme Verträge schließen sollten. (1 slide per page: 130K PDF)
T40 BCTCS 2005, University of Nottingham, UK.
Number Systems and Data Structures. (1 slide per page: 386K PDF)
T39 Institut für Informatik Freiburg.
A Simple Implementation Technique for Priority Search Queues. See P14.
T38 Oxford University, Computing Laboratory, Departmental Seminar.
Finger trees: The swiss army knife of data structures. See X1. (1 slide per page: 183K PDF)
T37 ICFP 2004.
Generics for the masses. See P21 and accompanying material. (1 slide per page: 168K PDF)
T36 DMV-Tagung 2004.
Generic data types - Or: Know your school math. (1 slide per page: 180K PDF)
T35 MPC 2004.
An algebra of scans. See P20. (1 slide per page: 1,9M PDF)
T34 Workshop on Datatype-Generic Programming.
Typed Type Representations. (1 slide per page: 127K PDF)
T33 The Fun of Programming, A symposium in honour of Professor Richard Bird's 60th birthday.
Fun with phantom types. See B4. (1 slide per page: 187K PDF)
T32 MPC 2002.
Constructing tournament representations: An exercise in pointwise relational programming. See P16. (143K PDF, 1 slide per page: 203K gzipped postscript, 4 slides per page: 206K gzipped postscript)
T31 Tracing Fest, York and IFIP WG 2.8 meeting (Las Vegas).
Bootstrapping One-sided Flexible Arrays. (126K PDF, 1 slide per page: 85K gzipped postscript, 4 slides per page: 86K gzipped postscript)
T30 ST meeting.
Frown - An LALR(k) Parser Generator. (129K PDF, 1 slide per page: 86K gzipped postscript, 4 slides per page: 87K gzipped postscript)
T29 IFIP WG 2.1 meeting (Ameland)
The Derivative of a Functor. (90K PDF, 1 slide per page: 63K gzipped postscript, 4 slides per page: 64K gzipped postscript)
T28 ICFP 2001.
A Simple Implementation Technique for Priority Search Queues. See P14. (398K PDF, 1 slide per page: 1455K gzipped postscript, 4 slides per page: 1457K gzipped postscript)
T27 Workshop on Generic Programming and IFIP WG 2.1 meeting (Ameland).
Functorial Unparsing. (105K PDF, 1 slide per page: 72K gzipped postscript, 4 slides per page: 73K gzipped postscript).
T26 Antrittsvorlesung (inaugural lecture).
Über das ästhetische Zeichnen von Bäumen. (1278K PDF, 1 slide per page: 1781K gzipped postscript, 4 slides per page: 1784K gzipped postscript).
T25 IPA Basic Course Software Technology 2001.
Functional Data Structures - The challenge and beauty of purity. (596K PDF, 1 slide per page: 727K gzipped postscript, 4 slides per page: 728K gzipped postscript, Exercises: 23K gzipped postscript).
T24 Generic Haskell meeting.
Haskell does it with class. (136K PDF, 1 slide per page: 84K gzipped postscript, 4 slides per page: 85K gzipped postscript, accompanying material [requires `ghci']).
T23 Computing Science Department Nijmegen Colloquium.
Polytypic Programming - Or: Programming Language Theory is Helpful. (117K PDF, 1 slide per page: 83K gzipped postscript, 4 slides per page: 84K gzipped postscript).
T22 IFIP WG 2.8 meeting (Åre).
A Simple Implementation Technique for Priority Search Queues. (940K PDF, 1 slide per page: 930K gzipped postscript, 4 slides per page: 931K gzipped postscript). NB. This is a slightly revised version of the talk T20.
T21 GIBU Jahrestreffen 2001.
Datenstrukturen und Zahlensysteme. (130K PDF, 1 slide per page: 83K gzipped postscript, 4 slides per page: 84K gzipped postscript)
T20 ST meeting.
A Simple Implementation Technique for Priority Search Queues. (528K PDF, 1 slide per page: 660K gzipped postscript, 4 slides per page: 661K gzipped postscript)
T19 Habilitationsvortrag.
Konstruktion von Rot-schwarz Bäumen. (132K PDF, 1 slide per page: 79K gzipped postscript, 4 slides per page: 79K gzipped postscript)
T18 Generic Haskell - Kick off days.
Generic Proofs. (1 slide per page: 64K gzipped postscript, 4 slides per page: 65K gzipped postscript)
T17 Kolloquium Informatik.
Generische Programmierung - Eine Anwendung: digitale Suchbäume. (1 slide per page: 85K gzipped postscript, 4 slides per page: 86K gzipped postscript)
T16 ICFP 2000.
Deriving Backtracking Monad Transformers - Functional Pearl. See P12. (1 slide per page: 60K gzipped postscript, 4 slides per page: 61K gzipped postscript)
T15 Haskell Workshop 2000.
Derivable Type Classes. See P13. (1 slide per page: 61K gzipped postscript, 4 slides per page: 62K gzipped postscript)
T14 WGP 2000.
Memo functions, polytypically!. See P11. (1 slide per page: 56K gzipped postscript, 4 slides per page: 58K gzipped postscript)
T13 WGP 2000.
Efficient Generalized Folds. See P10. (1 slide per page: 50K gzipped postscript, 4 slides per page: 51K gzipped postscript)
T12 MPC 2000.
Polytypic values possess polykinded types. See P9. (1 slide per page: 61K gzipped postscript, 4 slides per page: 62K gzipped postscript)
T11 IFIP WG 2.1 meeting (Blackheath).
Making generic programming more generic. (1 slide per page: 65K gzipped postscript, 4 slides per page: 66K gzipped postscript)
T10 POPL '00.
A New Approach to Generic Functional Programming. See P8. (1 slide per page: 68K gzipped postscript, 4 slides per page: 69K gzipped postscript)
T9 Universität Leipzig, Institut für Informatik, Theorie-Seminar.
Constructing Red-Black Trees, NB. This talk is an extended version of T6. (1 slide per page: 133K gzipped postscript, 4 slides per page: 132K gzipped postscript)
T8 FLOPS'99.
Polytypic Programming with Ease (Extended Abstract). See P7. (1 slide per page: 116K gzipped postscript, 4 slides per page: 117K gzipped postscript)
T7 Haskell 99 Workshop.
A Generic Programming Extension for Haskell. See P6. (1 slide per page: 77K gzipped postscript, 4 slides per page: 78K gzipped postscript)
T6 WAAAPL'99.
Constructing Red-Black Trees. See P5. (1 slide per page: 103K gzipped postscript, 4 slides per page: 103K gzipped postscript)
T5 WAAAPL'99.
Manufacturing Datatypes. See P4. (1 slide per page: 93K gzipped postscript, 4 slides per page: 94K gzipped postscript)
T4 IFIP WG 2.8 meeting (Saint-Malo).
A new approach to generic functional programming. See R12. (1 slide per page: 130K gzipped postscript, 4 slides per page: 130K gzipped postscript)
T3 IFIP WG 2.8 meeting (Recife) and IFIP WG 2.1 meeting (Potsdam).
Tries, polytypically! See R4. (1 slide per page: 74K gzipped postscript, 4 slides per page: 75K gzipped postscript)
T2 CLaPF'99 (Recife).
Polytypic Functions Over Nested Datatypes. See P2. (1 slide per page: 49K gzipped postscript, 4 slides per page: 50K gzipped postscript)
T1 Component-based Programming under Different Paradigms (Dagstuhl Seminar).
A simple approach to generic functional programming. February, 1999. (1 slide per page: 93K gzipped postscript, 4 slides per page: 94K gzipped postscript)

Ralf Hinze, Ralf.Hinze@comlab.ox.ac.uk, 2nd November 2007.

Valid HTML 4.01!