CS 558 Software Foundations
From TaylorGroves
Instructor:
Darko Stefanovic Office: FEC 345C Email: darko Phone: +1 505 2776561; Fax: +1 505 2776927 Office hours: Tuesday, Wednesday, Thursday 10-11
The course is an informal introduction to the theory used to describe and define programming languages,
and to guide their implementation. Our approach is type-based, in the spirit of our textbook, Pierce’s
Types and Programming Languages (TAPL). As a prelude, the course offers an overview of programming
techniques and programming language features found in the purely functional programming language
Haskell.
Contents |
Class Notes
My Class Notes
- CS558-2010-08-24
- CS558-2010-08-31
- CS558-2010-09-02 - Lambda Calc, Tuples, Errors
- CS558-2010-09-07 - List Comprehensions, Concat, Sorted, Zip
- CS558-2010-09-09 - Concat, !!, Map, Fold
- CS558-2010-09-14 - Function composition, map in terms of foldr, etc
- CS558-2010-09-21 - Haskell Types
- CS558-2010-09-23 - Trees
- CS558-2010-09-28 - Proof by calculation
- CS558-2010-09-31
- CS558-2010-10-05 - Trees, Show, etc
- --END FIRST SECTION--
- CS558-2010-10-07
- CS558-2010-10-12
- CS558-2010-10-19
Eric Schulte's Notes
A couple links of greater importance:
Other Resources
- Misc. Haskell Notes (not that comprehensive)