CSCI054 PO - Discrete Math and Functional Programming

When Offered: Each semester.
Instructor(s): M. Greenberg, J. Osborn, Y.Wu
Credit: 1

A combined course on functional programming and formal proof. Students write programs over a variety of data structures, proving their programs correct with respect to precise logical specifications. Programming topics (and proof topics) range over: recursion (induction); combinatorics; algebraic data types, from lists to trees to abstract syntax trees (structural induction); parsers and interpreters (soundness properties); regular expressions (set theory and language theory). Prerequisites: any CSCI051x PO course or Computer Science AP Exam-A with a score of 5. The course is equivalent to plus . This course and any of the following courses can not both be taken for credit: CSCI 060 HM.

Satisfies the following General Education Requirement(s), subject to conditions explained in the Degree Requirements section of this Catalog:
Area 5