Bertfried, Franz,
I have been giving some thought to your need for caching.
There is a technique in lisp called memoizing which basically
creates a new hash table in a closure and then defines a function
which closes over it and wraps the original function.
So when you call
(memoize originalfunc
Ok, so perhaps "an amazingly clever generalization" is possibly over-the-top
but the fact that it could form a basis for all of the algebra certainly
captured
my imagination. I did not know of Operad theory but I'll add it to the
study
queue. I still feel that what you and Li proposed was very e
Using this code you can write literate common lisp programs.
Note that the literate file you create is PURE latex so a "weave"
program is not needed. This will accept noweb-style <>=
syntax or \begin{chunk}{chunkname}\end{chunk} latex code.
Removing the weave program and using a literate-aware
Tim:
You wrote: "William Sit and someone from Rutgers had what
seemed to me to be an amazingly clever generalization. I
don't know what happened with that."
--
I don't think what Li Guo (Rutgers, Newark) and I proposed
is, at least mathematically speaking, anything like
"amazingly clever generali
Martin,
Don't worry about the literate programming aspect. I'll handle that part.
I just want to be sure that I can track your changes using your web page.
As for the package name, you can call it anything you like.
I have seen Grassmann algebras called Clifford (Geometric) Algebras
that covers
On Wednesday 18 November 2009 18:13:04 Tim Daly wrote:
> Martin,
>
> I'm trying to install your code in Axiom.
> Do I have your permission to use text from your webpage as documentation?
>
> Tim
Tim,
Yes, please feel free to use anything from:
http://www.euclideanspace.com/maths/standards/progr
Martin,
I'm trying to install your code in Axiom.
Do I have your permission to use text from your webpage as documentation?
Tim
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
