Paper Info
Title
Boolean Constraints for Binding-Time Analysis
Abstract
To achieve acceptable accuracy, many program analyses for functional programs are "property polymorphic". That is, they can infer different input-output relations for a function at separate applications of the function, in a manner similar to type inference for a polymorphic language. We extend a property polymorphic (or "polyvariant") method for binding-time analysis, due to Dussart, Henglein, and Mossin, so that it applies to languages with ML-style type polymorphism. The extension is non-trivial and we have implemented it for Haskell. While we follow others in specifying the analysis as a non-standard type inference, we argue that it should be realised through a translation into the well-understood domain of Boolean constraints. The expressiveness offered by Boolean constraints opens the way for smooth extensions to sophisticated language features and it allows for more accurate analysis.
Year
DOI
Venue
2001
10.1007/3-540-44978-7_4
PADO
Keywords
Field
DocType
sophisticated language feature,polymorphic language,program analysis,type inference,non-standard type inference,boolean constraint,ml-style type polymorphism,boolean constraints,binding-time analysis,accurate analysis,property polymorphic
Discrete mathematics,Binding time analysis,Functional programming,Computer science,Principal type,Algorithm,Theoretical computer science,Type inference,Haskell,Boolean algebra,Program analysis,Expressivity
Conference
Volume
ISSN
ISBN
2053
0302-9743
3-540-42068-1
Citations 
PageRank 
References 
6
0.45
18
Authors
4
Name
Order
Citations
PageRank
Kevin Glynn1283.34
Peter J. Stuckey24368457.58
Martin Sulzmann367644.36
Harald Søndergaard485879.52