The tensor product in Wadler's analysis of lists

    Research output: Contribution to journalConference articleResearchpeer-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 languageEnglish
    JournalScience of Computer Programming
    Volume22
    Issue number3
    Pages (from-to)327-354
    ISSN0167-6423
    DOIs
    Publication statusPublished - 1994
    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

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

    }

    The tensor product in Wadler's analysis of lists. / Nielson, Flemming; Nielson, Hanne Riis.

    In: Science of Computer Programming, Vol. 22, No. 3, 1994, p. 327-354.

    Research output: Contribution to journalConference articleResearchpeer-review

    TY - GEN

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

    AU - Nielson, Flemming

    AU - Nielson, Hanne Riis

    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

    VL - 22

    SP - 327

    EP - 354

    JO - Science of Computer Programming

    JF - Science of Computer Programming

    SN - 0167-6423

    IS - 3

    ER -