Gradual typing with unification-based inference
By Jeremy G. Siek, Manish Vachharajani. 2008
81 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Hardware and Architecture, Information Systems, Program Analysis & Verification, Software Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Arjun Guha
- Ming-Ho Yee
- Yusuke Miyazaki
- Atsushi Igarashi
- Taro Sekiyama
- Sheng Chen
- Martin Erwig
- Eric Walkingshaw
In Hardware and Architecture
- Arjun Guha
- Ming-Ho Yee
- Yusuke Miyazaki
- Atsushi Igarashi
- Taro Sekiyama
- Sheng Chen
- Martin Erwig
- Eric Walkingshaw
In Information Systems
- Arjun Guha
- Ming-Ho Yee
- Yusuke Miyazaki
- Atsushi Igarashi
- Taro Sekiyama
- Sheng Chen
- Martin Erwig
- Eric Walkingshaw
In Program Analysis & Verification
- Arjun Guha
- Ming-Ho Yee
- Yusuke Miyazaki
- Atsushi Igarashi
- Taro Sekiyama
- Sheng Chen
- Martin Erwig
- Eric Walkingshaw
In Software Engineering
- Arjun Guha
- Ming-Ho Yee
- Matteo Cimini
- Ronald Garcia
- Giuseppe Castagna
- Victor Lanvin
- Tommaso Petrucciani
- Yusuke Miyazaki
Citations in the corpus
- Do Machine Learning Models Produce TypeScript Types that Type Check? (2023, methodology): “The earliest approach was a variation of unification-based type inference [47], and more recent work uses a wide range of techniques [9, 12, 21, 34, 35, 40].”
- Principal Type Schemes for Gradual Programs (2015, background): “This problem was investigated first by Siek and Vachharajani (2008), defining λ ? α → , a gradual type inference system and algorithm that infers gradual types, but rejects ill-typed static programs.”
- Gradual typing: a new perspective (2019, methodology): “By annotating x with the gradual type ?, the type reconstruction system for gradual types of Siek and Vachharajani [2008a] can type this piece of code with Bool → (α → β) → ? → ?.”
- The ins and outs of gradual type inference (2012, background): “Categories and Subject Descriptors D.3.4 [Programming Languages]: Processors Optimization; F.3.2 [Logics and Meaning of Programs]: Semantics of Programming Languages Program analysis; F.3.3 [Logics and Meaning of Programs]: Studies of Program Constructs Type structure General Terms Algorithms,…”
- Dynamic type inference for gradual Hindley–Milner typing (2018, methodology): “The core of the λ B calculus is based on the calculus by Siek et al. [2015a], which is a simplified version of the blame calculus by Wadler and Findler [2009] without refinement types.”
- Migrating gradual types (2017, methodology): “Siek & Vachharajani (2008) and Garcia & Cimini (2015) further investigated gradual typing in the presence of type inference.”
- A Gradual Type System for Elixir (2020, background): “1Also known as naive subtyping [17], less or equally informative [12], or materialization [3] in the context of gradual typing.”