DOCSLIB.ORG

Order Sorted Computer Algebra and Coercions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Order Sorted Computer Algebra and Coercions Order Sorted Computer Algebra and Co ercions submitted by Nicolas James Doye for the degree of PhD of the University of Bath COPYRIGHT Attention is drawn to the fact that copyright of this thesis rests with its author This copy of the thesis has b een supplied on the condition that anyone who consults it is understo o d to recognise that its copyright rests with its author and that no quotation from the thesis and no information derived from it may b e published without the prior written consent of the author This thesis maybemadeavailable for consultation within the University Library and may b e photo copied or lent to other libraries for the purp oses of consultation Signature of Author Nicolas James Doye Abstract Computer algebra systems are large collections of routines for solving mathematical problems algorithmically eciently and ab ove all symb olically The more advanced and rigorous computer algebra systems for example Axiom use the concept of strong typ es based on ordersorted algebra and category theory to ensure that op erations are only applied to expressions when they make sense In cases where Axiom uses notions whichare not covered by current mathematics we shall present new mathematics which will allow us to prove that all such cases are reducible to cases covered by the current theory On the other hand we shall also p oint out all the cases where Axiom deviates undesirably from the mathematical ideal Furthermore we shall prop ose solutions to these deviations Strongly typ ed systems esp ecially of mathematics b ecome unusable unless the system can change the typ e in a way a user exp ects We wish any typ e change exp ected by a user to be automated natural and unique Co ercions are normally viewed as natural typ e changing maps this thesis shall rigorously dene the word co ercion in the context of computer algebra systems We shall list some assumptions so that wemayprove new results so that all co ercions are unique this concept is called coherence We shall give an algorithm for automatically creating all co ercions in typ e system which adheres to a set of assumptions We shall prove that this is an algorithm and that it always returns a co ercion when one exists Finallywe present a demonstration implementation of this automated co ercion algorithm in Axiom Contents Intro duction Intro duction Computer algebra Strong typ es categories varieties and theories Abstract datatyp es in general The problem Examples of how Axiom co erces Mathematical solution overview Constructing co ercions algorithmically Background of Axiom OBJ Aims of the thesis Typ es in computer algebra Intro duction Mathematica Maple Reduce Axiom Economyofeort Interest Contents Functoriality Newsp eak Magma OBJ Ob jects Theories Views Comparison Category theory Intro duction Category theory Categories and Axiom Functors and Axiom Co ercion and category theory Conclusion Order sorted algebra Intro duction Universal Algebra Term Algebras Ordersorted algebras Extension of signatures The equational calculus Signatures theories varieties and Axiom Conclusion Extending order sorted algebra Intro duction Contents Partial Functions Conditional varieties A Category theory approach Co ercion Conclusion Coherence Intro duction Web ers work I denitions Web ers work I I assumptions and a conjecture The coherence theorem Extending the coherence theorem Conclusion The automated co ercion algorithm Intro duction Finitely generated algebras Constructibility The algorithm Existence of the co ercion Proving co erciveness Conclusion Implementation details Intro duction Bo ot and Axiom The top level Lab elling op erators Getting information from domains Contents Checking information from domains Flaws in the implementation Conclusion Making Axiom algebraically correct Intro duction Explicitly dened theories Op erator symb ols and names Moving certain op erators Retyping certain sorts Sorts and their order Altering Axioms databases Conclusion Conclusions Intro duction Summary of work done Formalising strongly typ ed algebra systems Representation and syntax issues On coherence The automated co ercion algorithm Future work and extensions A Extra category theory A Intro duction A Extra denitions B Set theory B Intro duction B Basics Contents B Inductive class approximation B Inductive classes and category theory B Inductive classes categories and Axiom Bibliography Structure of the Thesis Structure of the Thesis The thesis can b e viewed as decomp osable into the following topics Background and existing theory Chapter intro duces computer algebra systems in general strong typing and abstract datatyping We intro duce some of the problems that can occur in a strongly typ ed language which uses abstract datatyp es We present an analogy of the solution to one of the problems in such a system In chapter we.
Load more

Recommended publications
  • EM-Training for Weighted Aligned Hypergraph Bimorphisms
    EM-Training for Weighted Aligned Hypergraph Bimorphisms Frank Drewes Kilian Gebhardt and Heiko Vogler Department of Computing Science Department of Computer Science Umea˚ University Technische Universitat¨ Dresden S-901 87 Umea,˚ Sweden D-01062 Dresden, Germany [email protected] [email protected] [email protected] Abstract malized by the new concept of hybrid grammar. Much as in the mentioned synchronous grammars, We develop the concept of weighted a hybrid grammar synchronizes the derivations aligned hypergraph bimorphism where the of nonterminals of a string grammar, e.g., a lin- weights may, in particular, represent proba- ear context-free rewriting system (LCFRS) (Vijay- bilities. Such a bimorphism consists of an Shanker et al., 1987), and of nonterminals of a R 0-weighted regular tree grammar, two ≥ tree grammar, e.g., regular tree grammar (Brainerd, hypergraph algebras that interpret the gen- 1969) or simple definite-clause programs (sDCP) erated trees, and a family of alignments (Deransart and Małuszynski, 1985). Additionally it between the two interpretations. Seman- synchronizes terminal symbols, thereby establish- tically, this yields a set of bihypergraphs ing an explicit alignment between the positions of each consisting of two hypergraphs and the string and the nodes of the tree. We note that an explicit alignment between them; e.g., LCFRS/sDCP hybrid grammars can also generate discontinuous phrase structures and non- non-projective dependency structures. projective dependency structures are bihy- In this paper we focus on the task of training an pergraphs. We present an EM-training al- LCFRS/sDCP hybrid grammar, that is, assigning gorithm which takes a corpus of bihyper- probabilities to its rules given a corpus of discon- graphs and an aligned hypergraph bimor- tinuous phrase structures or non-projective depen- phism as input and generates a sequence dency structures.
    [Show full text]
  • Domain Theory and the Logic of Observable Properties
    Domain Theory and the Logic of Observable Properties Samson Abramsky Submitted for the degree of Doctor of Philosophy Queen Mary College University of London October 31st 1987 Abstract The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic is geometric, which can be com- putationally interpreted as the logic of observable properties—i.e. properties which can be determined to hold of a process on the basis of a finite amount of information about its execution. These ideas lead to the following programme: 1. A metalanguage is introduced, comprising • types = universes of discourse for various computational situa- tions. • terms = programs = syntactic intensions for models or points. 2. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. 3. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatizes the properties they satisfy. 2 4. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism.
    [Show full text]
  • Algebraic Implementation of Abstract Data Types*
    Theoretical Computer Science 20 (1982) 209-263 209 North-Holland Publishing Company ALGEBRAIC IMPLEMENTATION OF ABSTRACT DATA TYPES* H. EHRIG, H.-J. KREOWSKI, B. MAHR and P. PADAWITZ Fachbereich Informatik, TV Berlin, 1000 Berlin 10, Fed. Rep. Germany Communicated by M. Nivat Received October 1981 Abstract. Starting with a review of the theory of algebraic specifications in the sense of the ADJ-group a new theory for algebraic implementations of abstract data types is presented. While main concepts of this new theory were given already at several conferences this paper provides the full theory of algebraic implementations developed in Berlin except of complexity considerations which are given in a separate paper. The new concept of algebraic implementations includes implementations for algorithms in specific programming languages and on the other hand it meets also the requirements for stepwise refinement of structured programs and software systems as introduced by Dijkstra and Wirth. On the syntactical level an algebraic implementation corresponds to a system of recursive programs while the semantical level is defined by algebraic constructions, called SYNTHESIS, RESTRICTION and IDENTIFICATION. Moreover the concept allows composition of implementations and a rigorous study of correctness. The main results of the paper are different kinds of correctness criteria which are applied to a number of illustrating examples including the implementation of sets by hash-tables. Algebraic implementations of larger systems like a histogram or a parts system are given in separate case studies which, however, are not included in this paper. 1. Introduction The concept of abstract data types was developed since about ten years starting with the debacles of large software systems in the late 60's.
    [Show full text]
  • Axiom / Fricas
    Axiom / FriCAS Christoph Koutschan Research Institute for Symbolic Computation Johannes Kepler Universit¨atLinz, Austria Computer Algebra Systems 15.11.2010 Master's Thesis: The ISAC project • initiative at Graz University of Technology • Institute for Software Technology • Institute for Information Systems and Computer Media • experimental software assembling open source components with as little glue code as possible • feasibility study for a novel kind of transparent single-stepping software for applied mathematics • experimenting with concepts and technologies from • computer mathematics (theorem proving, symbolic computation, model based reasoning, etc.) • e-learning (knowledge space theory, usability engineering, computer-supported collaboration, etc.) • The development employs academic expertise from several disciplines. The challenge for research is interdisciplinary cooperation. Rewriting, a basic CAS technique This technique is used in simplification, equation solving, and many other CAS functions, and it is intuitively comprehensible. This would make rewriting useful for educational systems|if one copes with the problem, that even elementary simplifications involve hundreds of rewrites. As an example see: http://www.ist.tugraz.at/projects/isac/www/content/ publications.html#DA-M02-main \Reverse rewriting" for comprehensible justification Many CAS functions can not be done by rewriting, for instance cancelling multivariate polynomials, factoring or integration. However, respective inverse problems can be done by rewriting and produce human readable derivations. As an example see: http://www.ist.tugraz.at/projects/isac/www/content/ publications.html#GGTs-von-Polynomen Equation solving made transparent Re-engineering equation solvers in \transparent single-stepping systems" leads to types of equations, arranged in a tree. ISAC's tree of equations are to be compared with what is produced by tracing facilities of Mathematica and/or Maple.
    [Show full text]
  • Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl
    Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl To cite this version: Wolfram Kahl. Categories of Coalgebras with Monadic Homomorphisms. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.151-167, 10.1007/978-3-662-44124-4_9. hal-01408758 HAL Id: hal-01408758 https://hal.inria.fr/hal-01408758 Submitted on 5 Dec 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution| 4.0 International License Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl McMaster University, Hamilton, Ontario, Canada, [email protected] Abstract. Abstract graph transformation approaches traditionally con- sider graph structures as algebras over signatures where all function sym- bols are unary. Attributed graphs, with attributes taken from (term) algebras over ar- bitrary signatures do not fit directly into this kind of transformation ap- proach, since algebras containing function symbols taking two or more arguments do not allow component-wise construction of pushouts. We show how shifting from the algebraic view to a coalgebraic view of graph structures opens up additional flexibility, and enables treat- ing term algebras over arbitrary signatures in essentially the same way as unstructured label sets.
    [Show full text]
  • Arxiv:2102.02679V1 [Cs.LO] 4 Feb 2021 HOL-ODE [10], Which Supports Reasoning for Systems of Ordinary Differential Equations (Sodes)
    Certifying Differential Equation Solutions from Computer Algebra Systems in Isabelle/HOL Thomas Hickman, Christian Pardillo Laursen, and Simon Foster University of York Abstract. The Isabelle/HOL proof assistant has a powerful library for continuous analysis, which provides the foundation for verification of hybrid systems. However, Isabelle lacks automated proof support for continuous artifacts, which means that verification is often manual. In contrast, Computer Algebra Systems (CAS), such as Mathematica and SageMath, contain a wealth of efficient algorithms for matrices, differen- tial equations, and other related artifacts. Nevertheless, these algorithms are not verified, and thus their outputs cannot, of themselves, be trusted for use in a safety critical system. In this paper we integrate two CAS systems into Isabelle, with the aim of certifying symbolic solutions to or- dinary differential equations. This supports a verification technique that is both automated and trustworthy. 1 Introduction Verification of Cyber-Physical and Autonomous Systems requires that we can verify both discrete control, and continuous evolution, as envisaged by the hy- brid systems domain [1]. Whilst powerful bespoke verification tools exist, such as the KeYmaera X [2] proof assistant, software engineering requires a gen- eral framework, which can support a variety of notations and paradigms [3]. Isabelle/HOL [4] is a such a framework. Its combination of an extensible fron- tend for syntax processing, and a plug-in oriented backend, based in ML, which supports a wealth of heterogeneous semantic models and proof tools, supports a flexible platform for software development, verification, and assurance [5,6,7]. Verification of hybrid systems in Isabelle is supported by several detailed li- braries of Analysis, including Multivariate Analysis [8], Affine Arithmetic [9], and arXiv:2102.02679v1 [cs.LO] 4 Feb 2021 HOL-ODE [10], which supports reasoning for Systems of Ordinary Differential Equations (SODEs).
    [Show full text]
  • Abstraction and Abstraction Refinement in the Verification Of
    Abstraction and Abstraction Refinement in the Verification of Graph Transformation Systems Vom Fachbereich Ingenieurwissenschaften Abteilung Informatik und angewandte Kognitionswissenschaft der Unversit¨at Duisburg-Essen zur Erlangung des akademischen Grades eines Doktor der Naturwissenschaften (Dr.-rer. nat.) genehmigte Dissertation von Vitaly Kozyura aus Magadan, Russland Referent: Prof. Dr. Barbara K¨onig Korreferent: Prof. Dr. Arend Rensink Tag der m¨undlichen Pr¨ufung: 05.08.2009 Abstract Graph transformation systems (GTSs) form a natural and convenient specification language which is used for modelling concurrent and distributed systems with dynamic topologies. These can be, for example, network and Internet protocols, mobile processes with dynamic behavior and dynamic pointer structures in programming languages. All this, together with the possibility to visualize and explain system behavior using graphical methods, makes GTSs a well-suited formalism for the specification of complex dynamic distributed systems. Under these circumstances the problem of checking whether a certain property of GTSs holds – the verification problem – is considered to be a very important question. Unfortunately the verification of GTSs is in general undecidable because of the Turing- completeness of GTSs. In the last few years a technique for analysing GTSs based on approximation by Petri graphs has been developed. Petri graphs are Petri nets having additional graph structure. In this work we focus on the verification techniques based on counterexample-guided abstraction refinement (CEGAR approach). It starts with a coarse initial over-approxi- mation of a system and an obtained counterexample. If the counterexample is spurious then one starts a refinement procedure of the approximation, based on the structure of the counterexample.
    [Show full text]
  • MATH2010-1 Logiciels Mathématiques
    MATH2010-1 Logiciels mathématiques Émilie Charlier Département de Mathématique Université de Liège 10 février 2020 Calculatrices électroniques I La HP-35, commercialisée en janvier 1972 par Hewlett-Packard. I Première calculatrice scientifique. I Devient célèbre sous le nom de “règle à calcul électronique”. I 395 dollars (moitié du salaire mensuel d’un enseignant de l’époque). https://fr.wikipedia.org/wiki/HP-35 Calculatrices graphiques I La TI-89, commercialisée par Texas Instruments en 1998. I Calcul formel. I Possibilités de programmation. http://fr.wikipedia.org/wiki/Calculatrice (Une multitude de) logiciels mathématiques Depuis 1960, au moins 45 logiciels mathématiques : Axiom FORM Magnus MuPAD SyMAT Cadabra FriCAS Maple OpenAxiom SymbolicC++ Calcinator FxSolver Mathcad PARI/GP Symbolism CoCoA-4 GAP Mathematica Reduce Symengine CoCoA-5 GiNaC MathHandbook Scilab SymPy Derive KANT/KASH Mathics SageMath TI-Nspire DataMelt Macaulay2 Mathomatic SINGULAR Wolfram Alpha Erable Macsyma Maxima SMath Xcas/Giac Fermat Magma MuMATH Symbolic Yacas http://en.wikipedia.org/wiki/List_of_computer_algebra_systems Logiciels de mathématiques Quelques logiciels commerciaux : I Maple, Waterloo Maple Inc., Maplesoft, depuis 1985. I Mathematica, Wolfram Research, depuis 1988. I Matlab, MathWorks, depuis 1989 I Magma, University of Sydney, depuis 1990 Quelques logiciels libres : I Maxima, W. Schelter et coll., depuis 1967 : Calcul symbolique I Singular, U. Kaiserslautern, depuis 1984 : Polynômes I PARI/GP, U. Bordeaux 1, depuis 1985 : Théorie des nombres I GAP, GAP Group, depuis 1986 : Théorie des groupes I R, U. Auckland, New Zealand, depuis 1993 : Statistiques Deux distinctions importantes I Calcul numérique vs calcul symbolique I Logiciel libre vs logiciel commercial Dans ce cours, présentation de 4 logiciels : I Mathematica : commercial, calcul symbolique I SymPy : libre, calcul symbolique I Geogebra : gratuit, géométrie et algèbre I Calc : gratuit, tableurs Remarque : gratuit 6= libre.
    [Show full text]
  • Collaborative Use of Ketcindy and Free Cass for Making Materials 1
    Collaborative Use of KeTCindy and Free CASs for Making Materials Setsuo Takato1, Alasdair McAndrew2, Masataka Kaneko3 1 Toho University, Japan, [email protected] 2 Victoria University, Australia, [email protected] 3 Toho University, Japan, [email protected] 1 Introduction Many mathematics teachers at collegiate level use LATEX to write materials for dis- tribution to their classes. As is well known, LATEX can typeset complex mathe- matical formulas. On the other hand, it has poor ability to create figures. One possibility might be to use a third-party package, such as TiKZ. However, TiKZ coding is complicated and is not easy to read even for the following simple figure. y y = x y = sinx x O Figure 1 A simple example TiKZ can in fact produce figures of great complexity, but its power comes at the cost of a steep learning curve. In order to provide a system for easy creation of publication quality figures, the first author has developed KETpic, the first version of which was released in 2006. KETpic is a macro package of mathematical soft- ware such as Maple, Mathematica, Scilab and R. The recent version uses Scilab mainly and R secondarily. The flow of generating and inserting graphs with KETpic is as follows. 1. KETpic and Scilab commands are listed in a Scilab editor and executed by Scilab. 2. Scilab generates a LATEX file composed of codes for drawing figures. 3. That file can be inserted into a LATEX document with \input command. 4. The document can be compiled to produce a pdf file.
    [Show full text]
  • Syntax and Semantics in Algebra Jean-François Nicaud, Denis Bouhineau, Jean-Michel Gélis
    Syntax and semantics in algebra Jean-François Nicaud, Denis Bouhineau, Jean-Michel Gélis To cite this version: Jean-François Nicaud, Denis Bouhineau, Jean-Michel Gélis. Syntax and semantics in algebra. Pro- ceedings of the 12th ICMI Study Conference. The University of Melbourne, 2001, Australia. 12 p. hal-00962023 HAL Id: hal-00962023 https://hal.archives-ouvertes.fr/hal-00962023 Submitted on 25 Mar 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. 1 Syntax and Semantics in Algebra Jean-François Nicaud, Denis Bouhineau Jean-Michel )*lis I IN, University of Nantes, France IUFM of Versailles, France $bouhineau, nicaud%&irin.univ-nantes.fr gelis&inrp.fr This paper is the first chapter of a cognitive, didactic and computatio- nal theory of algebra that presents, in a formal .ay, .ell /no.n elements of mathematics 0numbers, functions and polynomials1 as semantic ob2ects, and expressions as syntactic constructions. The lin/ bet.een syntax and semantics is realised by morphisms. The paper highlights preferred semantics for algebra and defines formally algebraic problems. 3ey.ords4 syntax, semantics, formalisation, algebraic problem. Introduction This paper describes a theory of algebra .ith cognitive, didactic and computational features.
    [Show full text]
  • Lecture Notes for MATH 770 : Foundations of Mathematics — University of Wisconsin – Madison, Fall 2005
    Lecture notes for MATH 770 : Foundations of Mathematics — University of Wisconsin – Madison, Fall 2005 Ita¨ıBEN YAACOV Ita¨ı BEN YAACOV, Institut Camille Jordan, Universite´ Claude Bernard Lyon 1, 43 boulevard du 11 novembre 1918, 69622 Villeurbanne Cedex URL: http://math.univ-lyon1.fr/~begnac/ c Ita¨ıBEN YAACOV. All rights reserved. CONTENTS Contents Chapter 1. Propositional Logic 1 1.1. Syntax 1 1.2. Semantics 3 1.3. Syntactic deduction 6 Exercises 12 Chapter 2. First order Predicate Logic 17 2.1. Syntax 17 2.2. Semantics 19 2.3. Substitutions 22 2.4. Syntactic deduction 26 Exercises 35 Chapter 3. Model Theory 39 3.1. Elementary extensions and embeddings 40 3.2. Quantifier elimination 46 Exercises 51 Chapter 4. Incompleteness 53 4.1. Recursive functions 54 4.2. Coding syntax in Arithmetic 59 4.3. Representation of recursive functions 64 4.4. Incompleteness 69 4.5. A “physical” computation model: register machines 71 Exercises 75 Chapter 5. Set theory 77 5.1. Axioms for set theory 77 5.2. Well ordered sets 80 5.3. Cardinals 86 Exercises 94 –sourcefile– iii Rev: –revision–, July 22, 2008 CONTENTS 1.1. SYNTAX CHAPTER 1 Propositional Logic Basic ingredients: • Propositional variables, which will be denoted by capital letters P,Q,R,..., or sometimes P0, P1, P2,.... These stand for basic statements, such as “the sun is hot”, “the moon is made of cheese”, or “everybody likes math”. The set of propositional variables will be called vocabulary. It may be infinite. • Logical connectives: ¬ (unary connective), →, ∧, ∨ (binary connectives), and possibly others. Each logical connective is defined by its truth table: A B A → B A ∧ B A ∨ B A ¬A T T T T T T F T F F F T F T F T T F T F F T F F Thus: • The connective ¬ means “not”: ¬A means “not A”.
    [Show full text]
  • Computer Algebra Independent Integration Tests 0 Independent Test Suites/Hebisch Problems
    Computer algebra independent integration tests 0_Independent_test_suites/Hebisch_Problems Nasser M. Abbasi November 25, 2018 Compiled on November 25, 2018 at 10:22pm Contents 1 Introduction 2 2 detailed summary tables of results 9 3 Listing of integrals 11 4 Listing of Grading functions 25 1 2 1 Introduction This report gives the result of running the computer algebra independent integration problems.The listing of the problems are maintained by and can be downloaded from Albert Rich Rubi web site. 1.1 Listing of CAS systems tested The following systems were tested at this time. 1. Mathematica 11.3 (64 bit). 2. Rubi 4.15.2 in Mathematica 11.3. 3. Rubi in Sympy (Version 1.3) under Python 3.7.0 using Anaconda distribution. 4. Maple 2018.1 (64 bit). 5. Maxima 5.41 Using Lisp ECL 16.1.2. 6. Fricas 1.3.4. 7. Sympy 1.3 under Python 3.7.0 using Anaconda distribution. 8. Giac/Xcas 1.4.9. Maxima, Fricas and Giac/Xcas were called from inside SageMath version 8.3. This was done using SageMath integrate command by changing the name of the algorithm to use the different CAS systems. Sympy was called directly using Python. Rubi in Sympy was also called directly using sympy 1.3 in python. 1.2 Design of the test system The following diagram gives a high level view of the current test build system. POST PROCESSOR SCRIPT Mathematica script Result table Rubi script Result table Test files from Program that Albert Rich Rubi Maple script Result table generates the web site Latex report PDF using input Result table Latex report Python script to test sympy from the result tables Giac Result table SageMath/Python HTML Fricas Result table script to test SageMath Maxima, Fricas, Giac Maxima Result table One record (line) per one integral result.
    [Show full text]