Context-sensitive conditional expression reduction systems

Abstract We introduce Context-sensitive Conditional Expression Reduction Systems (CERS) by extending and generalizing the notion of conditional TRS to the higher order case. We justify our framework in two ways. First, we define orthogonality for CERSs and show that the usual results for orthogonal systems (finiteness of developments, confluence, permutation equivalence) carry over immediately. This can be used e.g. to infer confluence from the subject reduction property in several typed λ-calculi possibly enriched with pattern-matching definitions. Second, we express several proof and transition systems as CERSs. In particular, we give encodings of Hilbert-style proof systems, Gentzen-style sequent-calculi, rewrite systems with rule priorities, and the π-calculus into CERSs. This last encoding is an (important) example of real context-sensitive rewriting.

[1]  Nachum Dershowitz,et al.  Canonical Conditional Rewrite Systems , 1988, CADE.

[2]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[3]  Matthias Felleisen,et al.  A call-by-need lambda calculus , 1995, POPL '95.

[4]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[5]  Femke van Raamsdonk.  Confluence and Superdevelopments , 1993, RTA.

[6]  Robert Pieter Nederpelt Lazarom.  Strong normalization in a typed lambda calculus with lambda structured types , 1973 .

[7]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..

[8]  Yoshihito Toyama,et al.  Confluent Term Rewriting Systems with Membership Conditions , 1988, CTRS.

[9]  Yohji Akama.  On Mints' Reduction for ccc-Calculus , 1993, TLCA.

[10]  Zurab Khasidashvili.  The Longest Perpetual Reductions in Orthogonal Expression Reduction Systems , 1994, LFCS.

[11]  V. van Oostrom,et al.  Confluence for Abstract and Higher-Order Rewriting , 1994 .

[12]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[13]  David A. Wolfram,et al.  The Clausal Theory of Types , 1993 .

[14]  Jan A. Bergstra,et al.  Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[15]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

[16]  Zurab Khasidashvili.  The Church-rosser theorem in orthogonal combinatory reduction systems , 1991 .

[17]  Masako Takahashi.  λ-calculi with conditional rules , 1992 .

[18]  Vincent van Oostrom,et al.  Weak Orthogonality Implies Con(cid:2)uence(cid:3) the Higher(cid:4)Order Case , 2011 .

[19]  Masako Takahashi.  Lambda-Calculi with Conditional Rules , 1993, TLCA.

[20]  Jan A. Bergstra,et al.  Term-Rewriting Systems with Rule Priorities , 1989, Theor. Comput. Sci..

[21]  Robin Milner.  Functions as Processes , 1990, ICALP.

[22]  Tobias Nipkow.  Orthogonal Higher-Order Rewrite Systems are Confluent , 1993, TLCA.