Motion P1788/M0015.01: Definition_of_decorations: Up for discussion

[Ralph Baker Kearfott <rbk@xxxxxxxxxxxx>]

P-1788:

Since the motion has been presented by Dan Zuras and seconded
by Chenyi Hu, it is now up for the three week discussion period
as a position paper.  Discussion will continue until after
Friday, May 14, at which time we will vote on it.

William: Please record this action in the minutes.

Juergen: Please post the motion and its status on the web page,
         as you have been doing.

For reference, I also append the motion to this message.

I note that this motion deals with how decorations are
represented and propagated, and not about the meanings
of specific decorations.  Although we may discuss any
aspects of our standard, to avoid confusion, discussion
with reference to this motion probably should relate
what is said to the content of the motion itself.

Sincerely,

Baker

------------------------------------------------------

	To each interval there shall be a set of decorations that
	corresponds to that interval and carries information about
	how that interval was computed.  Each decoration within
	that set shall carry 3 bits of information named
	'thingy'True, 'thingy'False, and 'thingy'Sticky.

	(Note to editor: John, 'thingy' is where you can put some
	italic form placeholder to stand in for the property being
	discussed.  This is like <i> formatOf </i> in 754.  Perhaps
	<i> propertyOf </i> or <i> decorationOf </i>.  Its up to
	you.)

	Together with the predicate is'thingy' we define for all
	monadic interval functions f(xx):

		'thingy'True = {there exists x in xx such that
			is'thingy'(f,x) is True}

		'thingy'False = {there exists x in xx such that
			is'thingy'(f,x) is False}

		'thingy'Sticky =
			'thingy'False(xx) \or 'thingy'Sticky(xx)

	We define for all dyadic interval functions f(xx,yy):

		'thingy'True = {there exists x in xx and y in yy
			such that is'thingy'(f,x,y) is True}

		'thingy'False = {there exists x in xx and y in yy
			such that is'thingy'(f,x,y) is False}

		'thingy'Sticky =
			'thingy'False(xx) \or 'thingy'Sticky(xx) \or
			'thingy'False(yy) \or 'thingy'Sticky(yy)

	There shall also exist predicates 'thingy'True(xx),
	'thingy'False(xx), and 'thingy'Sticky(xx) and the
	extraction function

		get'thingy'(xx) = ('thingy'True(xx),'thingy'False(xx),
			'thingy'Sticky(xx)).

	The initial (or default) value of 'thingy'True(xx), and
	'thingy'False(xx) upon creation of a new xx shall be determined
	by the nature of 'thingy' (in a future motion).  The initial
	value of 'thingy'Sticky(xx) shall be False.


--

---------------------------------------------------------------
R. Baker Kearfott,    rbk@xxxxxxxxxxxxx   (337) 482-5346 (fax)
(337) 482-5270 (work)                     (337) 993-1827 (home)
URL: http://interval.louisiana.edu/kearfott.html
Department of Mathematics, University of Louisiana at Lafayette
(Room 217 Maxim D. Doucet Hall, 1403 Johnston Street)
Box 4-1010, Lafayette, LA 70504-1010, USA
---------------------------------------------------------------