| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436341 | Theoretical Computer Science | 2008 | 16 Pages |
Abstract
In this paper we revisit the λ-calculus with patterns, originating from the practice of functional programming language design. We treat this feature in a framework ranging from pure λ-calculus to orthogonal combinatory reduction systems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
