Csus/resource/course/cpsc 521

From wiki.ucalgary.ca
< Csus‎ | resource
Revision as of 19:15, 25 August 2013 by Njcormie (talk | contribs) (Created page with "<div style="text-align:center;font:32pt bolder;margin-bottom:10px"> CPSC 521 <br /> Foundations of Functional Programming </div> <h1>Description</h1> Theoretical foundations o...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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

Retrieved from "http://wiki.ucalgary.ca/index.php?title=Csus/resource/course/cpsc_521&oldid=66550"