Pure pattern calculus

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Jay, Barry en_US
dc.contributor.author Kesner, D en_US
dc.contributor.editor Sestoff, P en_US
dc.date.accessioned 2009-11-09T02:43:48Z
dc.date.available 2009-11-09T02:43:48Z
dc.date.issued 2006 en_US
dc.identifier 2006003973 en_US
dc.identifier.citation Jay Barry and Kesner D 2006, 'Pure pattern calculus', Springer-Verlag Berlin, Berlin, Germany, pp. 100-114. en_US
dc.identifier.issn 0302-9743 en_US
dc.identifier.other E1 en_US
dc.identifier.uri http://hdl.handle.net/10453/1684
dc.description.abstract The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calculus derive from allowing any term to be a pattern. As well as supporting a uniform ap en_US
dc.publisher Springer-Verlag Berlin en_US
dc.relation.isbasedon http://dx.doi.org/10.1007/11693024_8 en_US
dc.title Pure pattern calculus en_US
dc.parent Programming Languages And Systems, Proceedings, Lecture Notes in Computer Science en_US
dc.journal.volume 3924 en_US
dc.journal.number en_US
dc.publocation Berlin, Germany en_US
dc.identifier.startpage 100 en_US
dc.identifier.endpage 114 en_US
dc.cauo.name FEIT.School of Systems, Management and Leadership en_US
dc.conference Verified OK en_US
dc.conference.location Austria en_US
dc.for 080300 en_US
dc.personcode 930303 en_US
dc.personcode 0000027799 en_US
dc.percentage 100 en_US
dc.classification.name Computer Software en_US
dc.classification.type FOR-08 en_US
dc.custom European Symposium on Programming en_US
dc.date.activity 20060327 en_US
dc.location.activity Austria en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record