Summary

Table of Contents

1 Models of computations; substition model

2 Goto ↔ Loops, Inlining procedures, Procedures → Gotos, Pointers and passing by reference

3 Recursion. Substitution model in the presence of recursion, Explicit stack

4 Inheritance, Interfaces

5 Algebraic Types (Pattern matching, Parametric types, Currification)

6 HO Abstraction, Polymorphic functions, Closures

7 Purity; Continuations and effects

8 Resource-managing processes

9 Concurency to continuations

10 Intro to Logic Prog.; Unification

11 Functions to Relations, Search as list of successes

12 BONUS

12.1 Encoding data in the pure lambda calculus

12.2 A defunctionalised interpreted for the lambda calculus

Author: Jean-Philippe Bernardy

Created: 2016-03-03 tor 07:42

Emacs 24.5.2 (Org mode 8.2.10)

Validate