22 search results - page 5 / 5 » The Rewriting Calculus as a Combinatory Reduction System |
POPL
2003
ACM
14 years 6 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
FLOPS
2004
Springer
13 years 11 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...