W3C home > Mailing lists > Public > public-qt-comments@w3.org > April 2006

[Bug 1612] what is the quantification of unbound variables?

From: <bugzilla@wiggum.w3.org>
Date: Fri, 21 Apr 2006 14:47:19 +0000
CC:
To: public-qt-comments@w3.org
Message-Id: <E1FWwul-00066E-Hd@wiggum.w3.org>

http://www.w3.org/Bugs/Public/show_bug.cgi?id=1612


simeon@us.ibm.com changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
             Status|ASSIGNED                    |RESOLVED
         Resolution|                            |FIXED




------- Comment #8 from simeon@us.ibm.com  2006-04-21 14:47 -------
Implemented the proposed editorial suggestions to improve the notation
section.

More specifically, fixed the notation section, and the rest of the
specification to use the following conventions:

* 1 <= i <= n is replaced by i in {1,...,n} and always put on a
  different line.

* ellispes are now always meant to deal with cases from 1 to n, and
  never bottom out to the vanishing case. Added explicit inference
  rules when needed in the spec to deal with the vanishing
  case. Documented that convention in the notation section.

- Jerome
Received on Friday, 21 April 2006 16:49:43 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 27 March 2012 18:14:43 GMT