What’s Decidable About (Atomic) Polymorphism?

Pistone, Paolo; Tranchini, Luca

doi:10.4230/lipics.fscd.2021.27

Search citation statements

Order By: Relevance

Paper Sections

Select...

Vol 18:3 Typability and Type Inference In Atomic Polymorphis...1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Remark 5.2. In a recent work [PT21] Pistone and Tranchini proved that typability is decidable for Curry style F at . They do this by means of an alternative approach which involves reducing typability to the type checking problem (TC).…”

Section: Vol 18:3 Typability and Type Inference In Atomic Polymorphis...mentioning

confidence: 99%

Typability and Type Inference in Atomic Polymorphism

Protin¹,

Ferreira²

2022

Logical Methods in Computer Science

View full text Add to dashboard Cite

It is well-known that typability, type inhabitation and type inference are undecidable in the Girard-Reynolds polymorphic system F. It has recently been proven that type inhabitation remains undecidable even in the predicative fragment of system F in which all universal instantiations have an atomic witness (system Fat). In this paper we analyze typability and type inference in Curry style variants of system Fat and show that typability is decidable and that there is an algorithm for type inference which is capable of dealing with non-redundancy constraints.

show abstract

Section: Vol 18:3 Typability and Type Inference In Atomic Polymorphis...mentioning

confidence: 99%