Abstract | ||
---|---|---|
General computational models obtained by integrating different specific models have recently become a stimulating and promising research subject. In particular, extensions of various λ-calculi with algebraic rewriting, 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 extended with first- and higher-order algebraic rewriting, and relevant properties, like strong normalization and completeness, are proved. |
Year | DOI | Venue |
---|---|---|
1996 | 10.1016/S0304-3975(96)00263-0 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
intersection type assignment system,higher-order algebraic | Journal | 170 |
Issue | ISSN | Citations |
1-2 | Theoretical Computer Science | 9 |
PageRank | References | Authors |
1.11 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Franco Barbanera | 1 | 357 | 35.14 |
Maribel Fernández | 2 | 9 | 1.11 |