Abstract | ||
---|---|---|
We give in this paper a purely syntactical definition of input and output types of system F. We define the syntactical data types as input and output types. We show that any type with positive quantifiers is a syntactical data type and that an input type is an output type. We give some restrictions on the For All -elimination rule in order to prove that an output type is an input type. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1051/ita:2001117 | RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | DocType | Volume |
input type,output type,data type,system F | Journal | 35 |
Issue | ISSN | Citations |
3 | 0988-3754 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Samir Farkh | 1 | 2 | 1.11 |
Karim Nour | 2 | 65 | 15.07 |