Summary

Table of Contents

1 Models of computations; substition model

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

InsertionSort.c LoopsToGoto.c

../Templates/Pointers.c ByRefAsVonNeumann.cpp ByValueAsSubstModel.cpp

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

../Templates/Fib.hs fact.c factTail.c hanoi.c

4 Inheritance, Interfaces

Date.cpp DateRec.cpp Animals.cpp AnimalsRec.cpp

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

AlgebraicTypes.hs AlgebraicTypes.java

6 HO Abstraction, Polymorphic functions, Closures

Fold.hs HOT.hs HOTExplicitClosure.hs ExplicitClosure.hs ExplicitClosure.java

7 Purity; Continuations and effects

ContinuationsStack.hs ContinueAccum.hs ContinueState.hs Roots.hs Lazy.hs

8 Resource-managing processes

Process.hs ConcurrentIORef.hs CSPVariable.hs RPCServer.hs

9 Concurency to continuations

Server.hs ServerWithContinuations.hs RuntimeSystem.hs

10 Intro to Logic Prog.; Unification

Family.curry Map.curry UnificationExamples.curry Unify.hs

11 Functions to Relations, Search as list of successes

Lists.curry Search.hs

12 BONUS

12.1 Encoding data in the pure lambda calculus

Church.hs

12.2 A defunctionalised interpreted for the lambda calculus

KAM.hs

Author: Jean-Philippe Bernardy

Created: 2016-03-03 tor 07:42

Emacs 24.5.2 (Org mode 8.2.10)

Validate