Re: New CAS theory and implementation

From: Martin Johansen (mfag_at_online.no)
Date: 01/13/05


Date: Thu, 13 Jan 2005 12:44:19 +0100

I have written a tutorial on how to use the system:
https://sourceforge.net/docman/display_doc.php?docid=26458&group_id=127853

Project website: http://sourceforge.net/projects/dcas/

"Martin Johansen" <mfag@online.no> wrote in message
news:jDbDd.3034$IW4.67893@news2.e.nsc.no...
> Hello
>
> I have developed a new CAS design theory called DCAS (Dynamic CAS) and
> written an implementation released at sourceforge.net under GNU GPL
> http://sourceforge.net/projects/dcas/
>
> I would like to get your opinion on the mathematical range of this theory,
> i.e. which fields of mathematics might be implemented with it.
>
> I present the theory bellow, but it is documented in full in the
> implementation documentation:
> http://sourceforge.net/docman/display_doc.php?docid=26302&group_id=127853
>
> The basic premise behind DCAS is easy extensibility.
>
> The main tool of the theory is the expression manipulator. Both
> simplification of expressions and rearrangement of equations has already
> been implemented along with basic calculus and boolean algebra using this
> tool. Other maths I think is easily implemented is e.g. group theory,
> laplace transformations and predicate calculus.
>
> The outline of this tool is found here:
> http://sourceforge.net/docman/display_doc.php?docid=26302&group_id=127853#irdx
>
> Expressions are represented in a very simple format, which is a variant of
> a "tree structure":
> http://sourceforge.net/docman/display_doc.php?docid=26302&group_id=127853#fof
>
> Thanks.
> - Martin Johansen
>
>