The tensor product in Wadler's analysis of lists

Publication: Research - peer-reviewConference article – Annual report year: 1994

View graph of relations

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
Original languageEnglish
JournalScience of Computer Programming
Publication date1994
Volume22
Issue3
Pages327-354
ISSN0167-6423
DOIs
StatePublished

Conference

Conference4th European Symposium on Programming / 17th Colloquium on Trees in Algebra and Programming
Number4/17
CountryFrance
CityRennes
Period26/02/9228/02/92
CitationsWeb of Science® Times Cited: 2
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 3973051