Expression reduction systems with patterns

Authors:
Julien Forest;Delia Kesner
Affiliations:
LRI, CNRS, UMR, Université Paris-Sud, France;PPS, CNRS, UMR, Université Paris 7, France
Venue:
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Year:
2003

Citing 13
Cited 4

Parallel reductions in λ-calculus

Journal of Symbolic Computation
The clausal theory of types

The clausal theory of types
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 typed pattern calculus

Information and Computation
Term rewriting and all that

Term rewriting and all that
Inductive-data-type systems

Theoretical Computer Science - Special issue on theories of types and proofs
Weak Orthogonality Implies Confluence: The Higher Order Case

LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
A de Bruijn Notation for Higher-Order Rewriting

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Pattern Matching as Cut Elimination

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The Higher-Order Recursive Path Ordering

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Pattern matching as cut elimination

Theoretical Computer Science
Expression Reduction Systems with Patterns

Journal of Automated Reasoning

The pattern calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
First-class patterns

Journal of Functional Programming
Expression reduction systems and extensions: an overview

Processes, Terms and Cycles
Pure pattern calculus

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new higher-order rewriting formalism, called Expression Reduction Systems with Patterns (ERSP), where abstraction is not only allowed on variables but also on nested patterns. These patterns are built by combining standard algebraic patterns with choice constructors used to denote different possible structures allowed for an abstracted argument. In other words, the non deterministic choice between different rewriting rules which is inherent to classical rewriting formalisms can be lifted here to the level of patterns. We show that confluence holds for a reasonable class of systems and terms.