- From: Iovka Boneva via GitHub <sysbot+gh@w3.org>
- Date: Fri, 31 May 2024 08:45:40 +0000
- To: public-shex-dev@w3.org
I realize that, because now the typing contains labels and not shapes, isValid does not need to call satisfies. If completeTyping contained only those who satisfy exactly, then the definition of isValid(G, Sch, ism) could be for every (n, sl, exact) in ism, - if exact, completeTyping(G, Sch) contains (n, sl) - otherwise, completeTyping(G, Sch) contains (n, sl2) for some sl2 non abstract descendant of sl Now about the main question, does completeTyping need to have only the exactly satisfied shape expr labels, or also those that are satisfied by some descendant: I think we can do it this way. It is not yet completely clear for me whether the two are equivalent wrt the properties that we need for completeTyping, so I preferred to be conservative. But after some thoughts I'm relatively confident that completeTyping restricted to those that satisfy exactly could also be ok. -- GitHub Notification of comment by iovka Please view or discuss this issue at https://github.com/shexSpec/spec/issues/62#issuecomment-2141519015 using your GitHub account -- Sent via github-notify-ml as configured in https://github.com/w3c/github-notify-ml-config
Received on Friday, 31 May 2024 08:45:41 UTC