| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9655873 | Electronic Notes in Theoretical Computer Science | 2005 | 46 Pages |
Abstract
We do not provide a comprehensive survey of type systems appropriate for polymorphic recursion, with or without type annotations inserted in the source language. Rather, we focus on examples for which types may be inferred without type annotations, with an emphasis on systems of intersection- types.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
J.J. Hallett, A.J. Kfoury,