Euler Institute for Discrete Mathematics and its Applications (EIDMA): 5-day minicourse

minicourses
1 ECTS

5-day minicourse on

Lambda Calculus and Term Rewriting Systems

Eindhoven, February 16 - 20, 2009

Prof. Jan Willem Klop
Emeritus Professor of Applied Logics
at the VU Amsterdam

Prof. Henk Barendregt
Radboud University,
Nijmegen

Prof. Jan Willem Klop is since 2007 emeritus Professor of Applied Logic at the VU University Amsterdam. He received his PhD at Utrecht University in 1980 on the thesis Combinatory Reduction Systems. Since 1980 he was employed by CWI Amsterdam (Centre of Mathematics and Computer Science), initially involved with research in process algebra, later leading a research theme on term rewriting systems. Since 1987 this activity was combined with the VU University Amsterdam, and from 1998 until 2008 with a guest research position at the Radboud University Nijmegen in the Foundations group of Henk Barendregt. Jan Willem Klop is currently fellow of CWI Amsterdam, holds a honorary doctorate at the University of East-Anglia, and is member of the dutch Royal Academy (KNAW).

Prof. Henk Barendregt holds the chair of Foundations of Mathematics and Computer Science at Radboud University, Nijmegen. He received his PhD in 1971 at Utrecht University on a thesis on lambda calculus. His work "The Lambda Calculus, its Syntax and Semantics" has been translated into Russian and Chinese. Barendregt received the Spinoza prize of the Netherlands Science Foundation (NWO) in 2003 and is member of the Royal Academy of Science.

Contents
Lambda Calculus and Combinatory Logic were instrumental in codifying the fundamental notion of computability, in the days of Gödel, Church, Kleene and Turing. Later on, these formal systems became the heart of functional programming. Typed lambda calculus, with the famous Curry- Howard-de Bruijn isomorphism, became the source of applications in the realm of correcness of software, assisted by proof assistants and theorem provers. At a parallel track, term rewriting systems emerged, of which Lambda Calculus and Combinatory Logic are prominent examples. The development along this line was intertwined with the emergence of the theory of abstract data types. Recently, infinitary versions of both lambda calculus and term rewriting are studied.
This course aims to give an introduction in the theory, in the following five chapters:
1. Pure lambda calculus. 2. First order term rewriting. 3. Typed lambda calculus. 4. Higher order rewriting. 5. Infinitary lambda calculus and infinitary term rewriting.

Time and Place
Technische Universiteit Eindhoven, The Netherlands
February 16 - 20, 2009.

Admission fee
The admission fee for a minicourse is EUR 300 for university staff members and PhD students, and EUR 500 for people from industry. EIDMA and DIAMANT members receive a reduction of EUR 100 on these amounts. Registered Dutch EIDMA PhD students may attend free of charge. DIAMANT offers limited extra support for its members. Young mathematicians get priority, but otherwise the "first come, first serve" principle applies. To apply for this additional DIAMANT support please follow the instructions on the registration form. For undergraduate students special conditions apply.

Registration
Registration is closed.

Back to the course program