Combining First and Higher Order Rewrite Systems with Type Assignment Systems

General computational models obtained by integrating different specific models have recently become a stimulating and promising research subject for the computer science community. In particular, combinations of algebraic term rewriting systems and various λ-calculi, either typed or untyped, have been deeply investigated. In the present paper this subject is addressed from the point of view of type assignment. A powerful type assignment system, the one based on intersection types, is combined with term rewriting systems, first and higher order, and relevant properties of the resulting system, like strong normalization and confluence, are proved.

[1]  Jan Willem Klop,et al.  Term rewriting systems: a tutorial , 1987 .

[2]  Franco Barbanera,et al.  Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved , 1990, CTRS.

[3]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[4]  Daniel J. Dougherty.  Adding Algebraic Rewriting to the Untyped Lambda Calculus , 1992, Inf. Comput..

[5]  Mitsuhiro Okada,et al.  Strong normalizability for the combined system of the typed lmbda calculus and an arbitrary convergent term rewrite system , 1989, ISSAC '89.

[6]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[7]  Daniel Leivant,et al.  Typing and Computational Properties of Lambda Expressions , 1986, Theor. Comput. Sci..

[8]  Franco Barbanera.  Combining Term Rewriting and Type Assignment Systems , 1990, Int. J. Found. Comput. Sci..

[9]  Val Tannen,et al.  Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence Val Tannen , 2011 .

[10]  M. Newman.  On Theories with a Combinatorial Definition of "Equivalence" , 1942 .

[11]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[12]  V. Breazu-Tannen,et al.  Combining algebra and higher-order types , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[13]  Val Tannen,et al.  Polymorphic Rewriting Conserves Algebraic Strong Normalization , 1991, Theor. Comput. Sci..

[14]  J. Girard,et al.  Proofs and types , 1989 .

[15]  Steffen van Bakel,et al.  Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems , 1992, CAAP.

[16]  Yoshihito Toyama,et al.  Counterexamples to Termination for the Direct Sum of Term Rewriting Systems , 1987, Inf. Process. Lett..

[17]  Daniel J. Dougherty.  Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract) , 1991, RTA.

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

[19]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[20]  Jean-Pierre Jouannaud,et al.  A computation model for executable higher-order algebraic specification languages , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[21]  F. Cardone,et al.  Two extensions of Curry's type inference system , 1990 .

[22]  Tobias Nipkow,et al.  Higher-order critical pairs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.