caa a22 4500 463182901 CHVBK 20180406164844.0 cr unu---uuuuu 170326e20071201xx s 000 0 eng 10.1007/s10817-007-9083-0 doi (NATIONALLICENCE)springer-10.1007/s10817-007-9083-0 Expression Reduction Systems with Patterns [Elektronische Daten] [Julien Forest, Delia Kesner] We introduce a new higher-order rewriting formalism, called expression reduction systems with patterns (ERSP), where abstraction is allowed not only on variables but also on nested patterns with metavariables. These patterns are built by combining standard algebraic patterns with choice constructors denoting cases. In other words, the nondeterministic choice between different rewrite 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. Springer Science+Business Media B.V., 2007 Pattern matching nationallicence Expression reduction systems nationallicence Higher-order rewriting nationallicence Forest Julien INRIA Sophia-Antipolis, Sophia-Antipolis, France aut Kesner Delia PPS (CNRS UMR 7126), Université Paris 7, Paris, France aut Journal of Automated Reasoning Springer Netherlands 39/4(2007-12-01), 513-541 0168-7433 39:4<513 2007 39 10817 https://doi.org/10.1007/s10817-007-9083-0 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10817-007-9083-0 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Forest Julien INRIA Sophia-Antipolis, Sophia-Antipolis, France aut NATIONALLICENCE 700 1- Kesner Delia PPS (CNRS UMR 7126), Université Paris 7, Paris, France aut NATIONALLICENCE 773 0- Journal of Automated Reasoning Springer Netherlands 39/4(2007-12-01), 513-541 0168-7433 39:4<513 2007 39 10817 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer