INVITED LECTURERS

In addition to the standard material, there will be two invited lecturers who will develop the following related topics:

- Florent Garnier (Verimag) : probabilistic automata (curriculum can be found here)
- Polyvios Pratikakis (Verimag) : lambda calculus and type theory (curriculum can be found here)

A course syllabus can be found here (postscript).

Lecture notes are available here (postscript).

IMPORTANT: All lectures will be held in english.

Slides for the lectures are available here (PDF):

- Lecture 1
- Lecture 2
- Lecture 3
- Lecture 4
- Lecture 5
- Lecture on Probabilistic Automata
- Lecture on Lambda Calculus
- Lecture on Type Systems

- Logic and Automata
- W. Thomas. Handbook of Theoretical Computer Science, Volume B, Chapter 4. Automata on Infinite Objects pages 135-164
- B. Khoussainov and A. Nerode. Automata Theory and its Applications ISBN 0-8176-4207-2
- Tree Automata Techniques and Applications Collective Online Book
- Probabilistic Automata
- R.G. Bukharaev. Probabilistic Automata
- C. Baier, M. Grosser. Recognizing omega-regular languages with probabilistic automata
- Lambda Calculus and Type Systems
- B. C. Pierce. Types and Programming Languages. MIT Press 2002
- H. Barendregt. Lambda Calculi with Types. Handbook of Logic in Computer Science. pages 117--309
- P. Wadler. Proofs are Programs: 19th Century Logic and 21st Century Computing
- M. Heine et al. Lectures
on the Curry-Howard Isomorphism

For additional questions please contact the instructor: radu_._iosif_@_imag_._fr (please remove the _'s)