RE: [Gcl-devel] Re: serveral bugs in codebase

[Juergen Weiss]

Hi 

the original algebra files are in the algebra directory.
Their name consists of lowercase letters with .spad(.pamphlet)
extension. In most of the algebra files are serveral
modules (categories, domains, packages). Each has a long
name (usually starting with an uppercase letter followed
by lowercase (and uppercase) letters) and an abbreviation
(defined with the )abbr command) consisting of uppercase
letters only. This name is used as the name for the
compiled module. Tim arranged things in the makefile,
so that the original algebra files are split up
in files containing only one module with allcaps filenames.

Juergen

Juergen Weiss     | Universitaet Mainz, Zentrum fuer Datenverarbeitung,
address@hidden| 55099 Mainz, Tel: +49(6131)39-26361, FAX:
+49(6131)39-26407


> -----Original Message-----
> From: Camm Maguire [mailto:address@hidden 
> Sent: Monday, July 28, 2003 4:09 PM
> To: address@hidden
> Cc: address@hidden; Juergen Weiss; address@hidden
> Subject: Re: [Gcl-devel] Re: serveral bugs in codebase
> 
> 
> Greetings!  OK as a first disclaimer, I am currently working in a tree
> compiled with safety 3.  I had to make the unlimited argument changes
> in GCL as earlier posted, and to remove the reference to as yet
> uninitialized |data| in define.boot.pamphlet.
> 
> I get an interpsys, and try to execute the commands below.  First,
> |output| is unbound in i-toplevel recordAndPrint.  So I substitute
> with format in the .clisp.  Then when trying p:dom:=1, it tries to
> load PF.o, which I don't have.  I did a full check out last week, and
> there is no PF.???  file anywhere.  So I grab PF.spad from Juergen's
> tree and compile it.  It needs FAXF.o, which also doesn't exist.  My
> original 'make' appeared to work without problems, but I appear to
> only have a partial algebra build.
> 
> Awaiting advice...
> 
> Take care,
> 
> root <address@hidden> writes:
> 
> > Camm,
> > 
> > The duplicate set issue test is:
> > 
> > dom:=MonoidRing(Polynomial PrimeField 5, Permutation Integer)
> > p:dom:=1
> > set [p,p] ==> {1,1}
> > 
> >   but should be
> >           
> >           ==> {1}
> > 
> > the other test is:
> > 
> >   one? p  ==> false
> > 
> > but should be
> >        
> >           ==> true
> > 
> > As mentioned in a previous email Axiom stores its variable bindings
> > in a "frame" which, internally is an alist stored in the variable
> > |$InteractiveFrame|
> > 
> > If you create the 'dom' variable above you can see it by doing:
> > 
> > )lisp (pprint |$InteractiveFrame|)
> > 
> > 
> > btw, you can type
> > 
> > )lisp (setq $DALYMODE t)
> > 
> > and then any line that begins with an open-paren at the Axiom
> > prompt will be given directly to the lisp. e.g. after setting
> > $dalymode above you can type:
> > 
> > (pprint |$InteractiveFrame|)
> > 
> > directly to the Axiom prompt. It makes lisp debugging easier.
> > 
> > Tim
> > address@hidden
> > address@hidden
> > 
> > 
> > 
> > _______________________________________________
> > Gcl-devel mailing list
> > address@hidden
> > http://mail.gnu.org/mailman/listinfo/gcl-devel
> > 
> > 
> > 
> 
> -- 
> Camm Maguire                                          
> address@hidden
> ==============================================================
> ============
> "The earth is but one country, and mankind its citizens."  -- 
>  Baha'u'llah
>