Abstract
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 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.
| Original language | English |
|---|---|
| Title of host publication | ESOP'92: 4th European Symposium on Programming |
| Publisher | Springer Verlag |
| Publication date | 1992 |
| Pages | 351-370 |
| ISBN (Print) | 3-540-55253-7 |
| Publication status | Published - 1992 |
| Event | 4th European Symposium on Programming / 17th Colloquium on Trees in Algebra and Programming - University of Rennes, Rennes, France Duration: 26 Feb 1992 → 28 Feb 1992 Conference number: 4/17 |
Conference
| Conference | 4th European Symposium on Programming / 17th Colloquium on Trees in Algebra and Programming |
|---|---|
| Number | 4/17 |
| Location | University of Rennes |
| Country/Territory | France |
| City | Rennes |
| Period | 26/02/1992 → 28/02/1992 |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 582 |
| ISSN | 0302-9743 |