Simple unification-based type inference for GADTs

By Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn. ACM SIGPLAN International Conference on Functional Programming, 2006

370 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/3b6c69a78bafa0d852f5287284337a8b13a3cc5f

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

1. Ranjit Jhala
2. Dimitrios Vytiniotis
3. Eric L. Seidel
4. Niki Vazou
5. Simon L. Peyton Jones
6. G. Mainland
7. Matt Welsh
8. Greg Morrisett

In Computer Networks and Communications

1. G. Mainland
2. Greg Morrisett
3. Ranjit Jhala
4. Matt Welsh

In Hardware and Architecture

1. Ranjit Jhala
2. G. Mainland
3. Matt Welsh
4. Greg Morrisett

Citations in the corpus

• Flask (2008, methodology): “A middle-ground solution would be to reflect the object language’s types as Haskell types and then encode the object language’s abstract syntax using GADTs (Xi et al. 2003; Jones et al. 2006).”
• Refinement types for Haskell (2014, background): “Haskell itself can be used to fake “lightweight” dependent types [11, 16, 30].”