The ins and outs of gradual type inference
By Aseem Rastogi, Avik Chaudhuri, Basil Hosmer. 2012
83 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
- Ming-Ho Yee
- Arjun Guha
- Erik Krogh Kristensen
- Anders Møller
- Yusuke Miyazaki
- Atsushi Igarashi
- Taro Sekiyama
- Sheng Chen
In Hardware and Architecture
- Anders Møller
- Erik Krogh Kristensen
- Ming-Ho Yee
- Arjun Guha
- Yusuke Miyazaki
- Atsushi Igarashi
- Taro Sekiyama
- Sheng Chen
In Information Systems
- Erik Krogh Kristensen
- Arjun Guha
- Ming-Ho Yee
- Anders Møller
- Yusuke Miyazaki
- Atsushi Igarashi
- Taro Sekiyama
- Sheng Chen
In Program Analysis & Verification
- Ming-Ho Yee
- Arjun Guha
- Erik Krogh Kristensen
- Anders Møller
- Yusuke Miyazaki
- Atsushi Igarashi
- Taro Sekiyama
- Sheng Chen
In Software Engineering
- Erik Krogh Kristensen
- Ming-Ho Yee
- Arjun Guha
- Anders Møller
- Matteo Cimini
- Ronald Garcia
- Yusuke Miyazaki
- Atsushi Igarashi
Citations in the corpus
- Do Machine Learning Models Produce TypeScript Types that Type Check? (2023, background): “Rastogi et al. [42] infer gradual types for ActionScript to improve performance.”
- Migrating gradual types (2017, methodology): “calculus and extend it with annotations for dynamic types (Siek & Vachharajani, 2008; Rastogi et al., 2012; Garcia & Cimini, 2015).”
- MaxSMT-Based Type Inference for Python 3 (2018, background): “A similar spectrum of solutions exists for other dynamic programming languages like JavaScript [2,14] and ActionScript [21].”
- Solver-based gradual type migration (2021, methodology): “Because the function receives an integer for x , Rastogi et al. [2012] and TypeWhich give x the type int.”
- Principal Type Schemes for Gradual Programs (2015, background): “DL and HL have close ties to research on using types to improve the performance of dynamic languages (Cartwright and Fagan 1991; Rastogi et al. 2012; Swamy et al. 2014).”
- Type inference for static compilation of JavaScript (2016, methodology): “First, type propagation computes lower and upper bounds for every row variable, extending techniques from previous work [22, 35].”
- Inference and Evolution of TypeScript Declaration Files (2017, methodology): “Other research on TypeScript includes formalization and variations of its type system [4,17,18,22], and several alternative techniques for JavaScript type inference exist [16,11,6], however, none of that work addresses the challenges that arise when integrating JavaScript libraries into typed applic”
- Dynamic type inference for gradual Hindley–Milner typing (2018, background): “Shields et al. [1998] propose a combination of dynamic typing and staged computation [Davies and Pfenning 2001; Taha and Sheard 2000] in a statically typed language.”
- Design and evaluation of gradual typing for python (2014, background): “[21] develop an approach for inferring the types of locals variables, parameters, and return types.”
- Gradual Soundness: Lessons from Static Python (2022, background): “Industry teams have developed innovative optional type systems that accommodate untyped designs, but are unsound [2, 7, 45, 63].”