DeepAI AI Chat

An Affine Type System with Hindley-Milner Style Type Inference

03/31/2022

∙

by Gonglin Li, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

∙ 04/28/2021

Typability and Type Inference in Atomic Polymorphism

It is well-known that typability, type inhabitation and type inference a...

0 M. Clarence Protin, et al. ∙

∙ 10/14/2017

Two-player incentive compatible mechanisms are affine maximizers

In mechanism design, for a given type space, there may be incentive comp...

0 Bo Lin, et al. ∙

∙ 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...

0 Bo Lin, et al. ∙

∙ 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...

0 Benjamin Chase, et al. ∙

∙ 05/11/2020

Computational Adequacy for Substructural Lambda Calculi

Substructural type systems, such as affine (and linear) type systems, ar...

0 Vladimir Zamdzhiev, et al. ∙

∙ 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...

0 Vladimir Zamdzhiev, et al. ∙

∙ 11/01/2019

Modular Inference of Linear Types for Multiplicity-Annotated Arrows

Bernardy et al. [2018] proposed a linear type system λ^q_→ as a core typ...

0 Kazutaka Matsuda, et al. ∙