Symbolic Computing CMPT 384 (3)
This course considers modelling and programming techniques appropriate for symbolic data domains such as mathematical expressions, logical formulas, grammars and programming languages. Topics include recursive and functional programming style, grammar-based data abstraction, simplification and reduction transformations, conversions to canonical form, environment data structures and interpreters, metaprogramming, pattern matching and theorem proving. Prerequisite: CMPT 225, and (MACM 101 or ENSC 251 and ENSC 252)).
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Rob Cameron |
Jan 3 – Apr 10, 2018: Mon, Wed, Fri, 1:30–2:20 p.m.
|
Burnaby |