Abstract

A notion of type assignment on Curryfied Term Rewriting Systems is introduced that uses Intersection Types of Rank 2, and in which all function symbols are assumed to have a type. Type assignment will consist of specifying derivation rules that describe how types can be assigned to terms, using the types of function symbols. Using a modified unification procedure, for each term the principal pair (of basis and type) will be defined in the following sense: from these all admissible pairs can be generated by chains of operations on pairs, consisting of the operations substitution, copying, and weakening. In general, given an arbitrary typeable CuTRS, the subject reduction property does not hold. Using the principal type for the left-hand side of a rewrite rule, a sufficient and decidable condition will be formulated that typeable rewrite rules should satisfy in order to obtain this property. Introduction In the recent years, several paradigms have been investigated for the implementatio...

Citations

996	The Lambda Calculus, Its Syntax and Semantics - Barendregt - 1984
873	A theory of type polymorphism in programming - Milner - 1978
829	A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
723	Rewrite systems - Dershowitz, Jouannaud - 1990
550	Term rewriting systems - Klop - 1992
515	The Implementation of Functional Programming Languages - Jones - 1987
198	A Filter Lambda Model and the Completeness of Type Assignment - Barendregt, Coppo, et al. - 1983
155	A non-strict functional language with polymorphic types - Miranda - 1985
131	A calculus for overloaded functions with subtyping - Castagna, Ghelli, et al. - 1995
129	The system F of variable types, fifteen years later - Girard - 1986
98	Principles of OBJ2 - Futatsugi, Goguen, et al. - 1985
98	The principal type scheme of an object in combinatory logic - Hindley - 1969
90	Complete restrictions of the Intersection Type Discipline - Bakel - 1992
89	Term graph rewriting - Barendregt, Eekelen, et al. - 1987
86	Polymorphic Type Schemes and Recursive Definitions - Mycroft - 1984
82	Polymorphic type inference - Leivant - 1983
59	Concurrent clean - Nöcker, Smetsers, et al. - 1991
58	Clean: A language for functional graph rewriting - Brus, Eekelen, et al. - 1987
55	Principal type schemes for an extended type theory - Rocca, Venneri - 1984
50	Intersection Type Assignment Systems - Bakel - 1995
49	Functional Characters of Solvable Terms. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik - Coppo, Dezani-Ciancaglini, et al. - 1981
39	An extension of the basic functionality theory for the -calculus, Notre Dame J. of Formal Logic 21 - Coppo, Dezani-Ciancaglini - 1980
35	Term rewriting systems: A tutorial - Klop - 1987
27	A complete type inference algorithm for simple intersection types - Coppo, Giannini - 1992
26	Lambda Calculus with Patterns - Oostrom - 1990
25	Modularity of strong normalization and confluence in the algebraic-λ-cube - Barbanera, Fernández, et al. - 1994
20	Combining first and higher order rewrite systems with type assignment systems - Barbanera, Fernández - 1993
16	Partial Intersection Type Assignment in Applicative Term Rewriting Systems - Bakel - 1993
16	A meta-language for typed object-oriented languages - Castagna - 1995
16	Intersection types for combinatory logic - Dezani-Ciancaglini, Hindley - 1992
15	Modularity of termination and confluence in combinations of rewrite systems with λω - Barbanera, Fernández - 1993
12	Type reconstruction in finite-rank fragments of the second-order λ-calculus - Kfoury, Tiuryn - 1992
11	Strong normalization of typeable rewrite systems - Bakel, Fernandez - 1993
10	Partial Type Assignment in Left Linear Applicative Term Rewriting Systems - Bakel, Smetsers, et al. - 1992
10	A proper extension of ML with an effective type-assignment - Kfoury, Tiuryn, et al. - 1988
7	Head-)Normalization of Typeable Rewrite Systems - Bakel, Fernandez - 1995