On Sat, Apr 6, 2013 at 1:01 AM, u1204 d...@axiom-developer.org wrote:
Gaby,
I will note that the NSF will not fund open source projects.
Science can only occur if you are at a University. Sigh.
I don't know why you are saying that, NSF certainly has been
funding many open source projects, as
Martin Baker ax87...@martinb.com writes:
| We did not get time to convert all the comments into code as is done
| for some the new categories and domains in the trunk repository.
| For example, from
|
|
|
On Fri, Apr 5, 2013 at 3:51 AM, Martin Baker ax87...@martinb.com wrote:
Given that there is no resources (or desire, as far as I can see) to change
the structure of Axiom then I was wondering, just for specific domains where
we want a specific equation solver, could we encode the axioms in a
On Fri, Apr 5, 2013 at 11:05 AM, Martin Baker ax87...@martinb.com wrote:
On 05/04/13 12:11, Gabriel Dos Reis wrote:
Your probably know that OpenAxiom started putting the axioms in AXIOM.
See for example:
http://sourceforge.net/p/open-axiom/code/2800/tree/trunk/src/algebra
On Fri, Apr 5, 2013 at 11:44 PM, u1204 d...@axiom-developer.org wrote:
This is probably not very practical, but I was just trying to do a
thought experiment to investigate what would be required to have
variables that range over domains that are not numbers.
Actually, I wrote an NSF proposal to
Tim Daly d...@axiom-developer.org writes:
| I've been reading this thread. It seems to me that what people are seeking
| is a symbolic algebra rather than a computer algebra system. The distinction
| is that a symbolic system manipulates input as parse trees in
| syntactic form.
| A computer
Bill Page bill.p...@newsynthesis.org writes:
| On Thu, Jun 4, 2009 at 4:43 PM, Gabriel Dos Reis wrote:
| ...
| I would reserve the use of InputForm for syntatic canonical
| forms of mathematical objects.
|
|
| Currently InputForm values can arise both from parsing of input
| strings
Ralf Hemmecke r...@hemmecke.de writes:
| In OpenAxiom, I get
|
| (1) - (x + y^2)::InputForm
| (1) y^2 + x
|Type:
InputForm
|
| Cool! Was that done by a simple patch? What is the revision number?
it was done by a simple
On Sat, May 17, 2008 at 3:58 PM, root [EMAIL PROTECTED] wrote:
echo 0 /proc/sys/kernel/exec-shield
The SELinux folks seem unable to understand that someone might want
to actually execute code out of the heap or stack memory. Or that
saving and restoring a process might be useful. Both have
Bill Page [EMAIL PROTECTED] writes:
| Quoting Ralf Hemmecke [EMAIL PROTECTED]:
|
|
| All the exports that appear are basically the
| exports of the Union (OK, Union still has a few more.)
|
| ---BEGIN aaa.as
| #include aldor
| #include aldorio
|
| define ET: Category == with; --
Bill Page [EMAIL PROTECTED] writes:
[...]
| in Haskell, by a kind of convenient abuse of notation
| (or polymorphism if you wish) 'MkInt' also denotes a
| function
|
|MkInt: Int - MkInt Int
Bill --
you're highly confused.
On Wed, 9 May 2007, Ralf Hemmecke wrote:
| And I cannot say whether MkInt is a type constructor in Haskell, since I don't
| know the language very well.
MkInt is NOT a type constructor in Haskell; Bill was very confused.
MkInt is a *data* constructor, and your understanding is correct.
-- Gaby
On Wed, 9 May 2007, Bill Page wrote:
[...]
| ... in Haskell, by a kind of convenient abuse of notation
| (or polymorphism if you wish) 'MkInt' also denotes a
| function
|
| MkInt: Int - MkInt Int
|
| that creates an object of type 'MkInt Int' from an object
| in 'Int'. I think
Bill Page [EMAIL PROTECTED] writes:
| Quoting Gabriel Dos Reis [EMAIL PROTECTED]:
|
| On Wed, 9 May 2007, Bill Page wrote:
|
| [...]
|
| | ... in Haskell, by a kind of convenient abuse of notation
| | (or polymorphism if you wish) 'MkInt' also denotes a
| | function
On Wed, 9 May 2007, Ralf Hemmecke wrote:
| Well, I did not interepret it as a slur against Haskell. However, it did
| appear to me to be fundamentally incorrect to miss the core ideas of
| algebraic data typea and how they lead to GADT:
| data Expr where
|MkInt:: Integer - Expr
On Tue, 8 May 2007, Bill Page wrote:
| I have more to say later.
|
| We're listening. :-)
One of the issues I have with many of the various alternatives is
that they make definition of new functions operating on Expr
also impossible (by a third person) without intimate knowledge
of the
On Tue, 8 May 2007, Ralf Hemmecke wrote:
| But I thought that the Haskell
|
| data Expr = MkInt Int
| | MkAdd Expr Expr
| | MkMul Expr Expr
|
| is more like
|
| Union(Cross(Tag, Int),
| Cross(Tag, Expr, Expr),
| Cross(Tag, Exrp, Expr)).
yes, conceptually, that
Martin Rubey [EMAIL PROTECTED] writes:
| Dear Gaby,
|
| Gabriel Dos Reis [EMAIL PROTECTED] writes:
|
|For concretness, here is a very classic example of inductive type
| along with a function working on expression of such type, written in
| both Haskell and New Boot. How would you best
Hi,
While writing a tutotial on programming with Spad, I realize that
I don't have a good way to present inductive types in Spad. I know
what they would like in my ideal Spad, but we don't have that ideal
Spad yet. So, I'm asking here how you would write inductive types
in today Spad.
For
C Y [EMAIL PROTECTED] writes:
|It's like using a wagon to cross the US vs. building a
| railway across it. Yes, if you only want to cross once and start
| farming you can use the wagon, but in the long run the railway will
| open up a lot more possibilities and it's worth the extra
Page, Bill [EMAIL PROTECTED] writes:
[...]
| This sort of construction is one of the things that sets Axiom
| apart from most other computer algebra systems.
Bill --
That should be an FAQ, if it is not already. Yesterday, I was
privately asked similar question (with similar answer).
--
root [EMAIL PROTECTED] writes:
[...]
| Axiom needs noweb in a running, finally installed system.
| It does not need it now but it will need it shortly.
That information comes now too late, but I'll put it on my TODO list.
-- Gaby
___
Axiom-mail
David MENTRE [EMAIL PROTECTED] writes:
| Hello,
|
| Ok, so why not modifiying 'document' itself, like in:
Really, I don't believe the issue is that of gaby mode.
document is doing too many things at the same time.
There was a comparison with tar earlier. However, tar does many
things at the
Ralf Hemmecke [EMAIL PROTECTED] writes:
| | \begin{chunk}{MyCode} % The chunkname should not be optional!!
| | false
| | \end{chunk}
| | | \begin{chunk}{MyChunk} % The chunkname should not be optional!!
| | apply(x: Boolean, y: Boolean): Boolean == x and y;
| | (x: Boolean)/(y: Boolean):
Page, Bill [EMAIL PROTECTED] writes:
[...]
| Oddly, it seems that Tim did not understand your question.
|
| Your initial assumption is correct. For Axiom, noweb is
| *only* a build utility. It is not required for running
| Axiom. It should not be installed when running the Axiom
| 'make
Tim --
Do we know why don't systematically use this
It turns out that we can successfully build GCL on many more systems
if we set the [[GCLOPTS]] to build a local [[BFD]].
GCLOPTS-LOCBFD=
GCLOPTS=--enable-vssize=65536*2 --enable-locbfd --disable-dynsysbfd \
root [EMAIL PROTECTED] writes:
|
|Do we know why don't systematically use this
|
| It turns out that we can successfully build GCL on many more systems
| if we set the [[GCLOPTS]] to build a local [[BFD]].
| GCLOPTS-LOCBFD=
| GCLOPTS=--enable-vssize=65536*2
root [EMAIL PROTECTED] writes:
| The only issue that I need to solve (but I'm not worried about it
| right now), is how to find optimization flags for C compilers other
| than GCC/gcc. I know the existing Makefiles special cases all of them
| it knows about. I'm however skeptical that they
Tim --
The variable LISP lacks documentation in the toplevel
Makefile.pamphlet. What is its purpose? Lisp file suffix?
-- Gaby
___
Axiom-mail mailing list
Axiom-mail@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-mail
29 matches
Mail list logo
