Application Patterns

N.N. Oosterhof, P.K.F. Holzenspies, Jan Kuper

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

    25 Downloads (Pure)


    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 languageUndefined
    Title of host publicationTrends in Functional Programming
    EditorsM. van Eekelen
    Place of PublicationTallinn
    PublisherTartu University Press
    Number of pages13
    ISBN (Print)9985-894-88-X
    Publication statusPublished - Sep 2005

    Publication series

    PublisherTartu University Press


    • EWI-7687
    • IR-66544
    • METIS-227810

    Cite this

    Oosterhof, N. N., Holzenspies, P. K. F., & Kuper, J. (2005). Application Patterns. In M. van Eekelen (Ed.), Trends in Functional Programming (pp. 370-382). Tallinn: Tartu University Press.