(note that this part of my reply is copied to the axiom mailing list)
> Would you care to share some insights as to why you are thinking about
> redoing noweb in lisp?
five reasons.
(well "reasons" might be a bit strong except in a religious sense)
first, noweb is slow. my current document (fo
Back in November, Tim gave the following as an overall "structure"
within which we will be working to define, describe, and document the
Axiom system.
vol 1: tutorial
vol 2: programming
vol 3: reference
vol 4: developers guide
vol 5: interpreter
vol 6: compiler
vol 7: browser
vol 8: hyperd
Hi Greg,
very nice that you have trouble with that. ;-)
No, you are not alone. I have NEVER seen a clear explanation of how
++ comments should be written. And that was one of the reasons why I
finally decided to introduce my own syntax (which is just a set of 5 TeX
commands
\adtype \adthisty
Hi,
Can someone explain me why
myfunc1: Z -> Boolean
++ myfunc1(z) computes a wonderful thing.
++ SIDE = 'L' SIDE = 'R'
++ TRANS = 'N': Q * C C * Q
++ TRANS = 'T': Q**T * C C * Q**T
is correctly displayed in hyperdoc
Hello,
On Tue, 16 May 2006 15:08:16 +0200, Ralf Hemmecke <[EMAIL PROTECTED]> wrote:
DomA( a: List Integer ):with {...} == add {...}
a: List Integer := [ 1, 2, 3 ];
R == DomA( a );
a . 2 := 300;
S == DomA( a );
a still refers to the same memory location, but it is different. Would
R equal S?
DomA( a: List Integer ):with {...} == add {...}
a: List Integer := [ 1, 2, 3 ];
R == DomA( a );
a . 2 := 300;
S == DomA( a );
a still refers to the same memory location, but it is different. Would R
equal S?
Well, here I would comment the following.
a.2 := 300
is the same as
set!(a, 2, 300
Hello,
On Tue, 16 May 2006 00:35:36 +0200, Ralf Hemmecke
<[EMAIL PROTECTED]> wrote:
| System(): with {
|timestamp: Integer;
|cpuTemperature: Integer;
| } == add {
|timestamp: Integer == { obtain the timestamp somehow }
|cpuTemperature: Integer == { obtain the timestamp someho
Hello,
I'm
converned with the type system.
The type system allows for checking that expectations of functions are
met by their arguments. That checking, and reasoning in general,
requires that we can replace equals for equals. If I defined a
function with a given type (the type is evaluated to
Dear all,
I find it quite hard to follow your discussion, but maybe you can help me out:
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> Interestingly, if the documentation where better, I would even say that
> despite the lines
>
> local a == inc NUM;
> local b == inc dec inc NUM;
> stdout << "a
