Jens Axel Søgaard wrote:
Changes http://wiki.axiom-developer.org/AxiomScreenCast/
Btw - about the music, well - how shall I put it, silence is gold?
--
Jens Axel Søgaard
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http
Changes http://wiki.axiom-developer.org/AxiomScreenCast/diff
--
??changed:
-"Axiom in 5":/public/AxiomIn5.html -- A demonstration of installing
-Axiom on Windows. Author: Bill Page.
Axiom in 5
Download "Axiom in 5":/public/AxiomIn5.html -- A video demonstration of
installing Axiom on Windows.
William Sit wrote:
If not under Axiom, what is your recommendation for an environment to learn
lisp?
Perhaps "Practical Common Lisp" has an answer.
<http://www.gigamonkeys.com/book/>
If not, i'm sure comp.lang.lisp will be helpful.
with varying levels of experience - in other
words most open source projects. Maybe this is changing gradually.
Can you remember where Norvig argued that?
--
Jens Axel Søgaard
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http
Jens Axel Søgaard
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
as I.
See also the Wikipedia article on "Strongly Typed" :
<http://en.wikipedia.org/wiki/Strongly_typed>.
--
Jens Axel Søgaard
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
The documentation is quite humourous and worth a read.
The language was presented at the Lightweight Languages 4
conference at MIT and a video from that presentation is available
along with the slides at:
<http://futureboy.homeip.net/frinkdocs/LL
ort to optimize som tail recursive
calls, but it is usually unsafe to rely on it.
The code from SICP (which uses Scheme) that Maguire is trying is
thus not supposed to work an all Common Lisp implementations.
--
Jens Axel Søgaard
___
Axiom-deve
ents/Standards/R5RS/HTML/r5rs-Z-H-6.html#%_sec_3.5>
for a more formal definition.
[1] Here "Proper Tail Recursion" is a technical term, and doesn't
mean "tail recursion done right".
--
Jens Axel Søgaard
___
Axiom-deve
root wrote:
Actually, tail recursion is supported automatically.
I tried the following and ran out of stack space:
loop : INT -> INT
loop (n) == loop (n)
loop (1)
>> System error:
Invocation history stack overflow.
Is there a way to turn off the invocation history?
--
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Hi Martin,
> Although I'm not 100% sure what lexorder? ought to do exactly, you
> might want to notice the following:
>
> the first matching type the interpreter finds for [x,y,z] is
>
> (13) -> [x,y,z]
>
>(13)
List Integer -> Integer
Segmentation fault
The same happens in Windows.
--
Jens Axel Søgaard
___
Axiom-developer mailing list
Axiom-developer@nongnu.org
http://lists.nongnu.org/mailman/listinfo/axiom-developer
Changes http://page.axiom-developer.org/zope/mathaction/AxiomMail/diff
--
Hi all,
Is there a smarter way than the following to write lexorder?(p,q) ?
lexorder?(p,q) ==
if empty?(variables(p))
then return ~empty(variables(q))
else
vars := members(difference( set(variables( secret1*p
13 matches
Mail list logo
