Summary: Local Type Reconstruction by means of
Symbolic Fixed Point Iteration
Torben Amtoft
internet: tamtoft@daimi.aau.dk
DAIMI, Aarhus University
Ny Munkegade, DK­8000 š Arhus C, Denmark
Abstract. We convert, via a version that uses constraints, a type in­
ference system for strictness analysis into an algorithm which given an
expression finds the set of possible typings. Although this set in general
does not possess a minimal element, it can be represented compactly by
means of symbolic expressions in normal form -- such expressions have
the property that once values for the constraint variables with nega­
tive polarity have been supplied it is straight­forward to compute the
minimal values for the constraint variables with positive polarity. The
normalization process works on the fly, i.e. by a leaf­to­root traversal of
the inference tree.
1 Background and Motivation
Recently much interest has been devoted to the formulation of program analysis
in terms of inference systems, as opposed to e.g. abstract interpretation (for the
relationship between those methods see e.g. [Jen91]). This approach is appealing

Source: Amtoft, Torben - Department of Computing and Information Sciences, Kansas State University

Collections: Computer Technologies and Information Sciences