First-class patterns

Jay, B; Kesner, D

First-class patterns

Jay, B

Kesner, D

Permalink

Publication Type:: Journal Article
Citation:: Journal of Functional Programming, 2009, 19 (2), pp. 191 - 225
Issue Date:: 2009-03-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (255.76 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Jay, B https://orcid.org/0000-0001-8654-4305	en_US
dc.contributor.author	Kesner, D	en_US
dc.date.issued	2009-03-01	en_US
dc.identifier.citation	Journal of Functional Programming, 2009, 19 (2), pp. 191 - 225	en_US
dc.identifier.issn	0956-7968	en_US
dc.identifier.uri	http://hdl.handle.net/10453/11805
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. © 2009 Copyright Cambridge University Press.	en_US
dc.relation.ispartof	Journal of Functional Programming	en_US
dc.relation.isbasedon	10.1017/S0956796808007144	en_US
dc.subject.classification	Software Engineering	en_US
dc.title	First-class patterns	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	19	en_US
utslib.for	080308 Programming Languages	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0803 Computer Software	en_US
dc.location.activity	ISI:000264506600005	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	open_access
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	19	en_US

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. © 2009 Copyright Cambridge University Press.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/11805