Essentials of Programming Languages

Grundlagen von Programmiersprachen/ Essentials of Programming Languages

General

Lecturer	Prof. Dr. Peter Thiemann
Assistant	Matthias Keil
Lecture	Monday, 2pm - 4pm, SR 00-007, Building 106
	Friday, 2pm - 4pm, SR 00-007, Building 106
Exercise	Friday, 3pm - 4pm, SR 00-007, Building 106

News

There will be no lecture on 06.07.2015 and on 10.07.2015.

There will be no lecture on 18.06.2015. The exercise starts at 2pm.

There will be no lecture on 15.06.2015.

Classes

Date	Topics	Material
20.04.2015	Introduction: syntax, abstract syntax, semantics styles	PFPL 1.1, 5.1; Script 1
24.04.2015	Operational semantics, inductive definitions	PFPL 2, 5.2; Script Def 9
04.05.2015	Big step vs small step, binding and scope, environments	PFPL 7.1, 7.2; Script 4
08.05.2015	Statics - Simple types	PFPL 4, 6; Script 10.1, 10.3
11.05.2015	Functions, static/dynamic scope, strong normalization	PFPL 8; Script 7.4 (static/dynamic scope); strong normalization of STLC
15.05.2015	Functions, System T	PFPL 8, 9.[1-3]; Script 10.1, 10.3
18.05.2015	PCF	PFPL 10
01.06.2015	There is a total PCF-computable function that cannot be programmed in System T	proof sketch
01.06.2015	Finite Data Types: products, sums	PFPL 12
05.06.2015	Pattern matching, Generic Programming	PFPL 13.[1-3], 14
08.06.2015	Inductive and Coinductive Types	PFPL 15
22.06.2015	Generic Programming	Addendum: Generic.agda (This code is written in Agda.)
22.06.2015	Recursive Types	PFPL 16.[12]
26.06.2015	Dynamic Types: the untyped lambda calculus	PFPL 17, Script 9.1-9.2
29.06.2015	Scott's theorem	PFPL 17.3
03.07.2015	Equalities on lambda terms, De Bruijn indexes, results about lambda terms	Note on equalities, De Bruin Index, Script 9.2
13.07.2015	Blame and Coercion:Together Again for the First Time	Addendum: paper
17.07.2015	Pomega: A denotational model for the untyped lambda calculus	See H.P. Barendregt (1985). The Lambda Calculus, Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics 103. Amsterdam: North-Holland. ISBN 0-444-87508-5. Chapter 18.1. The underlying domain theory may be found in Barendregt Chapter 1.2 or in the Script Chapter 6
20.07.2015	On Understanding Types, Data Abstraction, and Polymorphism	Seminal paper by Cardelli and Wegner, accompanying slides

Exercises

Introduction.

Date	Due date	Sheet	Material	Solutions
25.04.2015	01.05.2015	Exercise 1
01.05.2015	08.05.2015	Exercise 2	demo.rkt	arith.rkt
08.05.2015	15.05.2015	Exercise 3	subst.rkt	let.rkt
15.05.2015	22.05.2015	Exercise 4		err.rkt
22.05.2015	05.06.2015	Exercise 5		ljs.rkt
22.05.2015	12.06.2015	Exercise 6	types.rkt	typed.rkt
15.06.2015	19.06.2015	Exercise 7		ljs2.rkt
22.06.2015	26.06.2015	Exercise 8		ljs3.rkt
26.06.2015	03.07.2015	Exercise 9		ljsX.rkt
03.07.2015	17.07.2015	Exercise 10	ljsX.rkt	ljsY.rkt
17.07.2015	24.07.2015	Exercise 11

Subversion Repository

https://proglang.informatik.uni-freiburg.de/svn/eopl + SVNNUMBER
WWW Password

Literature

Script: Principles of Programming Languages by Peter Thiemann.
The lecture is based on the following book (referred to as PFPL): Practical Foundations for Programming Languages by Robert Harper. A working draft and an online preview is avaliable online at http://www.cs.cmu.edu/~rwh/.
The lecture's exercise main source is the book: Semantics Engineering with PLT Redex by Matthias Felleisen, Robert Bruce Findler and Matthew Flatt.
Yet another foundation for this lecture is Essentials of Programming Languages. Third edition. Daniel P. Friedman and Mitchell Wand. MIT Press, Cambridge, Massachusetts. ISBN 978-0-262-06279-4.