Hi Ralf,
the below attached code seems to compile OK. When I try to do a
lehmerCodeToPermutation [2,1,3,4]
I get a message:
(2) - lehmerCodeToPermutation([1,3,2,4])
LISP output:
UNPRINTABLE
I guess I have to add an output form. I did it as
-- declaration OUT == OutputForm
Bertfried Fauser wrote:
Hi,
I am sorry to have again a newby question, I want to define a new
domain FlatListPermutation
(see below), but I do not know how to set up the Rep, rep, per, and
the compiler asks for
a missing coercion function. My attempt to write one failed :-(
You wrote
On Tue, Nov 3, 2009 at 7:05 AM, Bertfried Fauser wrote:
Hi Ralf,
the below attached code seems to compile OK. When I try to do a
lehmerCodeToPermutation [2,1,3,4]
I get a message:
(2) - lehmerCodeToPermutation([1,3,2,4])
LISP output:
UNPRINTABLE
I guess I have to add an output
Rep == Vector Integer
this one should be avoided (I don't remember the reason).
I think if you use Rep := , then you have magic conversions.
In Aldor the := would probably not even work. But since there is no
clear definition of what == and := means, I guess you are right.
(BTW, in
as a novice, I copied this just from prtition.spad
)abbrev domain PRTITION Partition
++ Domain for partitions of positive integers
++ Author: William H. Burge
++ Date Created: 29 October 1987
++ Date Last Updated: 23 Sept 1991,
++ Updated: 20 Oct 09, Fauser,Lehner,Rubey
++ Keywords:
++
