forked from purescript/purescript-prelude
/
BooleanAlgebra.purs
45 lines (39 loc) · 1.81 KB
/
BooleanAlgebra.purs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
module Data.BooleanAlgebra
( class BooleanAlgebra
, module Data.HeytingAlgebra
, class BooleanAlgebraRecord
) where
import Data.HeytingAlgebra (class HeytingAlgebra, class HeytingAlgebraRecord, ff, tt, implies, conj, disj, not, (&&), (||))
import Data.Symbol (class IsSymbol)
import Data.Unit (Unit)
import Prim.Row as Row
import Prim.RowList as RL
import Type.Proxy (Proxy, Proxy2, Proxy3)
-- | The `BooleanAlgebra` type class represents types that behave like boolean
-- | values.
-- |
-- | Instances should satisfy the following laws in addition to the
-- | `HeytingAlgebra` law:
-- |
-- | - Excluded middle:
-- | - `a || not a = tt`
class HeytingAlgebra a <= BooleanAlgebra a
instance booleanAlgebraBoolean :: BooleanAlgebra Boolean
instance booleanAlgebraUnit :: BooleanAlgebra Unit
instance booleanAlgebraFn :: BooleanAlgebra b => BooleanAlgebra (a -> b)
instance booleanAlgebraRecord :: (RL.RowToList row list, BooleanAlgebraRecord list row row) => BooleanAlgebra (Record row)
instance booleanAlgebraProxy :: BooleanAlgebra (Proxy a)
instance booleanAlgebraProxy2 :: BooleanAlgebra (Proxy2 a)
instance booleanAlgebraProxy3 :: BooleanAlgebra (Proxy3 a)
-- | A class for records where all fields have `BooleanAlgebra` instances, used
-- | to implement the `BooleanAlgebra` instance for records.
class BooleanAlgebraRecord :: RL.RowList Type -> Row Type -> Row Type -> Constraint
class HeytingAlgebraRecord rowlist row subrow <= BooleanAlgebraRecord rowlist row subrow | rowlist -> subrow
instance booleanAlgebraRecordNil :: BooleanAlgebraRecord RL.Nil row ()
instance booleanAlgebraRecordCons
:: ( IsSymbol key
, Row.Cons key focus subrowTail subrow
, BooleanAlgebraRecord rowlistTail row subrowTail
, BooleanAlgebra focus
)
=> BooleanAlgebraRecord (RL.Cons key focus rowlistTail) row subrow