Local Type Reconstruction by Means of Symbolic Fixed Point Iteration

Abstract. We convert, via a version that uses constraints, a type inference 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

• Type: Conference
• Year: 1994
• Where: ESOP
• Authors: Torben Amtoft
• Keywords: Constraint Variables, ESOP 1994, Inference System, Programming Languages, Strictness Analysis