| This is a course page of David Casperson You are here: home → Semesters → Fall 2017 → CPSC 370 |
|
CPSC 370 — Functional and Logic Programming — Fall 2017
This page summarises information about CPSC 370.
- Prerequisites
- A grade of C- or better in cpsc 141 and cpsc 281; or permission of instructor.
- Important Information
-
Important information may be posted here from time to time.
- 2017-08-20
- No news is good news
- Accommodations
-
Students in this course who, because of a disability, may have a need for special academic accommodations should discuss this with the instructor, or contact the Access Resource Centre located in the Teaching & Learning Building in Room 10-1048.
- Grading Scheme1 and Dates:
-
What When Value First Class Wed, Sep 06 Thanksgiving Mon, Oct 09 Midterm I Wed, Oct 12 20% Last Drop Day Thu, Oct 26 Midterm II Wen, Nov 16 20% Mid Semester Break Thu, Nov 10 Remembrance Day Mon, Nov 13 Course Evaluation Fri, Nov 24 Last Class Fri, Dec 01 Homework from time to time 25% Final Wed, Dec 13 18:00–21:00 35% - Programming Assigments
- There will be approximately weekly programming assignments
during the semester. Programming languages
include Scheme,
Prolog
and Haskell.
See the homework link on the menu-bar.
- Times
- Times can be found on David Casperson’s Schedule also linked on the right.
- Handouts
-
Handout Dates 2017-09-09 Course Syllabus 2017-09-15 Casperson’s Schedule - References
- There is no required text.
- Blackboard
- Approximate Course Content
-
- An introduction to functional programming. Static and dynamic
typing. Strict and non-strict evaluation.
Pure
versusimpure
functional programming. - Some common functional programning languages.
- Functions and partial functions.
- Cartesian products. Disjoint unions.
Currying
.
- An introduction to functional programming. Static and dynamic
typing. Strict and non-strict evaluation.
- Haskell.
- Builtin types and literals. Tuples. Lists.
- Declarations. Function declarations and function values.
- Datatypes.
- Exploiting laziness. Downsides to laziness.
- Recursion, tail recursion, and accumulator arguments.
- Monadic programming.
- Scheme
- Space and time complexity for functional programs and data structures.
- Prolog.
- An introduction to logic programming.
- Facts. Rules. Goals. Variables. Conjunctions. Horn Clauses.
- The Unification algorithm.
- Accumulator arguments.
- Difference lists.
- Cuts. Negation.
- Arithmetic.
- Debugging.
- Links
- Notes
