Abstract Interpretation vs. Type Inference A Topological Perspective

The connection between abstract interpretation and type inference is investigated. A list of analyses is examined and a framework for comparing the two kind of analyses is sketched. The framework is based on the notion of Stone duality and Domain Logic.

[1]  Chris Hankin,et al.  The theory and practice of strictness analysis for higher order functions , 1985 .

[2]  Anders Bondorf,et al.  A self-applicable partial evaluator for the lambda calculus , 1990, Proceedings. 1990 International Conference on Computer Languages.

[3]  Carsten K. Gomard.  Partial type inference for untyped functional programs , 1990, LISP and Functional Programming.

[4]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[5]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[6]  Tsung-Min Kuo,et al.  Strictness analysis: a new perspective based on type inference , 1989, FPCA.

[7]  Philip Wadler,et al.  Linear Types can Change the World! , 1990, Programming Concepts and Methods.