On 2/21/20 4:53 PM, Waldek Hebisch wrote:
> On Wed, Feb 19, 2020 at 10:19:45PM +0100, Ralf Hemmecke wrote:
>> Since we are at interpreter error messages. I get ...
>>
>> (210) -> onetnStep! ycomp
>>
System error:
>> The function BOOT::|*1;onetnStep!;1;initial| is undefined.
>
> I consider t
After some thinking I don't find it so strange anymore that adding
'finiteAgggregate' is a remedy. The domain FOOX (only one List) works without
this because S=Integer, whereas in FOO we have S=List Integer where some info
may be get lost in the recursion.
ListAggregate(S : Type) : Category == Joi
When we add Join(finiteAggregate) it works; strange isn't it. Why?
)abbrev domain FOO Foo
Foo(): Exports == Implementation where
Exports == Join(finiteAggregate) with
foo: () -> Boolean
Implementation == add
foo(): Boolean ==
a: List List Integer := empty()
b: List List
On Wed, Feb 19, 2020 at 10:19:45PM +0100, Ralf Hemmecke wrote:
> Since we are at interpreter error messages.
> I get ...
>
> (210) -> onetnStep! ycomp
>
>>> System error:
>The function BOOT::|*1;onetnStep!;1;initial| is undefined.
I consider this as interpreter bug. Interpreter is produ
On Wed, Feb 19, 2020 at 09:10:26PM +0100, Ralf Hemmecke wrote:
> > This tells you that offending part is
> >
> > a < b
> >
> >> ** level 3 **
> >> $x:= (< a b)
> >> $m:= (Boolean)
> >> $f:=
> >> |b| # #) (|a| # #) (|foo| #) (|$DomainsInScope| # # #) ...)))
> >>
> >>>> App
Since we are at interpreter error messages.
I get ...
(210) -> onetnStep! ycomp
>> System error:
The function BOOT::|*1;onetnStep!;1;initial| is undefined.
It's hard to track this down. Maybe there is a generic solution to it
that I don't know of.
The definition is
onetnStep!(y: Yn): Yn
> This tells you that offending part is
>
> a < b
>
>> ** level 3 **
>> $x:= (< a b)
>> $m:= (Boolean)
>> $f:=
>> |b| # #) (|a| # #) (|foo| #) (|$DomainsInScope| # # #) ...)))
>>
>>>> Apparent user error:
>>not known that (List (List (Integer))) has (AND (has (List (L
On Wed, Feb 19, 2020 at 12:09:52PM +0100, Ralf Hemmecke wrote:
> Can somebody tell me why the attached program does not compile?
>
> The error message looks not very helpful.
>
> Is that a bug?
>
> Ralf
>
> (1) -> )co bug.spad
>Compiling FriCAS source code from file
> /home/hemmecke/b
Can somebody tell me why the attached program does not compile?
The error message looks not very helpful.
Is that a bug?
Ralf
(1) -> )co bug.spad
Compiling FriCAS source code from file
/home/hemmecke/backup/git/qeta/src/bug.spad using old system
compiler.
FOO abbreviates domai
Hi Waldek,
maybe, you think differently, but I think this is very valuable
historical information, so either
(A) bugs should get a number and this explanation should also live in
the "resolved" section of the bugtracker *and* the commit should carry a
reference to the corresponding bugtracke
Martin Rubey wrote:
> (1) -> PAIR ==> List INT
>Type: Void
> (2) -> Combinations(n:PI, k:PI): List PAIR ==l := [elements e for e in
> enumerate()$SetOfMIntegersInOneToN(2, n)]
>Function declaration Combinations : (Positive
File a bugreport. ;-)
Ralf
On 02/26/2010 12:26 PM, Martin Rubey wrote:
Ralf Hemmecke writes:
Actually, I believe this construction.
for d in ..6 by 2
should be immediately rejected by the compiler and also by the
interpreter.
I agree. I should have added: it was a typo. But sometime
Ralf Hemmecke writes:
> Actually, I believe this construction.
>
> for d in ..6 by 2
>
> should be immediately rejected by the compiler and also by the
> interpreter.
I agree. I should have added: it was a typo. But sometimes adapting
the algebra just hides the compiler/interpreter bug.
Mar
[VertexSet(2*d,4) for d in ..6 by 2]
Can you say where this segment should start? 0, 1, 2, 100?
Who, do you think, is going to throw in the starting point. Is that
defined somewhere?
In my case it works if I replace ..6 by 1..6 and 2..6.
Ralf
(7) -> [VertexSet(2*d,4) for d in 1..6 by 2]
Some addon...
The definition of UniversalSegment allows a missing upper bound, i.e.
..
can be used as a postfix operator, but I haven't seen a definition where
the lower bound is missing. And this would also be strange, since
segments are used for iteration and they increase by the value af
(1) -> PAIR ==> List INT
Type: Void
(2) -> Combinations(n:PI, k:PI): List PAIR ==l := [elements e for e in
enumerate()$SetOfMIntegersInOneToN(2, n)]
Function declaration Combinations : (PositiveInteger,PositiveInteger
16 matches
Mail list logo
