Publication: Research - peer-review › Conference article – Annual report year: 1994
We consider abstract interpretation (in particular strictness analysis) for pairs and lists. We begin by reviewing the well-known fact that the best known description of a pair of elements is obtained using the tensor product rather than the cartesian product. We next present a generalisation of Wadler's strictness analysis for lists (1987) using the notion of open set. Finally, we illustrate the intimate connection between the case analysis implicit in Wadler's strictness analysis and the precision that the tensor product allows for modelling the inverse cons operation
|Journal||Science of Computer Programming|
|State||Published - 1994|
|Conference||4th European Symposium on Programming / 17th Colloquium on Trees in Algebra and Programming|
|Period||26/02/1992 → 28/02/1992|
|Citations||Web of Science® Times Cited: 2|
Loading map data...