Typability and Type Inference in Atomic Polymorphism

04/28/2021
by   M. Clarence Protin, et al.
0

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 system Fat and show that these two problems are decidable in the atomic polymorphic system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2021

What's Decidable about (Atomic) Polymorphism

Due to the undecidability of most type-related properties of System F li...
research
03/31/2022

An Affine Type System with Hindley-Milner Style Type Inference

This article first provides an algorithm W based type inference algorith...
research
06/16/2022

Programs and algorithms for the shell decomposition of oscillating functions in space

Real-space refinement of atomic models in macromolecular crystallography...
research
08/24/2019

A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification

Network verification promises to detect errors, such as black holes and ...
research
01/16/2019

Atomic Loans: Cryptocurrency Debt Instruments

Atomic swaps enable the transfer of value between the cryptocurrencies o...
research
01/22/2020

Fine-grained Analysis on Fast Implementations of Multi-writer Atomic Registers

This draft in its current version proves an impossibility result concern...
research
03/25/2018

Proof nets and the instantiation overflow property

Instantiation overflow is the property of those second order types for w...

Please sign up or login with your details

Forgot password? Click here to reset