We consider several different definitions of type assignment with positive recursive types, from the point of view of their typing ability. We discuss the relationships between these systems. In particular, we show that the class of typable pure lambda terms remains the same for different type disciplines involving positive type fixpoints, and that type reconstruction is decidable.
CITATION STYLE
Urzyczyn, P. (1995). Positive recursive type assignment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 969, pp. 382–391). Springer Verlag. https://doi.org/10.1007/3-540-60246-1_144
Mendeley helps you to discover research relevant for your work.