- From: Chris Welty <cawelty@gmail.com>
- Date: Fri, 13 Mar 2009 14:28:56 -0400
- To: "Public-Rif-Wg (E-mail)" <public-rif-wg@w3.org>
At the F2F12, there was discussion of "bounded quantifiers" (e.g. Forall (x in C) ...) in PRD, and the suggestion was made to put them in Core, and thus into BLD as well. This would require re-issuing LC for BLD. It seems to me this could be done simply as syntactic sugar, ie Forall (x in C) Q :- P is syntactic sugar for Forall (x) Q :- P AND C(x) and just allows an implementor to more easily recognize the restriction on the quantification (this is a common source of optimization in implementations). Anyway, let's have a brief discussion about the pros/cons on Tuesday. -Chris -- Dr. Christopher A. Welty IBM Watson Research Center +1.914.784.7055 19 Skyline Dr. cawelty@gmail.com Hawthorne, NY 10532 http://www.research.ibm.com/people/w/welty
Received on Friday, 13 March 2009 18:29:53 UTC