Application Patterns

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

Application Patterns

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

204 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 language	English
Title of host publication	Sixth Symposium on Trends in Functional Programming, TFP 2005
Subtitle of host publication	Tallinn, Estonia, 23 – 24 September 2005, Proceedings
Editors	Marko van Eekelen
Place of Publication	Tallinn
Publisher	Tartu University Press
Pages	370-382
Number of pages	13
ISBN (Print)	9985-894-88-X
Publication status	Published - Sept 2005
Event	6th Symposium on Trends in Functional Programming, TFP 2005 - Tallinn, Estonia Duration: 23 Sept 2005 → 24 Sept 2005 Conference number: 6

Workshop

Workshop	6th Symposium on Trends in Functional Programming, TFP 2005
Abbreviated title	TFP
Country/Territory	Estonia
City	Tallinn
Period	23/09/05 → 24/09/05

Access to Document

Oosterhof2005applicationFinal published version, 116 KB
applPatts

http://www.cs.ioc.ee/tfp-icfp-gpce05/tfp-proc/

Cite this

@inproceedings{de353db87c174ed594b46ea5ee664625,

title = "Application Patterns",

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

author = "Oosterhof, \{Nikolaas N.\} and Holzenspies, \{Philip K.F.\} and Jan Kuper",

year = "2005",

month = sep,

language = "English",

isbn = "9985-894-88-X",

pages = "370--382",

editor = "\{van Eekelen\}, Marko",

booktitle = "Sixth Symposium on Trends in Functional Programming, TFP 2005",

publisher = "Tartu University Press",

address = "Estonia",

note = "6th Symposium on Trends in Functional Programming, TFP 2005, TFP ; Conference date: 23-09-2005 Through 24-09-2005",

}

Oosterhof, NN, Holzenspies, PKF & Kuper, J 2005, Application Patterns. in M van Eekelen (ed.), Sixth Symposium on Trends in Functional Programming, TFP 2005: Tallinn, Estonia, 23 – 24 September 2005, Proceedings. Tartu University Press, Tallinn, pp. 370-382, 6th Symposium on Trends in Functional Programming, TFP 2005, Tallinn, Estonia, 23/09/05. <http://www.cs.ioc.ee/tfp-icfp-gpce05/tfp-proc/>

Application Patterns. / Oosterhof, Nikolaas N.; Holzenspies, Philip K.F.; Kuper, Jan.
Sixth Symposium on Trends in Functional Programming, TFP 2005: Tallinn, Estonia, 23 – 24 September 2005, Proceedings. ed. / Marko van Eekelen. Tallinn: Tartu University Press, 2005. p. 370-382.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

TY - GEN

T1 - Application Patterns

AU - Oosterhof, Nikolaas N.

AU - Holzenspies, Philip K.F.

AU - Kuper, Jan

N1 - Conference code: 6

PY - 2005/9

Y1 - 2005/9

N2 - 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.

AB - 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.

M3 - Conference contribution

SN - 9985-894-88-X

SP - 370

EP - 382

BT - Sixth Symposium on Trends in Functional Programming, TFP 2005

A2 - van Eekelen, Marko

PB - Tartu University Press

CY - Tallinn

T2 - 6th Symposium on Trends in Functional Programming, TFP 2005

Y2 - 23 September 2005 through 24 September 2005

ER -

Application Patterns

Abstract

Workshop

Access to Document

Fingerprint

Cite this