
	Where results make sense

Topic: Reflexive operator algebra

	The Joel on Software Discussion Group - Most Egregious Abuse of Operator Overloading? (Site not responding. Last check: 2007-10-18)
		You may overload the operator to be a different equivalence relation (for example, case-insensitive string comparison), but your overload makes no sense if you violate one of the rules of an equivalence relation.
		On the contrary, "Equivalence relations" are universally agreed to have the properties of reflexivity (for all A, A=A), symmetry (for all A and B, A=B <=> B=A), and transitivity (for all A, B and C, A=B and B=C => A=C).
		The left-hand-side of the assignment operator has a pointer to the interface implemented by the object on the right-hand-side, and has incremented the reference count on said object to reflect this.
	discuss.joelonsoftware.com /?joel.3.135764.68 (5297 words)

	Concurrency Abstracts (Site not responding. Last check: 2007-10-18)
		Its algebraic structure is essentially that of linear logic, with its morphisms being consequence-preserving renamings of propositions, and with its operations forming the core of a natural concurrent programming language.
		The algebra is that of a parallel programming language expanded to the language of full linear logic, Girard's axiomatization of which is satisfied by the event space interpretation of this language.
		The varieties RA of relation algebras and DA of dynamic algebras are similar with regard to definitional capacity, admitting essentially the same equational definitions of converse and star.
	boole.stanford.edu /abstracts.html (9620 words)

	[No title]
		This algebraic view comes in quite handy, since the solution to our problem is what is called "transitive closure" in Algebra, and there is a simple algorithm to compute it.
		In this case, multiplication is the operator that converts a path from i to j and a path from j to k into a path from i to k (concatenation), and addition is the operator that selects the shorter of two paths.
		If this was a mathematical paper, I would now have to prove that the data type MatrixEntry, together with the two operators, forms a "ring," that is a data type where multiplication and addition behave in the same way as they do in the prototype ring, the set of integers.
	graphics.cs.ucdavis.edu /~okreylos/Private/AlgorithmCorner/PathFinding.html (1830 words)

	UIUC Dept. of Mathematics Seminar Calendar (Site not responding. Last check: 2007-10-18)
		The Schur-Weyl functor can be used to understand the structure of affine Yangians and deformed double-current algebras, a new class of algebras introduced in the second part of my talk.
		For instance, one application is the construction of PBW-bases for these algebras.
		I will also explain how deformed double-current algebras can be viewed as limit forms of affine Yangians and how to define them in three different ways.
	torus.math.uiuc.edu /cal/math/cal?...+Algebras+Seminar&use=Find (1504 words)

	Glossary - TunesWiki
		Do not hesitate to ask for explanations regarding a word that isn't in this Glossary yet, or whose current definition you're not satisfied with.
		This glossary tries to explain the actual meaning of words related to the world of computers and operating systems, beyond slogans and myths.
		When multiple meanings exist, it explains which is used in the Tunes project.
	cliki.tunes.org /Glossary (345 words)

Try your search on: Qwika (all wikis)