Aim and context
Learning outcomes: (see also the lecture 12
overview from 2010)
- DSL: design embedded domain specific languages
- DSL.Concepts: (abstract) syntax, semantics, ...
- DSL.Implement: implement EDSLs in Haskell (as combinator libraries)
- Types: read, understand and extend Haskell programs which use advanced type system features
- Types.Class: type classes, newtypes, deriving, ...
- Types.GADT: (generalised) algebraic datatypes & type families
- Types.HOT: functors, monads and monad transformers
- Spec: use specification based development techniques
- Spec.Test: formulate and test properties about the program
- Spec.Prove: reason about correctness of functional programs
- Spec.Trans: transform programs on the basis of reasoning
- Expl: explain and discuss the above topics
The AFP course requires a BSc in Computer Science or equivalent,
mathematical maturity, a basic course on Functional
Programming (like our
) and a course on Programming Lanuages (like ProgLangTech
Other recommended courses are Logic
and Finite automata theory and formal languages
For the purpose of course evaluation each course has student
representatives. Their role includes giving the teachers
feedback on the course.
AFP student representatives 2011: Shayan Najd Javadipour, Tobias Raski and Gabriel Rizopulos.
Chalmers central instructions on course evaluation
Notes from the meeting(s).
Most of the course weeks have two lectures:
TimeEdit schedule for AFP
||13.15 - 15.00
||10.00 - 11.45
Detailed information on the lectures will appear here (being migrated from 2010 version step by step).