Refinement types for Haskell
From MaRDI portal
Publication:2819690
DOI10.1145/2628136.2628161zbMath1345.68080OpenAlexW2045900383MaRDI QIDQ2819690
Dimitrios Vytiniotis, Ranjit Jhala, Eric L. Seidel, Niki Vazou, Simon L. Peyton Jones
Publication date: 29 September 2016
Published in: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.495.9202
Related Items (12)
ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs ⋮ Parameterized recursive refinement types for automated program verification ⋮ Embedded domain specific verifiers ⋮ On algebraic array theories ⋮ Higher order symbolic execution for contract verification and refutation ⋮ Modular Verification of Higher-Order Functional Programs ⋮ Learning inductive invariants by sampling from frequency distributions ⋮ A general semantic construction of dependent refinement type systems, categorically ⋮ Temporal refinements for guarded recursive types ⋮ Unnamed Item ⋮ LiquidHaskell ⋮ Ready,Set, Verify! Applyinghs-to-coqto real-world Haskell code
Uses Software
This page was built for publication: Refinement types for Haskell
