data ZeroOne : Rel a -> a -> a -> Type Reflexive closure of a relation
Totality: total
Visibility: public export
Constructors:
Zero : (0 _ : x = y) -> ZeroOne p x y One : p x y -@ ZeroOne p x y
Hint: Reflexive a (ZeroOne p)
ZeroEq : ZeroOne p x x Convenience constructor
Totality: total
Visibility: exportsingleton : p x y -> ZeroOne p x y Unrestricted 'One'
Totality: total
Visibility: exportmapReduceLOnce : {0 f : a -> b} -> {0 q : Rel b} -> p x y -@ q (f x) (f y) -> q (f x) (f x) -> ZeroOne p x y -@ q (f x) (f y) Linear 'mapReduceL'
Totality: total
Visibility: exportmapReduceROnce : {0 f : a -> b} -> {0 q : Rel b} -> p x y -@ q (f x) (f y) -> q (f y) (f y) -> ZeroOne p x y -@ q (f x) (f y) Linear 'mapReduceR'
Totality: total
Visibility: exportmapOnce : {0 f : a -> b} -> p x y -@ q (f x) (f y) -> ZeroOne p x y -@ ZeroOne q (f x) (f y) Linear 'map'
Totality: total
Visibility: exportmapReduceL : {0 f : a -> b} -> {0 q : Rel b} -> (p x y -> q (f x) (f y)) -> q (f x) (f x) -> ZeroOne p x y -> q (f x) (f y) Reduce to left index, while changing relation
Totality: total
Visibility: exportmapReduceR : {0 f : a -> b} -> {0 q : Rel b} -> (p x y -> q (f x) (f y)) -> q (f y) (f y) -> ZeroOne p x y -> q (f x) (f y) Reduce to right index, while changing relation
Totality: total
Visibility: exportmap : {0 f : a -> b} -> (p x y -> q (f x) (f y)) -> ZeroOne p x y -> ZeroOne q (f x) (f y) Change inner relation
Totality: total
Visibility: exportreduceLOnce : p x x -> ZeroOne p x y -@ p x y Linear 'reduceL'
Totality: total
Visibility: exportreduceL : p x x -> ZeroOne p x y -> p x y Reduce to left index
Totality: total
Visibility: exportreduceROnce : p y y -> ZeroOne p x y -@ p x y Linear 'reduceR'
Totality: total
Visibility: exportreduceR : p y y -> ZeroOne p x y -> p x y Reduce to right index
Totality: total
Visibility: export