W3C home > Mailing lists > Public > public-rif-wg@w3.org > April 2010

test case Named_Argument_Uniterms_non-polymorphic

From: Stella Mitchell <stellamit@gmail.com>
Date: Wed, 21 Apr 2010 14:32:24 -0400
Message-ID: <h2sd64b0f2c1004211132l71447352y5c54517036f4005@mail.gmail.com>
To: RIF <public-rif-wg@w3.org>
I find the name of this test case confusing because it seems to conflict
with the terminology in example 2 (the first within that example) in the FLD
section on well-formed formulas [1], where it refers to p as polymorphic
because it has several arities? Since this test case is now a
NegativeEntailment and not a NegativeSyntax test, it shows that p can
validly have multiple arities (regardless of the entailments)?


[1]  http://www.w3.org/2005/rules/wiki/FLD#Well-formed_Terms_and_Formulas
Received on Wednesday, 21 April 2010 18:32:58 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 21:47:58 UTC