LICS   1997 Symposium on Logic in Computer Science
Wall of Fame | Most Viewed LICS-1997 Paper
11 years 4 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source174
2Download preprint from source157
3Download preprint from source139
4Download preprint from source129
5Download preprint from source128
6Download preprint from source123
7Download preprint from source119
8Download preprint from source113
9Download preprint from source111
10Download preprint from source110
11Download preprint from source101
12Download preprint from source100
13Download preprint from source98
14Download preprint from source94
15Download preprint from source86
16Download preprint from source84
17Download preprint from source77
18Download preprint from source73