An Affine Type System with Hindley-Milner Style Type Inference

03/31/2022
by   Gonglin Li, et al.
0

This article first provides an algorithm W based type inference algorithm for an affine type system. Then the article further assumes the language equipped with the above type system uses lazy evaluation, and explores the possibility of representing the !-modality as a user-defined type synonym with the power of the newly gained polymorphism.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/28/2021

Typability and Type Inference in Atomic Polymorphism

It is well-known that typability, type inhabitation and type inference a...
research
10/14/2017

Two-player incentive compatible mechanisms are affine maximizers

In mechanism design, for a given type space, there may be incentive comp...
research
10/14/2017

Two-player incentive compatible outcome functions are affine maximizers

In mechanism design, for a given type space, there may be incentive comp...
research
09/13/2020

Kim-type APN functions are affine equivalent to Gold functions

The problem of finding APN permutations of 𝔽_2^n where n is even and n>6...
research
07/20/2022

Constraint-based type inference for FreezeML

FreezeML is a new approach to first-class polymorphic type inference tha...
research
08/05/2020

On Decidability of 2-process Affine Models

An affine model of computation is defined as a subset of iterated immedi...
research
01/19/2020

Semantics for first-order affine inductive data types via slice categories

Affine type systems are substructural type systems where copying of info...

Please sign up or login with your details

Forgot password? Click here to reset