Formal methods for extensions to CAS

Dunstan, Martin; Kelsey, Tom; Martin, Ursula; Linton, Steve

doi:10.1007/3-540-48118-4_43

Search citation statements

Order By: Relevance

Paper Sections

Select...

Computer Algebra and Automated Reasoning1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2000

2004

Publication Types

Select...

Book3

Article1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Automated reasoning may be used to provide support for the correctness of computer algebra systems, as in Dunstan (1999); Dunstan et al (1998Dunstan et al ( , 1999 and Kelsey (2000). Here we are generally saying that, if…”

Section: Computer Algebra and Automated Reasoningmentioning

confidence: 98%

Equality in Computer Algebra and Beyond

Davenport

2002

Journal of Symbolic Computation

View full text Add to dashboard Cite

Equality is such a fundamental concept in mathematics that, in fact, we seldom explore it in detail, and tend to regard it as trivial. When it is shown to be non-trivial, we are often surprised. As is often the case, the computerization of mathematical computation in computer algebra systems on the one hand, and mathematical reasoning in theorem provers on the other hand, forces us to explore the issue of equality in greater detail.

show abstract

Section: Computer Algebra and Automated Reasoningmentioning

confidence: 98%