Simon Fraser University
Engaging the World

Course Outlines

Spring 2019 - CMPT 384 D100

Symbolic Computing (3)

Class Number: 6700

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 3 – Apr 8, 2019: Tue, 11:30 a.m.–1:20 p.m.
    Surrey

    Jan 3 – Apr 8, 2019: Thu, 11:30 a.m.–12:20 p.m.
    Surrey

  • Exam Times + Location:

    Apr 16, 2019
    Tue, 12:00–3:00 p.m.
    Surrey

  • Instructor:

    Rob Cameron
    cameron@sfu.ca
    778 782-7573
    Office: SUR 4178

  • Prerequisites:

    CMPT 225, and (MACM 101 or ENSC 251 and ENSC 252)).

Description

CALENDAR DESCRIPTION:

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.

COURSE DETAILS:

Computer programs, English text, algebraic equations, musical scores and logical formulas are all examples of symbolic data domains. Programs that address many problems involving these domains carry out their tasks primarily by manipulating expressions in special purpose languages. This course will focus on one of the most important programming paradigms that provides convenient support for such programming applications: functional programming. In particular, the Haskell programming language designed to support this paradigm will be introduced to support the techniques used in addressing symbolic computing problems.

COURSE-LEVEL EDUCATIONAL GOALS:

  • Languages: expressions and grammars.
  • Symbolic data: atoms, lists, structures.
  • Principles of functional programming.
  • Recursive programming and structural induction.
  • Programs and grammars as data objects: metaprogramming.
  • Algebraic expressions as data objects: symbolic math.
  • Logical formulas as data objects: theorem proving and the basis of logic programming.
  • Lexical analysis and parsing: interpreters

Grading

  • Assignments 40%
  • Midterm 20%
  • FInal exam 40%

Registrar Notes:

SFU’s Academic Integrity web site http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating.  Check out the site for more information and videos that help explain the issues in plain English.

Each student is responsible for his or her conduct as it affects the University community.  Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS