CSCI 354 Fall 2014 Functional Programming and the Art of Recursion (Q)

Functional programming takes as its central organizing principle the idea of evaluating functions rather than executing instructions. It supports programming at a high level of abstraction and carefully controlling side effects, which are critical given the ever-increasing sophistication of software systems. This course explores functional programming in depth, with a unifying focus on recursion. It combines practical programming experience in Haskell with a deep exploration of the underlying theory. Covered topics include algebraic data types, induction, lambda calculus, equivalence of iteration and recursion, laziness, folds and unfolds, termination analysis, and domain theory. These topics are of importance not only to functional programming per se, but also to the design and analysis of any software system.
Class Format: lecture/conference
Requirements/Evaluation: evaluation will be based on weekly assignments, class presentations, programming projects, and examinations
Additional Info:
Additional Info2:
Prerequisites: CSCI 136
Enrollment Preference: current or expected Computer Science majors
Department Notes:
Material and Lab Fees:
Distribution Notes:
Divisional Attributes: Division III,Quantitative and Formal Reasoning
Other Attributes:
Enrollment Limit: 36
Expected Enrollment: 20
Class Number: 1997
CSCI 354 - 01 (F) LEC Functional Programming (Q) Division 3: Science and MathematicsQuantitative and Formal Reasoning Brent A. Yorgey
TR 09:55 AM-11:10 AM Chemistry 206 1997
Course Search
Catalog Number:
Subject Attributes:
Enrollment Limit:
Course Type:
Start Time: End Time:
Instructor First Name:
Instructor Last Name:
Keyword Search: