Re: cyclic rules

I have tried your example in both implementations and it passes without
infinite loops.

You can check it here:

Eric's implementaion: http://goo.gl/kBbgCZ
Shexcala implementation: http://goo.gl/rUJ8OS


Best regards, Jose Labra


On Thu, Jul 10, 2014 at 9:24 PM, Peter F. Patel-Schneider <
pfpschneider@gmail.com> wrote:

> Doesn't this cause an infinite loop on cyclic rules when there are cycles
> in the RDF graph?
>
> Consider, for example
>
> schema:
>   <FooShape> {
>     :patron <FooShape>
>   }
>
> data:
>   <Foo> :patron <Foo> .
>
>
> peter
>
>
>
> On 07/10/2014 11:32 AM, Solbrig, Harold R. wrote:
>
>> 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
>>>
>>>
>>
>>
>


-- 
Saludos, Labra