Typability and Type Inference in Atomic Polymorphism release_dbj626mzmvgtrlg5a2xhjyhy74

by M. Clarence Protin, Gilda Ferreira

Released as a article .

2022  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  264.6 kB
file_o3onlv7xljcxrfpja6nuck55mi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2022-07-14
Version   v4
Language   en ?
arXiv  2104.13675v4
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 1a99603c-ab1f-48d4-8990-e0248b01ec7e
API URL: JSON