The tensor product in Wadler's analysis of lists

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-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 languageEnglish
    Title of host publicationESOP'92: 4th European Symposium on Programming
    PublisherSpringer Verlag
    Publication date1992
    Pages351-370
    ISBN (Print)3-540-55253-7
    Publication statusPublished - 1992
    Event4th European Symposium on Programming / 17th Colloquium on Trees in Algebra and Programming - University of Rennes, Rennes, France
    Duration: 26 Feb 199228 Feb 1992
    Conference number: 4/17

    Conference

    Conference4th European Symposium on Programming / 17th Colloquium on Trees in Algebra and Programming
    Number4/17
    LocationUniversity of Rennes
    CountryFrance
    CityRennes
    Period26/02/199228/02/1992
    SeriesLecture Notes in Computer Science
    Volume582
    ISSN0302-9743

    Fingerprint Dive into the research topics of 'The tensor product in Wadler's analysis of lists'. Together they form a unique fingerprint.

    Cite this