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 - Sep 2005 |
Event | 6th Symposium on Trends in Functional Programming, TFP 2005 - Tallinn, Estonia Duration: 23 Sep 2005 → 24 Sep 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 |