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. © 2008.
Original language | English |
---|---|
Pages (from-to) | 16-31 |
Journal | Theoretical Computer Science |
Volume | 398 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 2008 |