Bounded refinement types

DOI10.1145/2784731.2784745zbMath1360.68343arXiv1507.00385OpenAlexW2152456366MaRDI QIDQ2981942

Niki Vazou, Alexander Bakst, Ranjit Jhala

Publication date: 10 May 2017

Published in: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.00385

zbMATH Keywords

Haskellabstract interpretationrefinement types

Mathematics Subject Classification ID

Database theory (68P15) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Embedded domain specific verifiers

Uses Software

• Haskell

This page was built for publication: Bounded refinement types