The purpose of this course is to introduce the theory and practice of functional programming (FP). The characteristic feature of FP is the emphasis on computation as evaluation. The traditional distinction between program and data characteristic of imperative programming (IP) is replaced by an emphasis on classifying expressions by types that specify their applicative behavior. Types include familiar (fixed and arbitrary precision) numeric types, tuples and records (structs), classified values (objects), inductive types such as trees, functions with specified inputs and outputs, and commands such as input and output. Well-typed expressions are evaluated to produce values, in a manner that is guaranteed to be type- safe. Because functional programs do not cause side-effects we can take advantage of simple mathematical principles in reasoning about applicative behavior and analyzing the runtime properties of programs. such as computer graphics, artificial intelligence, digital video and audio fundamentals with emphasis on practical tools and techniques used in computer games industry
Bachelor of Computer Science - 132 CRs
Thompson S., Haskll: The Craft of Functional Programming, Addison-Wesley
content serial | Description |
---|
1 | Introducing functional programming |
2 | Basic types and definitions |
3 | Data types, tuples and lists |
4 | Programming with lists |
5 | I/O in Haskell |
6 | Reasoning about programs |
7 | Generalization: patterns of computation |
8 | Higher-order functions |
9 | Overloading, type classes and type checking |
10 | Algebraic types |
11 | Abstract data types |
12 | Lazy programming |
14 | Programming with monads |
14 | Domain-Specific Languages |
15 | Revision |
Start your application