axiom-developer
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Axiom-developer] listOfTerms


From: Bertfried Fauser
Subject: [Axiom-developer] listOfTerms
Date: Mon, 2 Nov 2009 17:11:45 +0000

Dear Tim,

if I naively do the below attached things, I get in FriCAS an export
of listOfTerms,
also )d op listOfTerms guids me to IDPC and )sh IDPC shows the export...

Ciao
BF.



address@hidden:~> fricas
Checking for foreign routines
AXIOM="/usr/local/lib/fricas/target/i686-suse-linux"
spad-lib="/usr/local/lib/fricas/target/i686-suse-linux/lib/libspad.so"
foreign routines found
openServer result 0
                 FriCAS (AXIOM fork) Computer Algebra System
                         Version: FriCAS 2009-10-26
               Timestamp: Sunday November 1, 2009 at 22:23:01
-----------------------------------------------------------------------------
   Issue )copyright to view copyright notices.
   Issue )summary for a summary of useful system commands.
   Issue )quit to leave FriCAS and return to shell.
-----------------------------------------------------------------------------

(1) ->
(1) -> )d op listOfTerms

There is one exposed function called listOfTerms :
   [1] D -> List(Record(k: D3,c: D2)) from D
            if D has IDPC(D2,D3) and D2 has SETCAT and D3 has ORDSET


There are 2 unexposed functions called listOfTerms :
   [1] LieExponentials(D2,D3,D4) -> List(Record(k:
            PoincareBirkhoffWittLyndonBasis(D2),c: D3))
            from LieExponentials(D2,D3,D4)
            if D2 has ORDSET and D3 has Join(CommutativeRing,Module(
            Fraction(Integer))) and D4: PI
   [2] PoincareBirkhoffWittLyndonBasis(D2) -> List(LyndonWord(D2))
            from PoincareBirkhoffWittLyndonBasis(D2) if D2 has ORDSET

(1) -> )sh IDPC
 IndexedDirectProductCategory(A: SetCategory,S: OrderedSet)  is a
category constructor
 Abbreviation for IndexedDirectProductCategory is IDPC
 This constructor is exposed in this frame.
------------------------------- Operations --------------------------------
 ?=? : (%,%) -> Boolean                coerce : % -> OutputForm
 hash : % -> SingleInteger             latex : % -> String
 leadingCoefficient : % -> A           leadingSupport : % -> S
 map : ((A -> A),%) -> %               monomial : (A,S) -> %
 reductum : % -> %                     ?~=? : (%,%) -> Boolean
 construct : List(Record(k: S,c: A)) -> %
 constructOrdered : List(Record(k: S,c: A)) -> %
 leadingTerm : % -> Record(k: S,c: A)
 listOfTerms : % -> List(Record(k: S,c: A))

-- 
% PD Dr Bertfried Fauser
%       Research Fellow, School of Computer Science, Univ. of Birmingham
%       Honorary Associate, University of Tasmania
%       Privat Docent: University of Konstanz, Physics Dept
<http://www.uni-konstanz.de>
% contact |->    URL : http://clifford.physik.uni-konstanz.de/~fauser/
%              Phone : +49 1520 9874517




reply via email to

[Prev in Thread] Current Thread [Next in Thread]