Pure pattern calculus

Springer-Verlag Berlin
Publication Type:
Conference Proceeding
Programming Languages And Systems, Proceedings, Lecture Notes in Computer Science, 2006, 3924 pp. 100 - 114
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
2006003973.pdf454.29 kB
Adobe PDF
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
Please use this identifier to cite or link to this item: