- From: Solbrig, Harold R. <Solbrig.Harold@mayo.edu>
- Date: Thu, 10 Jul 2014 18:32:51 +0000
- To: "Peter F. Patel-Schneider" <pfpschneider@gmail.com>, "public-rdf-shapes@w3.org" <public-rdf-shapes@w3.org>
- Cc: Jim Davies <jim.davies@cs.ox.ac.uk>
Peter, Z cannot fully represent complete cycles. We have included a partially defined function (evalRuleš) in section 4 that is declared (informally) to be equivalent to evalRule. The cycle described in the primer is realized by the evalTermReference (http://www.w3.org/Submission/2014/SUBM-shex-defn-20140602/#x1-170004.1). Cheers, Harold Solbrig On 7/10/14, 11:20 AM, "Peter F. Patel-Schneider" <pfpschneider@gmail.com> wrote: >The Shape Expressions 1.0 Primer, >http://www.w3.org/Submission/shex-primer/, >mentions cyclic rules, but there is no discussion of cyclic rules in the >Shape >Expressions 1.0 Definition, http://www.w3.org/Submission/shex-defn/. > >I was trying to puzzle through how cyclic rules would work. It appears >that >they depend on how recursive definitions work in Z. Can anyone tell me >how >recursive definitions work in Z, so that I don't have to do an in-depth >analysis of Z? > >Thanks, > >peter >
Received on Thursday, 10 July 2014 18:33:15 UTC