on master help sign in
Correct Semilattice Implementations
commit194c86b8f6682f0f73f3d8801a94e5c6e0c89b62 authorSam Elliott <sam@lenary.co.uk> dateMon 14 Jul 2014, 17:33 (12 years ago) parent29c02f4
1 file changed+4−4
libs/prelude/Prelude/Algebra.idr+4−4
libs/prelude/Prelude/Algebra.idr+4−4
@@ -187,7 +187,7 @@ class MeetSemilattice a => VerifiedMeetSemilattice a where
187187||| + Idempotency of join:
188188||| forall a, join a a == a
189189||| + Bottom:
190−||| forall a, join a bottom == bottom
190+||| forall a, join a bottom == a
191191|||
192192||| Join semilattices capture the notion of sets with a "least upper bound"
193193||| equipped with a "bottom" element.
@@ -195,7 +195,7 @@ class JoinSemilattice a => BoundedJoinSemilattice a where
195195 bottom : a
196196
197197class (VerifiedJoinSemilattice a, BoundedJoinSemilattice a) => VerifiedBoundedJoinSemilattice a where
198− total boundedJoinSemilatticeBottomIsBottom : (e : a) -> join e bottom = bottom
198+ total boundedJoinSemilatticeBottomIsBottom : (e : a) -> join e bottom = e
199199
200200||| Sets equipped with a binary operation that is commutative, associative and
201201||| idempotent and supplied with a neutral element. Must satisfy the following
@@ -208,7 +208,7 @@ class (VerifiedJoinSemilattice a, BoundedJoinSemilattice a) => VerifiedBoundedJo
208208||| + Idempotency of meet:
209209||| forall a, meet a a == a
210210||| + Top:
211−||| forall a, meet a top == top
211+||| forall a, meet a top == a
212212|||
213213||| Meet semilattices capture the notion of sets with a "greatest lower bound"
214214||| equipped with a "top" element.
@@ -216,7 +216,7 @@ class MeetSemilattice a => BoundedMeetSemilattice a where
216216 top : a
217217
218218class (VerifiedMeetSemilattice a, BoundedMeetSemilattice a) => VerifiedBoundedMeetSemilattice a where
219− total boundedMeetSemilatticeTopIsTop : (e : a) -> meet e top = top
219+ total boundedMeetSemilatticeTopIsTop : (e : a) -> meet e top = e
220220
221221||| Sets equipped with two binary operations that are both commutative,
222222||| associative and idempotent, along with absorbtion laws for relating the two