Conference
Towards Specifying Symbolic Computation
Abstract
Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to specify in a formal logic since they involve an interplay of syntax and semantics. In this paper we discuss several examples of syntax-based mathematical algorithms, and we show how to specify them in a …
Authors
Carette J; Farmer WM
Series
Lecture Notes in Computer Science
Volume
11617
Pagination
pp. 109-124
Publisher
Springer Nature
Publication Date
2019
DOI
10.1007/978-3-030-23250-4_8
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743