The tensor product in Wadler's analysis  of lists

Flemming Nielson; Hanne Riis Nielson

doi:10.1016/0167-6423(94)00009-3

The tensor product in Wadler's analysis of lists

Flemming Nielson
, Hanne Riis Nielson

Research output: Contribution to journal › Conference article › 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 (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 language	English
Journal	Science of Computer Programming
Volume	22
Issue number	3
Pages (from-to)	327-354
ISSN	0167-6423
DOIs	https://doi.org/10.1016/0167-6423(94)00009-3
Publication status	Published - 1994
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

Access to Document

10.1016/0167-6423(94)00009-3

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{87699fea6a0e441c99237aba05b4da73,

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

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

year = "1994",

doi = "10.1016/0167-6423(94)00009-3",

language = "English",

volume = "22",

pages = "327--354",

journal = "Science of Computer Programming",

issn = "0167-6423",

publisher = "Elsevier",

number = "3",

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 - 1994

Y1 - 1994

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 (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

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 (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

U2 - 10.1016/0167-6423(94)00009-3

DO - 10.1016/0167-6423(94)00009-3

M3 - Conference article

SN - 0167-6423

VL - 22

SP - 327

EP - 354

JO - Science of Computer Programming

JF - Science of Computer Programming

IS - 3

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

Y2 - 26 February 1992 through 28 February 1992