CSC412 Functional Programming 1995.
Note: CSC412 will not be given from 1996.
There is a related unit
`CSC431 Declarative Programming Languages' (1996)
given jointly by LA and Kim Marriott.
Contents of this page:
The course begins with an introduction to lambda calculus, evaluation
and recursion. It includes some issues in type systems, type checking,
type inference and Milner-style polymorphic types. Some programming
techniques are described and there is practical work both in lambda
calculus and in a modern functional language (eg. LML or Haskell).
Some of the following topics may also be discussed:
- relationship of functional programming to denotational semantics
- implementation techniques for functional languages
- relationship of functional programming to combinators {S,K,I} etc.
- parallel functional languages
Recommended book:
Bird & Wadler, `Introduction to Functional Programming',
Prentice Hall, 1988.
- Lectures: Monday 4.15 S15, Tues 11.00 S12, weeks 1-9 of semester 1.
- Notes handed out:
- Assessment: 30% prac', 70% exam (11.00 Tues 9 May, negotiable).
- Practical assignment (30%).
- Useful links:
- Sample exam questions.
- The general FP page
includes some LML examples and
the toy lambda-calculus / FP interpreter.
- A few references on
FP,
types
and
semantics.
Copyright ©
Lloyd Allison / 1995