Thanks for the pointer.
Chasing links led me to this
http://portal.acm.org/citation.cfm?id=190695&dl=GUIDE&coll=GUIDE&CFID=67330748&CFTOKEN=77193109
Do people know what happens to "Gauss"?
In their approach to mimic Axiom, they avoid been careful in making
AbelianMonoid "derive" from Mono
Tim,
There are lots of possible generalizations of a real or extended
real interval. For example: a vector of intervals, or a "box";
a complex interval consisting of a real and imaginary interval pair,
or an interval magnitude and phase; or a set of intervals, sometimes
called a list. Another
Ralf,
I do hope that we are converging ... :)
On Tuesday, March 14, 2006 12:30 PM you wrote:
> ...
> I wrote:
> > Category theorists purist do not like to write set membership
> > because it implies that categories are always sets.
> ...
>
> > They prefer to posit the existence of a functor.
>
On 03/14/2006 01:46 AM, Gabriel Dos Reis wrote:
Martin Rubey <[EMAIL PROTECTED]> writes:
[...]
| > Imagine you could ask "if M has Monoid(+)..." or "if M has
| > Monoid(*)...". According to which returns true, you would then go on and
call
| > (m1 +$M m2) or (m1 *$M m2). Well, but M might have
I highly recommend the paper:
http://portal.acm.org/citation.cfm?id=1073884.1073921
Domains and expressions: an interface between two approaches
to computer algebra
by
Cosmin E. Oancea, Stephen M. Watt
University of Western Ontario, London, ON, Canada
ABSTRACT
This paper describes a method to
Ralf, and other Aldor experts;
Section "7.5 Subtypes" of the Aldor Users Guide says:
Note that Aldor is constructed so that a domain is only a
member of a named category if it explicitly inherits from
the category -- not if it merely exports the same collection
of (explicit) declarations\
William Sit <[EMAIL PROTECTED]> writes:
[...]
| Martin:
|
| If we are allowed to change the notation for the monoid structure so that a
set
| can have multiple monoidal structures and we can inquire about it, then some
| code like:
|
|If X has Monoid("*") then ...
|
| would have no defini
Martin Rubey <[EMAIL PROTECTED]> writes:
[...]
| > Imagine you could ask "if M has Monoid(+)..." or "if M has
| > Monoid(*)...". According to which returns true, you would then go on and
call
| > (m1 +$M m2) or (m1 *$M m2). Well, but M might have a monoid structure with
| > respect to the operat
Ralf,
On Tuesday, March 14, 2006 9:58 AM you wrote:
> I wrote:
> > I suppose it would be better to write:
> >
> >default {
> > Rep == T;
> > square(t: %): % == per(m(rep(t), rep(t))
> >}
>
> N PLEASE DONT USE ANY REPRESENTATION IN A CATEGORY.
The 'Rep' is not a repres
Ralf,
On Tuesday, March 14, 2006 9:57 AM you wrote:
> > "Bill Page" <[EMAIL PROTECTED]> writes:
> >
> > | On March 13, 2006 6:34 AM Ralf Hemmecke asked:
> > | > ...
> > | > But here the question to our category theory experts:
> > | > Since Monoid is something like (*,1) would it make sense
> >
On 03/14/2006 05:28 PM, Page, Bill wrote:
Ralf,
On Tuesday, March 14, 2006 9:56 AM you wrote:
On 03/14/2006 01:43 AM, Gabriel Dos Reis wrote:
"Bill Page" <[EMAIL PROTECTED]> writes:
| I agree with Martin. One should interpret:
|
| if Integer has Monoid(*,1)
|
| as the question of whether
Ralf,
On Tuesday, March 14, 2006 9:56 AM you wrote:
>
> On 03/14/2006 01:43 AM, Gabriel Dos Reis wrote:
> > "Bill Page" <[EMAIL PROTECTED]> writes:
> >
> > | I agree with Martin. One should interpret:
> > |
> > | if Integer has Monoid(*,1)
> > |
> > | as the question of whether F = (*,1) is
On 03/14/2006 03:39 AM, Page, Bill wrote:
On Monday, March 13, 2006 7:32 PM Gaby wrote:
...
Bill Page writes:
Also, I think you should write:
square: % -> %;
default {square(t: %): % == m(t pretend T, t pretend T)
pretend %
although apparently the compiler does not worry about th
On 03/14/2006 01:54 AM, Gabriel Dos Reis wrote:
"Bill Page" <[EMAIL PROTECTED]> writes:
| On March 13, 2006 6:34 AM Ralf Hemmecke asked:
| > ...
| > But here the question to our category theory experts:
| > Since Monoid is something like (*,1) would it make sense
| > to speak of a category (in
On 03/14/2006 01:37 AM, Gabriel Dos Reis wrote:
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
| Integer is a name for a structure with carrier set
|
| {0, 1, -1, 2, -2, ...}
|
| and operations {+, *, 0, 1, ...}.
|
| Integer is certainly not the carrier set alone.
Well, actually, it is a conve
On 03/14/2006 01:43 AM, Gabriel Dos Reis wrote:
"Bill Page" <[EMAIL PROTECTED]> writes:
| I agree with Martin. One should interpret:
|
| if Integer has Monoid(*,1)
|
| as the question of whether F = (*,1) is a functor from the category
| containing Integer to Monoid, the category of monoids
Hi Bill,
Hmmm... surely this must have been considered in the design of
Aldor. Are there no Aldor categories like DIRPCAT that take a
member of a domain as a parameter?
All categories in libaldor either take no parameter or just domain
parameters.
In libalgebra, I could only find
define Re
Gabriel Dos Reis wrote:
>
> William Sit <[EMAIL PROTECTED]> writes:
>
> | Hi Gabe:
> |
> | Gabriel Dos Reis wrote:
> | > William Sit <[EMAIL PROTECTED]> writes:
> | >
> | > | "Bill Page" <[EMAIL PROTECTED]> writes:
> | > |
> | > | > | I don't think there is any essential reason why SemiGroup a
18 matches
Mail list logo
