- From: Eric Prud'hommeaux <eric@w3.org>
- Date: Wed, 19 Oct 2016 06:36:35 -0400
- To: Holger Knublauch <holger@topquadrant.com>
- Cc: public-data-shapes-wg@w3.org
* Holger Knublauch <holger@topquadrant.com> [2016-08-11 17:14+1000] > This looks like quite a mega feature, if sh:and and sh:or become overloaded > with very different meaning, requiring a new execution algorithm etc. What > about spawning this off into an extension, just like the SPARQL stuff is in > an extension? Persuing the extension idea (we explored the QCRs approach in another thread): I've added a partition definition to the abstract syntax [1] to define such an extension. [1] <https://w3c.github.io/data-shapes/shacl-abstract-syntax/index.html#dfn-PartitionConstraint> Doing so aligns ShEx and SHACL and allowing us to use the following translation from ShEx to SHACL: https://w3c.github.io/data-shapes/shacl-abstract-syntax/shex-to-shacl Without that, we don't know how to translate complex expressions with choices or repeated properties. -- -ericP office: +1.617.599.3509 mobile: +33.6.80.80.35.59 (eric@w3.org) Feel free to forward this message to any list for any purpose other than email address distribution. There are subtle nuances encoded in font variation and clever layout which can only be seen by printing this message on high-clay paper.
Received on Wednesday, 19 October 2016 10:36:42 UTC