Proving Theorems about LISP Functions
Journal of the ACM (JACM)
Correspondence between ALGOL 60 and Church's Lambda-notation: part I
Communications of the ACM
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
| Hi-index | 0.00 |
This note is a response to B. Buchberger call for Eurocal'85. It argues that the current scope of symbolic computation is a very active branch of computer science, whose extremes are classical algorithm theory on one hand, and proof theory on the other hand. The main paradigm of the domain is that algorithms, programming languages as well as mathematical proofs are all mathematical formulae subject to computer treatment.