Experiments with destructive updates in a lazy functional language

Pieter H. Hartel, W.G. Vree

    Research output: Contribution to journalArticleAcademicpeer-review

    2 Citations (Scopus)
    54 Downloads (Pure)

    Abstract

    The aggregate update problem has received considerable attention since pure functional program- ming languages were recognised as an interesting research topic. There is extensive literature in this area, which proposes a wide variety of solutions. We have tried to apply some of the proposed so- lutions to our own applications to see how these solutions work in practice. We have been able to use destructive updates but are not convinced that this could have been achieved without application specific knowledge. In particular, no form of update analysis has been reported that is applicable to non-flat domains in polymorphic languages with higher order functions. It is our belief that a refinement of the monolithic approach towards constructing arrays may be a good alternative to using the incremental approach with destructive updates.
    Original languageUndefined
    Pages (from-to)177-192
    Number of pages16
    JournalComputer languages
    Volume20
    Issue number3
    DOIs
    Publication statusPublished - 1994

    Keywords

    • EWI-1169
    • IR-55733

    Cite this

    @article{de8f58da6d4f440c8992eb07e00cbe7b,
    title = "Experiments with destructive updates in a lazy functional language",
    abstract = "The aggregate update problem has received considerable attention since pure functional program- ming languages were recognised as an interesting research topic. There is extensive literature in this area, which proposes a wide variety of solutions. We have tried to apply some of the proposed so- lutions to our own applications to see how these solutions work in practice. We have been able to use destructive updates but are not convinced that this could have been achieved without application specific knowledge. In particular, no form of update analysis has been reported that is applicable to non-flat domains in polymorphic languages with higher order functions. It is our belief that a refinement of the monolithic approach towards constructing arrays may be a good alternative to using the incremental approach with destructive updates.",
    keywords = "EWI-1169, IR-55733",
    author = "Hartel, {Pieter H.} and W.G. Vree",
    note = "Imported from DIES",
    year = "1994",
    doi = "10.1016/0096-0551(94)90003-5",
    language = "Undefined",
    volume = "20",
    pages = "177--192",
    journal = "Computer Languages, Systems and Structures",
    issn = "1477-8424",
    publisher = "Elsevier",
    number = "3",

    }

    Experiments with destructive updates in a lazy functional language. / Hartel, Pieter H.; Vree, W.G.

    In: Computer languages, Vol. 20, No. 3, 1994, p. 177-192.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - Experiments with destructive updates in a lazy functional language

    AU - Hartel, Pieter H.

    AU - Vree, W.G.

    N1 - Imported from DIES

    PY - 1994

    Y1 - 1994

    N2 - The aggregate update problem has received considerable attention since pure functional program- ming languages were recognised as an interesting research topic. There is extensive literature in this area, which proposes a wide variety of solutions. We have tried to apply some of the proposed so- lutions to our own applications to see how these solutions work in practice. We have been able to use destructive updates but are not convinced that this could have been achieved without application specific knowledge. In particular, no form of update analysis has been reported that is applicable to non-flat domains in polymorphic languages with higher order functions. It is our belief that a refinement of the monolithic approach towards constructing arrays may be a good alternative to using the incremental approach with destructive updates.

    AB - The aggregate update problem has received considerable attention since pure functional program- ming languages were recognised as an interesting research topic. There is extensive literature in this area, which proposes a wide variety of solutions. We have tried to apply some of the proposed so- lutions to our own applications to see how these solutions work in practice. We have been able to use destructive updates but are not convinced that this could have been achieved without application specific knowledge. In particular, no form of update analysis has been reported that is applicable to non-flat domains in polymorphic languages with higher order functions. It is our belief that a refinement of the monolithic approach towards constructing arrays may be a good alternative to using the incremental approach with destructive updates.

    KW - EWI-1169

    KW - IR-55733

    U2 - 10.1016/0096-0551(94)90003-5

    DO - 10.1016/0096-0551(94)90003-5

    M3 - Article

    VL - 20

    SP - 177

    EP - 192

    JO - Computer Languages, Systems and Structures

    JF - Computer Languages, Systems and Structures

    SN - 1477-8424

    IS - 3

    ER -