@@ -5,12 +5,13 @@ import Prelude
55import Control.Comonad (class Comonad )
66import Control.Extend (class Extend )
77import Control.Lazy as CL
8+ import Data.Eq (class Eq1 )
89import Data.Foldable (class Foldable , foldMap , foldl , foldr )
910import Data.FoldableWithIndex (class FoldableWithIndex )
1011import Data.Functor.Invariant (class Invariant , imapF )
1112import Data.FunctorWithIndex (class FunctorWithIndex )
1213import Data.HeytingAlgebra (implies , ff , tt )
13- import Data.Monoid (class Monoid , mempty )
14+ import Data.Ord (class Ord1 )
1415import Data.Semigroup.Foldable (class Foldable1 , fold1Default )
1516import Data.Semigroup.Traversable (class Traversable1 )
1617import Data.Traversable (class Traversable , traverse )
@@ -55,9 +56,13 @@ instance fieldLazy :: Field a => Field (Lazy a)
5556instance eqLazy :: Eq a => Eq (Lazy a ) where
5657 eq x y = (force x) == (force y)
5758
59+ derive instance eq1Lazy :: Eq1 Lazy
60+
5861instance ordLazy :: Ord a => Ord (Lazy a ) where
5962 compare x y = compare (force x) (force y)
6063
64+ derive instance ord1Lazy :: Ord1 Lazy
65+
6166instance boundedLazy :: Bounded a => Bounded (Lazy a ) where
6267 top = defer \_ -> top
6368 bottom = defer \_ -> bottom
0 commit comments