Csus/resource/course/cpsc 521

CPSC 521

Foundations of Functional Programming Description Theoretical foundations of functional programming: the lambda-calculus, beta-reduction, confluence, and reduction strategies. Programming syntax: solving recursive equations with the Y-combinator, let and letrec, types, datatypes, and patterns. Programming in a functional language: recursion patterns, useful combinators, maps, and folds, for datatypes. Example applications: recursive descent parsing, unification, combinatorial algorithms, theorem proving. Course Notes Previous Course Materials Previous Tutorial Materials Programming Languages External Links