An Affine Type System with Hindley-Milner Style Type Inference
Gonglin Li
TL;DR
This paper introduces an affine type system with Hindley-Milner style type inference, and explores representing the !-modality as a user-defined type synonym in lazy evaluation languages.
Contribution
It develops a type inference algorithm for an affine type system and demonstrates how to model the !-modality using polymorphism in lazy languages.
Findings
Type inference algorithm for affine types
Representation of !-modality as type synonym
Application to lazy evaluation languages
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Semantic Web and Ontologies · Authorship Attribution and Profiling