A refinement type is a type endowed with a predicate which is assumed to hold for any element of the refined type. "Refined" are libraries in Scala and Haskell for refining types.
In type theory, a refinement type is a type endowed with a predicate which is assumed to hold for any element of the refined type. Connected with dependent types.
In Scala refined types are types like type A { type T = ... }
. Connected with compound types and structural types.
refined is a Scala library for refining types with type-level predicates which constrain the set of values described by the refined type. It started as a port of the refined Haskell library.