Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Language.REST.WQOConstraints.Lazy
Description
This module defines Lazy constraints on a WQO; the intention is that computations on this type do only the necessary amount of work to determine satisfiability (deferring further computations in a thunk).
Synopsis
- lazyOC :: Monad m => WQOConstraints LazyOC m
- addConstraint :: (Ord a, Hashable a) => WQO a -> LazyOC a -> LazyOC a
- isSatisfiable :: LazyOC a -> Bool
- noConstraints :: LazyOC a
- data LazyOC a
Documentation
addConstraint :: (Ord a, Hashable a) => WQO a -> LazyOC a -> LazyOC a Source #
addConstraint o c
strengthes c
to also contain every relation in o
isSatisfiable :: LazyOC a -> Bool Source #
Returns true
if any orderings are permitted
noConstraints :: LazyOC a Source #
Returns a new instance of LazyOC
permitting all WQOs
Implementation of Lazy ordering constraints.
Instances
Generic (LazyOC a) Source # | |
(Show a, Eq a, Ord a, Hashable a) => Show (LazyOC a) Source # | |
Eq a => Eq (LazyOC a) Source # | |
Ord a => Ord (LazyOC a) Source # | |
Defined in Language.REST.WQOConstraints.Lazy | |
Hashable a => Hashable (LazyOC a) Source # | |
Defined in Language.REST.WQOConstraints.Lazy | |
type Rep (LazyOC a) Source # | |
Defined in Language.REST.WQOConstraints.Lazy |