| | |
Summary: Strictness Types: An Inference Algorithm
and an Application
Torben Amtoft
Computer Science Department
Aarhus University, Ny Munkegade, DK-8000 °Arhus C,
Denmark
internet: tamtoft@daimi.aau.dk
August 10, 1993
Abstract
This report deals with strictness types, a way of recording whether a
function needs its argument(s) or not. We shall present an inference system
for assigning strictness types to expressions and subsequently we transform
this system into an algorithm capable of annotating expressions with strict-
ness types. We give an example of a transformation which can be optimized
by means of these annotations, and finally we prove the correctness of the
optimized transformation at the same time proving the correctness of the
annotation.
Everything has been implemented; documentation can be found in ap-
pendix.
1 Introduction
|
