Context-sensitive Conditional Reduction Systems

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

[2]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

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

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

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

[6]  Jean-Jacques Lévy,et al.  Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

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

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

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

[10]  Z. Khasidashvili,et al.  -reductions and -developments of -terms with the Least Number of Steps , .

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

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

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

[14]  R. Milner.  Mathematical Centre Tracts , 1976 .

[15]  Carlos Loría-Sáenz,et al.  A theoretical framework for reasoning about program construction based on extensions of rewrite systems , 1993 .

[16]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

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

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

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

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

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

[22]  Zurab Khasidashvili.  Optimal Normalization in Orthogonal Term Rewriting Systems , 1993, RTA.

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

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

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

[26]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[27]  Robin Milner,et al.  Functions as processes , 1990, Mathematical Structures in Computer Science.