Application Patterns

Nikolaas N. Oosterhof, Philip K.F. Holzenspies, Jan Kuper

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    27 Downloads (Pure)

    Abstract

    We present a generalization of patterns as used in definitions in functional languages, called application patterns. They consist of a function applied to arguments. While matchin such a pattern against an actual argument, inverse functions are used to find the binding of variables to values. Application patterns are universal in the sense that they include list, tuple, algebraic and n+k patterns.
    Original languageEnglish
    Title of host publicationSixth Symposium on Trends in Functional Programming, TFP 2005
    Subtitle of host publicationTallinn, Estonia, 23 – 24 September 2005, Proceedings
    EditorsMarko van Eekelen
    Place of PublicationTallinn
    PublisherTartu University Press
    Pages370-382
    Number of pages13
    ISBN (Print)9985-894-88-X
    Publication statusPublished - Sep 2005
    Event6th Symposium on Trends in Functional Programming, TFP 2005 - Tallinn, Estonia
    Duration: 23 Sep 200524 Sep 2005
    Conference number: 6

    Workshop

    Workshop6th Symposium on Trends in Functional Programming, TFP 2005
    Abbreviated titleTFP
    Country/TerritoryEstonia
    CityTallinn
    Period23/09/0524/09/05

    Cite this