A rewriting system for categorical combinators with multiple arguments
SIAM Journal on Computing
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A feature constraint system for logic programming with entailment
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Parallel reductions in &lgr;-calculus
Information and Computation
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
Higher-order rewrite systems and their confluence
Theoretical Computer Science - Special issue: rewriting systems and applications
Journal of the ACM (JACM)
Confluence of extensional and non-extensional &lgr;-calculi with explicit substitutions
Theoretical Computer Science
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Axiomatic Rewriting Theory VI Residual Theory Revisited
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
The rewriting calculus as a combinatory reduction system
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
ESOP'07 Proceedings of the 16th European conference on Programming
A lambda-calculus with constructors
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Journal of Functional Programming
Continuation Models for the Lambda Calculus With Constructors
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Different pattern calculi integrate the functional mechanisms from the λ-calculus and the matching capabilities from rewriting. Several approaches are used to obtain the confluence but in practice the proof methods share the same structure and each variation on the way pattern-abstractions are applied needs another proof of confluence. We propose here a generic confluence proof where the way pattern-abstractions are applied is axiomatized. Intuitively, the conditions guarantee that the matching is stable by substitution and by reduction. We show that our approach directly applies to different pattern calculi, namely the lambda calculus with patterns, the pure pattern calculus and the rewriting calculus. We also characterize a class of matching algorithms and consequently of pattern-calculi that are not confluent.