Positive Recursive Type Assignment

Authors:
Paweł Urzyczyn
Affiliations:
Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097 Warsaw, Poland. urzy@mimuw.edu.pl
Venue:
Fundamenta Informaticae
Year:
1996

Citing 4
Cited 2

Type inference with recursive types: syntax and semantics

Information and Computation
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Positive Recursive Type Assignment

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Lambda Calculus with Constrained Types (Extended Abstract)

Proceedings of the Conference on Logic of Programs

Type fixpoints: iteration vs. recursion

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
A lean specification for GADTs: system F with first-class equality proofs

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.