Type Theory and Projections for Higher-Order Static Analysis
Clem Baker-Finch. In ACM Workshop on Partial
Evaluation and Semantics-Based Program Manipulation (PEPM'94),
Orlando, 1994, pages 43-52.
Abstract
A system of annotated types is proposed as a means of
describing and inferring static information, such as strictness and
constancy, about functional programs. An abstract semantics is given
in terms of projections. The paper then proceeds to
demonstrate a close connection between annotated type assignment and
projection analysis.
This paper was selected for in a special issue of Lisp and
Symbolic Computation. That later version is here.
BibTeX, PostScript, gzipped PostScript