First-class patterns

UTSePress Research/Manakin Repository

Search UTSePress Research

Advanced Search


My Account

Show simple item record Jay, Barry en_US Kesner, D en_US
dc.contributor.editor en_US 2010-06-16T04:58:08Z 2010-06-16T04:58:08Z 2009 en_US
dc.identifier 2008007865 en_US
dc.identifier.citation Jay Barry and Kesner D 2009, 'First-class patterns', Cambridge Univ Press, vol. 19, no. 2, pp. 191-225. en_US
dc.identifier.issn 0956-7968 en_US
dc.identifier.other C1 en_US
dc.description.abstract Pure pattern calculus supports pattern-matching functions in which patterns are first-class citizens that can be passed as parameters, evaluated and returned as results. This new expressive power supports two new forms of polymorphism. Path polymorphism allows recursive functions to traverse arbitrary data structures. Pattern polymorphism allows patterns to be treated as parameters which may be collected from various sources or generated from training data. A general framework for pattern calculi is developed. It supports a proof of confluence that is parameterised by the nature of the matching algorithm, Suitable for the pure pattern calculus and all other known pattern calculi. en_US
dc.language en_US
dc.publisher Cambridge Univ Press en_US
dc.title First-class patterns en_US
dc.parent Journal Of Functional Programming en_US
dc.journal.volume 19 en_US
dc.journal.number 2 en_US
dc.publocation United Kingdom en_US
dc.identifier.startpage 191 en_US
dc.identifier.endpage 225 en_US FEIT.School of Systems, Management and Leadership en_US
dc.conference Verified OK en_US
dc.for 080308 en_US
dc.personcode 930303 en_US
dc.personcode 0000027799 en_US
dc.percentage 100 en_US Programming Languages en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom en_US en_US
dc.location.activity ISI:000264506600005 en_US
dc.description.keywords NA en_US
dc.staffid en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record