-
Notifications
You must be signed in to change notification settings - Fork 248
[Add] Properties for DCPOs in Relation.Binary.Properties.Domain
#2734
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
Conversation
Relation.Binary.Properties.Domain
Relation.Binary.Properties.Domain
→ (scott : IsScottContinuous P Q f) | ||
→ IsOrderHomomorphism (Poset._≈_ P) (Poset._≈_ Q) (Poset._≤_ P) (Poset._≤_ Q) f | ||
DirectedCompletePartialOrder+scott→monotone P-DirectedCompletePartialOrder f scott = record | ||
{ cong = λ {x} {y} x≈y → IsScottContinuous.preserveEquality scott x≈y |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Don't name implicits that you do not use. Try to eta-reduce too.
→ IsOrderHomomorphism (Poset._≈_ P) (Poset._≈_ Q) (Poset._≤_ P) (Poset._≤_ Q) f | ||
DirectedCompletePartialOrder+scott→monotone P-DirectedCompletePartialOrder f scott = record | ||
{ cong = λ {x} {y} x≈y → IsScottContinuous.preserveEquality scott x≈y | ||
; mono = λ {x} {y} x≤y → mono-proof x y x≤y |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
See if you can get away with _
for x
and y
in the rhs. If so, then make them implicit in the proof below. Otherwise leave a comment about not being able to do that.
This pull request introduces new modules and properties for directed complete partial orders (DCPOs) in the Agda standard library. These additions are adapted from the 1Lab library.
The first part of this pull request is available at [Add] Initial files for Domain theory #2721 .
Please comment only on the
src/Relation/Binary/Properties/Domain.agda
file hereKey Changes:
1. Properties of Least Upper Bounds:
uniqueLub:
Proves the uniqueness of least upper bounds.IsLub-cong
: Demonstrates congruence of least upper bounds under equivalence.2. Scott Continuity and Monotonicity:
DirectedCompletePartialOrder+scott→monotone
: Proves that Scott continuous functions are monotone.3. Scott Continuous Functions:
ScottId
: Identity function as a Scott continuous function.scott-∘
: Composition of Scott continuous functions.4. Suprema and Pointwise Ordering:
⋃-pointwise
: Proves pointwise ordering of suprema in directed families.5. Scott Continuity Module:
pres-⋁
: Proves preservation of least upper bounds under Scott continuous functions.6. Conversion to Scott Continuity:
-Added
to-scott
: Converts monotone functions with preservation of least upper bounds into Scott continuous functions.Source :
1Lab library