Home Page
CIS 720  Spring 97
COMPUTATION AND COMPLEXITY
AT HIGHER TYPES
Instructor:
Jim Royer
Office: CST 3004
Email: royer@top.cis.syr.edu
The course concerns

models of computation and recursion on higher type objects,

recent theories of computational complexity of higher
type functionals, and

applications of these models to semantics of programming languages
and proof theory.
One of the longterm goals of this work is build the mathematical
tools for specifying and reasoning about the performance
(e.g., run time) of software systems built from modules, classes and
the like. This work is in its very early stages, so the course will
focus on basics.
PREREQUISITES CIS 623 or its equivalent. Some knowledge of
either recursion theory, computational complexity theory, category theory,
programming language semantics, or proof theory is strongly advised.