Dynamic type inference for gradual Hindley–Milner typing

Yusuke Miyazaki; Taro Sekiyama; Atsushi Igarashi

doi:10.1145/3290331

Dynamic type inference for gradual Hindley–Milner typing

Proceedings of the ACM on Programming Languages ◽

10.1145/3290331 ◽

2019 ◽

Vol 3 (POPL) ◽

pp. 1-29

Author(s):

Yusuke Miyazaki ◽

Taro Sekiyama ◽

Atsushi Igarashi

Keyword(s):

Type Inference ◽

Dynamic Type

Download Full-text

Garbage collection via dynamic type inference - A formal treatment -

Lecture Notes in Computer Science - Types in Compilation ◽

10.1007/bfb0055520 ◽

1998 ◽

pp. 215-239 ◽

Cited By ~ 1

Author(s):

Haruo Hosoya ◽

Akinori Yonezawa

Keyword(s):

Garbage Collection ◽

Type Inference ◽

Formal Treatment ◽

Dynamic Type

Download Full-text

The MAGICA Type Inference Engine for MATLAB ®

Lecture Notes in Computer Science - Compiler Construction ◽

10.1007/3-540-36579-6_9 ◽

2003 ◽

pp. 121-125 ◽

Cited By ~ 8

Author(s):

Pramod G. Joisha ◽

Prithviraj Banerjee

Keyword(s):

Inference Engine ◽

Type Inference

Download Full-text

Polymorphic type inference for machine code

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2016 ◽

10.1145/2908080.2908119 ◽

2016 ◽

Cited By ~ 8

Author(s):

Matt Noonan ◽

Alexey Loginov ◽

David Cok

Keyword(s):

Type Inference ◽

Machine Code ◽

Polymorphic Type

Download Full-text

Iterative type inference with attribute grammars

ACM SIGPLAN Notices ◽

10.1145/1942788.1868302 ◽

2011 ◽

Vol 46 (2) ◽

pp. 43-52 ◽

Cited By ~ 1

Author(s):

Arie Middelkoop ◽

Atze Dijkstra ◽

S. Doaitse Swierstra

Keyword(s):

Type Inference ◽

Attribute Grammars

Download Full-text

A practical framework for type inference error explanation

ACM SIGPLAN Notices ◽

10.1145/3022671.2983994 ◽

2016 ◽

Vol 51 (10) ◽

pp. 781-799 ◽

Cited By ~ 4

Author(s):

Calvin Loncaric ◽

Satish Chandra ◽

Cole Schlesinger ◽

Manu Sridharan

Keyword(s):

Type Inference ◽

Error Explanation

Download Full-text

Type Inference: Some Results, Some Problems1

Fundamenta Informaticae ◽

10.3233/fi-1993-191-205 ◽

1993 ◽

Vol 19 (1-2) ◽

pp. 87-125

Author(s):

Paola Giannini ◽

Furio Honsell ◽

Simona Ronchi Della Rocca

Keyword(s):

Large Class ◽

Higher Order ◽

Type Inference ◽

Principal Type ◽

Open Problems ◽

Inference Problem ◽

Type Assignment ◽

Unification Problem

In this paper we investigate the type inference problem for a large class of type assignment systems for the λ-calculus. This is the problem of determining if a term has a type in a given system. We discuss, in particular, a collection of type assignment systems which correspond to the typed systems of Barendregt’s “cube”. Type dependencies being shown redundant, we focus on the strongest of all, Fω, the type assignment version of the system Fω of Girard. In order to manipulate uniformly type inferences we give a syntax directed presentation of Fω and introduce the notions of scheme and of principal type scheme. Making essential use of them, we succeed in reducing the type inference problem for Fω to a restriction of the higher order semi-unification problem and in showing that the conditional type inference problem for Fω is undecidable. Throughout the paper we call attention to open problems and formulate some conjectures.

Download Full-text