CAMAL 40 years on – is small still beautiful? (English) Zbl 1247.68323
Carette, Jacques (ed.) et al., Intelligent computer mathematics. 16th symposium, Calculemus 2009, 8th international conference, MKM 2009, held as part of CICM 2009, Grand Bend, Canada, July 6–12, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02613-3/pbk). Lecture Notes in Computer Science 5625. Lecture Notes in Artificial Intelligence, 32-44 (2009).
Summary: Over forty years ago an algebra system was written in Cambridge, UK, designed to assist in a number of calculations in celestial mechanics and later in relativity. I present the hardware environment and the main design decisions that led this system, later dubbed CAMAL, to be used in many applications for twenty years. Its performance is investigated, both in its own era, and more recently. It is argued that a compact data representation as in CAMAL has real benefits even in today’s larger memory world.
For the entire collection see [Zbl 1165.68005].
For the entire collection see [Zbl 1165.68005].
MSC:
| 68W30 | Symbolic computation and algebraic computation |
References:
| [1] | Barton, D., Bourne, S.R., Burgess, C.J.: A Simple Algebra System. Computer Journal 11, 293–298 (1968) · Zbl 0165.52102 · doi:10.1093/comjnl/11.3.293 |
| [2] | Barton, D.: A New Approach to the Lunar Theory. PhD thesis, University of Cambridge, 196 |
| [3] | Bourne, S.R.: Automatic Algebraic Manipulation and its Applications to the Lunar Theory. PhD thesis, University of Cambridge (1970) |
| [4] | Bourne, S.R., Horton, J.R.: The CAMAL System Manual. The Computer Laboratory, University of Cambridge (1971) |
| [5] | Bourne, S.R., Horton, J.R.: The Design of the Cambridge Algebra System. In: Proceedings of SYMSAM/2, pp. 134–143. SIGSAM/ACM (1971) · doi:10.1145/800204.806278 |
| [6] | Carette, J., Davenport, J.H., Fitch, J.: Barton and Fitch revisited (2009), http://opus.bath.ac.uk/14083 |
| [7] | Delaunay, C.: Théorie du Mouvement de la Lune (Extraits des Mém. Acad. Sci.). Mallet-Bachelier, Paris (1860) |
| [8] | Fitch, J.P.: A solution to Problem #3. SIGSAM Bulletin 26, 24–27 (1973) |
| [9] | Fitch, J.P.: REDUCE meets CAMAL. In: Fitch, J. (ed.) DISCO 1992. LNCS, vol. 721, pp. 104–115. Springer, Heidelberg (1993) · doi:10.1007/3-540-57272-4_28 |
| [10] | Fitch, J.P., Garnett, D.J.: Measurements on the Cambridge Algebra System. In: Proceedings of the International Computing Symposium, Venice, pp. 139–147 (1972) |
| [11] | Fitch, J.: A solution of problem #3 using camal. SIGSAM Bulletin 32, 14 (1975) |
| [12] | Fitch, J.P.: An Algebraic Manipulator. PhD thesis, University of Cambridge (1971) |
| [13] | Hall, A.D.: Solving a problem in eigenvalue approximation with a symbolic algebra system. SIGSAM Bulletin 26, 145–23 (1975) |
| [14] | Horton, J.R.: A System for the Manipulation of Tensors on an Automatic Computer. University of Cambridge, Dissertation for the Diploma in Computer Science (1969) |
| [15] | I.C.T. Ltd and Cambridge University. Atlas 2 System Programmers Manual, E.P. 59 (April 1964) |
| [16] | Irons, E.T.: A Syntax Directed Compiler for ALGOL 60. Comm. ACM 4(1), 51–55 (1961) · Zbl 0103.34904 · doi:10.1145/366062.366083 |
| [17] | Lew, J.S.: Problem #3 – reversion of a double series. SIGSAM Bulletin 23, 6–7 (1972) |
| [18] | Matthewman, J.R.: Syntax Directed Compilers. PhD thesis, University of Cambridge (1966) |
| [19] | Richards, M.: BCPL – a tool for compiler writing and systems programming. In: Proceedings of the Spring Joint Computer Conference, vol. 34, pp. 557–566 (1969) |
| [20] | Sconzo, P., LeSchack, A.R., Tobey, R.G.: Symbolic Computation of f and g Series by Computer. Astronomical Journal 70(4), 269–271 (1965) · doi:10.1086/109718 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
