(Enter summary)
Abstract: This paper introduces a notion of partial type assignment on applicative term rewriting systems that is
based on a combination of an essential intersection type assignment system, and the type assignment
system as defined for ML [16], both extensions of Curry's type assignment system [11]. Terms and
rewrite rules will be written as trees, and type assignment will consists of assigning intersection types
function symbols, and specifying the way in which types can be assigned to nodes and edges... (Update)
Context of citations to this paper: More
...has rewritten the specification. Such a rewrite would not be necessary if Rank 2 types are used (see Subsection 1. 2 for an example) In [2], Curryfied Term Rewriting Systems (CuTRS) were defined as the TRS that contain a special binary operator Ap. 1 The motivation for the use...
...strong normalization result of [4] complete the study of the normalization properties of typeable CTRS in intersection type systems. In [3] and [2] two partial intersection type assignment systems for TRS are presented. Apart from differences in syntax, the system we present...
Cited by: More
Principal Type Schemes for the Strict Type Assignment System - van Bakel (1993)
(Correct)
A New Presentation of the Intersection Type Discipline Through .. - Sayag, Mauny (1996)
(Correct)
(Head-)Normalization of Typeable Rewrite Systems - van Bakel, Fernández
(Correct)
Similar documents (at the sentence level): More
10.7%: Strong Normalization of Typeable Rewrite Systems - van Bakel, Fernández (1994)
(Correct)
8.9%: Essential Intersection Type Assignment - van Bakel (1993)
(Correct)
6.2%: Normalization Results for Typeable Rewrite Systems - van Bakel, Fernández (1997)
(Correct)
Active bibliography (related documents): More All
0.7: Partial Intersection Type Assignment in Applicative Term.. - van Bakel (1993)
(Correct)
0.4: Rank 2 Intersection Type Assignment in Term Rewriting Systems - van Bakel (1996)
(Correct)
0.3: Intersection Type Assignment Systems - van Bakel (1995)
(Correct)
Similar documents based on text: More All
0.9: Cut-Elimination in the Strict Intersection Type Assignment.. - van Bakel
(Correct)
0.2: Polymorphic Type Assignment and CPS Conversion - Harper, Lillibridge (1993)
(Correct)
0.2: Restricted intersection type assignment systems and object.. - de'Liguoro (2002)
(Correct)
Related documents from co-citation: More All
10: A filter lambda model and the completeness of type assignment (context) - Barendregt, Coppo et al. - 1983
9: Complete restrictions of the intersection type discipline
- van Bakel - 1992
7: Rewrite systems
- Dershowitz, Jouannaud - 1990
BibTeX entry: (Update)
S. van Bakel. Partial intersection type assignment in applicative term rewriting systems. In M. Bezem and J.F. Groote, editors, Proceedings of TLCA'93. International Conference on Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science. Springer-Verlag, 1993. http://citeseer.ist.psu.edu/article/vanbakel93partial.html More
@inproceedings{ vanbakel93partial,
author = "S. van Bakel",
title = "Partial Intersection Type Assignment in Applicative Term Rewriting Systems",
booktitle = "Typed Lambda Calculi and Applications; International Conference; {TLCA} '93",
publisher = "Springer-Verlag",
address = "Berlin, Germany",
editor = "M. Bezem and J. F. Groote",
isbn = "3-540-56517-5",
pages = "29--44",
year = "1993",
url = "citeseer.ist.psu.edu/article/vanbakel93partial.html" }
Citations (may not include all citations):
809
A theory of type polymorphism in programming (context) - Milner - 1978
788
Rewrite systems
- Dershowitz, Jouannaud - 1990
729
The Lambda Calculus: its Syntax and Semantics (context) - Barendregt - 1984
474
Term Rewriting Systems
- Klop - 1992
259
Combinatory Logic (context) - Curry, Feys - 1958
258
Miranda: A non-strict functional language with polymorphic t.. (context) - Turner - 1985
137
A filter lambda model and the completeness of type assignmen.. (context) - Barendregt, Coppo et al. - 1983
102
Term graph rewriting (context) - Barendregt, van Eekelen et al. - 1987
82
Principles of OBJ (context) - Futatsugi, Goguen et al. - 1985
75
Concurrent Clean
- Nocker, Smetsers et al. - 1991
68
An Extension of the Basic Functionality Theory for the -Calc.. (context) - Coppo, Dezani-Ciancaglini - 1980
67
Programming with Intersection Types and Bounded Polymorphism
- Pierce - 1991
63
Principal type schemes and -calculus semantics (context) - Coppo, Dezani-Ciancaglini et al. - 1980
54
Partial Polymorphic Type Inference and Higher-Order Unificat.. (context) - Pfenning - 1988
54
Principal type schemes for an extended type theory (context) - della, Venneri - 1984
41
Complete restrictions of the Intersection Type Discipline
- van Bakel - 1992
39
The spineless tagless G-machine (context) - Jones, Salkild - 1989
18
Principal type schemes for the Strict Type Assignment System
- van Bakel - 1993
13
Intersection types for combinatory logic (context) - Dezani-Ciancaglini, Hindley - 1992
7
Partial Intersection Type Assignment of Rank 2 in Applicativ.. (context) - van Bakel - 1992
4
Partial Type Assignment in Left Linear Applicative Term Rewr.. (context) - van Bakel, Smetsers et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.kun.nl/~clean/publications.html): More
The Implementation and Efficiency of Arrays in Clean 1.1 - van Groningen (1997)
(Correct)
A Framework for Deterministically Interleaved Interactive.. - Achten, Plasmeijer (1994)
(Correct)
Extending Graph Rewriting with Copying - Barendsen, Smetsers (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC