This site contains wikipages for the department of computer science and engineering at Chalmers and GU. 
CTFP10 /
CoursePlanCategory Theory and Functional Programming7.5hp, PhD level course, Spring 2010
Examiner: Patrik Jansson
Course DescriptionCategory theory, with an origin in algebra and topology, has found use in recent decades for computer science and logic applications. This can be clearly seen in the design of the pure functional programming languages like Haskell and Agda  where the categorical paradigm has influenced the language design, and given rise to several of the language elements (functions, functors, monads, arrows, ...). In this course, we will learn category theory starting from first principles with an eye towards its applications to and correspondences with Haskell and the theory of functional programming. We expect students to previously have taken courses on Programming languages, Functional programming and Logic and to have some level of mathematical maturity. (The courses "Types for Programs and Proofs" or "Advanced Functional Programming" are also recommended.) We also expect students to have had contact with linear algebra and discrete mathematics in order to follow the motivating examples behind the theory expounded. OverviewThis course aims to give an introduction to Category Theory from first principles, with a close view to its role in functional programming theory, in programming language design, and in the design and structure of Haskell. Learning objectivesAfter the course is completed, I expect a participating student to be able to
ExaminatinonEach student should
LiteratureSee separate literature list. Links
