Lambda-calculi for (strict) parallel functions
Information and Computation
Parallel reductions in &lgr;-calculus
Information and Computation
Normalized rewriting: an alternative to rewriting modulo a set of equations
Journal of Symbolic Computation
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Filter Models for a Parallel and Non Deterministic Lambda-Calculus
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
The differential Lambda-calculus
Theoretical Computer Science
Canonical Abstract Syntax Trees
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The @r-calculus generalises term rewriting and the @l-calculus by defining abstractions on arbitrary patterns and by using a pattern-matching algorithm which is a parameter of the calculus. In particular, equational theories that do not have unique principal solutions may be used. In the latter case, all the principal solutions of a matching problem are stored in a ''structure'' that can also be seen as a collection of terms. Motivated by the fact that there are various approaches to the definition of structures in the @r-calculus, we study in this paper a version of the @l-calculus with term collections. The contributions of this work include a new syntax and operational semantics for a @l-calculus with term collections, which is related to the @l-calculi with strict parallel functions studied by Boudol and Dezani et al. and a proof of the confluence of the @b-reduction relation defined for the calculus (which is a suitable extension of the standard rule of @b-reduction in the @l-calculus).