Mark Clements wrote:
>
> Quicklisp has cl-colors; see also https://github.com/tpapp/cl-colors.
> Dependencies include anaphora, alexandria and let-plus.
>
> As a principle, is it better to use the lisp or to (hand) translate to spad?
For new code I defintely prefer Spad. When using existing cod
oldk1331 wrote:
>
> Any updates? Well, the site's error message changed.
> And Martin asked again in sci.math.symbolic.
I am working on this. But I was busy with other things and
procedure to fix problems is rather awkward.
--
Waldek Hebisch
--
You received thi
Kurt Pagani wrote:
>
> Function 'random' is found in several .spad files and cannot be changed
> easily (see below, e.g. permgrps).
> Perhaps a new function random: (INT,INT) -> INT or Interval(INT) -> INT
> could be created?
For finite domains 'random' is defined to play reasonably with
other
>
> (1) -> )show ListPackage
> ListPackage(T$: BasicType) is a package constructor
> Abbreviation for ListPackage is LISTPKG
> This constructor is not exposed in this frame.
> â â â â â â â â â â â â â â â â â â â â â â â â â â
> â â â â â Operations â â â â
oldk1331 wrote:
>
> > Probably because T has the fixed meaning (True) in lisp.
>
> Hmm, good catch! You are right, if you use "NIL" as a type
> variable, you can't compile it:
>
>>> System error:
>The value
> |t#1|
> is not of type
> SEQUENCE
>
> After some debugging, I find this b
CL (where Fricas' random is based on)
> http://clhs.lisp.se/Body/f_random.htm
> This might explain why 'random' it's implemented as is.
> What about the quality of RANDOM()$Lisp?
>
>
The following page is about Lisp's RANDOM function (apparently a Mersenne
Twister).
The comments therein (at the
oldk1331 wrote:
>
> Another angle to see this problem:
>
> In theory, every Euclidean domain is a unique factorization
> domain, but in FriCAS, it's not.
>
> In an email one year ago, there's discussion about it:
> https://groups.google.com/forum/#!topic/fricas-devel/mMmm9zmC7io
>
> > There are
On 22 October 2016 at 02:31, oldk1331 wrote:
>> I still don't like "Functor" as a name.
>
> That's still debatable, and which name do you prefer?
>
I think it is possible (may even desirable) to ignore the use of
Functor in Haskell and instead focus directly on the connection with
mathematical ca
On 22 October 2016 at 02:08, oldk1331 wrote:
> Bill, I'm sorry that I give a bad example.
>
> About the axioms that "map" has to fullfill:
> map(id, x) === xfor all x
> map(f, map(g,x)) === map(compose(f,g), x)for all x, f, g
>
Yes, these are the "functor laws" as written in Haske
Another angle to see this problem:
In theory, every Euclidean domain is a unique factorization
domain, but in FriCAS, it's not.
In an email one year ago, there's discussion about it:
https://groups.google.com/forum/#!topic/fricas-devel/mMmm9zmC7io
> There are principal ideal domains where all fu
> Probably because T has the fixed meaning (True) in lisp.
Hmm, good catch! You are right, if you use "NIL" as a type
variable, you can't compile it:
>> System error:
The value
|t#1|
is not of type
SEQUENCE
After some debugging, I find this bug happens at a very early stage:
parsing.
On Sat, 22 Oct 2016, oldk1331 wrote:
I did some debugging, and find that in i-syscmd.boot#L2303
"GETDATABASE(op, 'CONSTRUCTORFORM)" gives T$:
(1) -> )boot GETDATABASE("ListPackage",'CONSTRUCTORFORM)
(EVAL-WHEN (EVAL LOAD)
(PROG () (RETURN (GETDATABASE '|ListPackage| 'CONSTRUCTORFORM
Value
12 matches
Mail list logo
