Refinement Types: A Tutorial
Foundations and Trends® in Programming Languages · 2021
DOI: 10.1561/2500000032 ↗At a glance
Journal article in Foundations and Trends® in Programming Languages, 2021. Written by Ranjit Jhala and 1 co-authors. Cited 27 times so far (Crossref); 156 references.
Abstract (original language)
Refinement types enrich a language’s type system with logical predicates that circumscribe the set of values described by the type. These refinement predicates provide software developers a tunable knob with which to inform the type system about what invariants and correctness properties should be checked on their code, and give the type checker a way to enforce those properties at compile time. In this article, we distill the ideas developed in the substantial literature on refinement types into a unified tutorial that explains the key ingredients of modern refinement type systems. In particular, we show how to implement a refinement type checker via a progression of languages that incrementally add features to the language or type system.
Cite
APA
Jhala, R., & Vazou, N. (2021). Refinement Types: A Tutorial. Foundations and Trends® in Programming Languages. https://doi.org/10.1561/2500000032
Vancouver
Jhala R, Vazou N. Refinement Types: A Tutorial. Foundations and Trends® in Programming Languages. 2021. doi:10.1561/2500000032
BibTeX
@article{Jhala2021,
author = {Jhala, Ranjit and Vazou, Niki},
title = {Refinement Types: A Tutorial},
journal = {Foundations and Trends® in Programming Languages},
year = {2021},
doi = {10.1561/2500000032}
}
EUVIMED