-
Notifications
You must be signed in to change notification settings - Fork 239
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
Rename WeaklyDecidable
?
#2404
Comments
|
Reflecting on #2330 / #2336 and #2059 / #2405 , it's hard not to think that the use of One thing that is noteworthy about the use of |
I wouldn't quite use 'deprecate' to describe the situation, although I think we agree on the core: we have to opportunity to benefit from dependent types here, and yet by being too Haskell-like, we don't, even when we could (i..e
|
' |
In #2330 / #2336 @JacquesCarette objects to the term-of-art
WeaklyDecidable
(underRelation.Unary
andRelation.Binary.Definitions
) as the predicate/relation lifting ofMaybe
to proxy for (the result type of) semi-decidable properties (just
=def "definitely true, with a witness";nothing
=def "don't know"), where by contrast with the usual recursion-theoretic terminology, because functions returning a 'WeaklyDecidable' result are by assumption total, we have a slightly sharper meaning/intention than being 'merely' semi-decidable...So a question arises, as to whether we continue with the (arguably, unsatisfactory) present terminology/naming, or deprecate in favour of something else... in which case what?
I guess I personally could be happy with
SemiDecidable
, provided we comment appropriately as to the above sharpening of the usual meaning... alternatively such a name could be reserved for (a renaming of) thecodata
notion ofDelay
... in which case what do we call "total semi-decidable properties"? (I hope notTotalSemiDecidable
! ;-))The text was updated successfully, but these errors were encountered: