Maple's evaluation process as constraint contextual rewriting

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 32-37

  Armando, A ^a   Ballarin, C ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER SIMULATION; DECISION THEORY; FORMAL LOGIC; INTEGRATION; INTERFACES (COMPUTER); MATHEMATICAL TRANSFORMATIONS; RECURSIVE FUNCTIONS; SEMANTICS; THEOREM PROVING;

AUGMENTATION; AUTOMATED REASONING; CONSTRAINT CONTEXTUAL REWRITING; MAPLES EVALUATION;

FUNCTION EVALUATION;

EID: 0034776825     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384107     Document Type: Conference Paper

References (10)

1. RDL - Rewrite and decision procedure laboratory
2. Constraint contextual rewriting
3. Termination of constraint contextual rewriting
4. Interfacing computer algebra and deduction systems via the logic broker architecture
5. A pragmatic approach to extending provers by computer algebra - With applications to coding theory
6. Simplification and the assume facility
7. Rewriting systems
8. A skeptic's approach to combining HOL and maple
9. An assume facility for CAS, with a sample implementation for maple