Liquid types
By Patrick Maxim Rondon. ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2008
444 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems
View Paper: https://www.semanticscholar.org/paper/285bd55c6a7f4a1e829ecf5cd380900070ca6223
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
- Daniel Kifer
- Justin Hsu
- Gilles Barthe
- Danfeng Zhang
- Marco Gaboardi
- Pierre-Yves Strub
- Santiago Zanella-B'eguelin
- Earl T. Barr
In Computational Theory and Mathematics
- Panagiotis Vekris
- Benjamin Cosman
- Ranjit Jhala
- Gilles Barthe
- Santiago Zanella-B'eguelin
- A. Gordon
- Irene Vlassi Pandi
- Aaron Roth
In Information Systems
- Charles Sutton
- Earl T. Barr
- A. Gordon
- Gilles Barthe
- Miltiadis Allamanis
- Panagiotis Vekris
- Irene Vlassi Pandi
- Justin Hsu
Citations in the corpus
- Fast and precise type checking for JavaScript (2017, methodology): “[2016] offer refinement type inference for TypeScript, based on Liquid Type inference [Rondon et al. 2008].”
- OptTyper: Probabilistic Type Inference by Optimising Logical and Natural Constraints (2020, methodology): “DSOLVE is an early application of liquid type inference in OCAML [Rondon et al. 2008].”
- Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy (2014, background): “Advances in SMT solvers have allowed practical systems that support refinement types through SMT back-ends, for instance F7 [5], F‹ [51], and LIQUIDHASKELL [49].”
- Dependent types and multi-monadic effects in F* (2016, methodology): “More recently, old-F ⋆ (Swamy et al. 2013a) adds value-dependent types to an ML-like language; Rondon et al. (2008) add decidable, refinement types to OCaml and Vazou et al. (2014) adapt that work to Haskell—we have compared these prior refinement type systems to F ⋆ in § 3.2.”
- Refinement types for Haskell (2014, methodology): “First, let us see how standard refinement type systems [21, 26] will use the refinement type aliases Pos and Nat and the specification for div from § 1 to accept good and reject bad .”
- Refinement types for TypeScript (2016, methodology): “In contrast, mutability modifiers have proven to be lightweight [39] and two-phase typing lets rsc use liquid refinement inference [26], yielding a system that is more practical for real world programs.”