The tensor product in Wadler's analysis of lists

Flemming Nielson; Hanne Riis Nielson

The tensor product in Wadler's analysis of lists

Flemming Nielson
, Hanne Riis Nielson

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{b1828d74c84c460d9a00ca7ca9d75a85,

title = "The tensor product in Wadler's analysis of lists",

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.",

author = "Flemming Nielson and Nielson, \{Hanne Riis\}",

year = "1992",

language = "English",

isbn = "3-540-55253-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "351--370",

booktitle = "ESOP'92: 4th European Symposium on Programming",

address = "Germany",

note = "4th European Symposium on Programming / 17th Colloquium on Trees in Algebra and Programming ; Conference date: 26-02-1992 Through 28-02-1992",

}

TY - GEN

T1 - The tensor product in Wadler's analysis of lists

AU - Nielson, Flemming

AU - Nielson, Hanne Riis

N1 - Conference code: 4/17

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

M3 - Article in proceedings

SN - 3-540-55253-7

T3 - Lecture Notes in Computer Science

SP - 351

EP - 370

BT - ESOP'92: 4th European Symposium on Programming

PB - Springer Verlag

T2 - 4th European Symposium on Programming / 17th Colloquium on Trees in Algebra and Programming

Y2 - 26 February 1992 through 28 February 1992

ER -

The tensor product in Wadler's analysis of lists

Abstract

Conference

OpenUrl availability

Fingerprint

Cite this