Yet another contract library for JavaScript which benefits from static analyzers such as TAJS.
-
Updated
Jun 11, 2018 - JavaScript
Yet another contract library for JavaScript which benefits from static analyzers such as TAJS.
A set of type providers for F# that aims to implement an approximation of refinement types.
Implementation of a language with Refinement Types
Implementations of data structures from Okasaki's "Purely Functional Data Structures" verified using LiquidHaskell
Examples shown in my talk "Why types matter". See also https://github.com/gvolpe/par-dual
Simple Refinement types for F#. No longer maintained.
Toy Scala project to study some cool Functional Programming concepts (version 1 was in Java)
A refinement type checker for simply typed lamda calculus with inductive data-types and well-founded recursive functions
Refinement types for Python
No-macro, no-reflection, opinionated type refinement library for Scala 3
ReTHFL: νHFL(Z) (aka higher-order CHC) solver based on refinement types
Constrain or Compose on the fly your .NET Types.
Proper types for your domain
`refined_type` is a library that facilitates type composition, enabling the simple description of efficient validation processes and high runtime safety.
Add a description, image, and links to the refinement-types topic page so that developers can more easily learn about it.
To associate your repository with the refinement-types topic, visit your repo's landing page and select "manage topics."