Abstract
Cayley, version 4, is a proposed knowledge-based system for modern algebra. The proposal integrates the existing powerful algorithm base of Cayley with modest deductive facilities and large sophisticated databases of groups and related algebraic structures. The outcome will be a revolutionary computer algebra system.
The user language of Cayley, version 4, is the first stage of the project to develop a computer algebra system which integrates algorithmic, deductive, and factual knowledge. The language plays an important role in shaping the users' communication of their knowledge to the system, and in presenting the results to the user. The very survival of a system depends upon its acceptance by the users, so the language must be natural, extensible, and powerful. The major changes in the language (over version 3) are the definitions of algebraic structures, set constructors and associated control structures, the definitions of maps and homomorphisms, the provision of packages for procedural abstraction and encapsulation, database facilities, and other input/output. The motivation for these changes has been the need to provide facilities for a knowledge-based system; to allow sets to be defined by properties; and to remove semantic ambiguities of structure definitions.
The language design is complete and the implementation of an interpreter is well under way. A prototype database containing information about the small simple groups (that is, those of order less than one million) is being implemented in Prolog. The integration of the database with Cayley remains to be done, as does the provision of an inference engine. However, the language design does accommodate the future needs of the database and the inference engine.
Preview
Unable to display preview. Download preview PDF.
References
John J. Cannon, A Language for Group Theory, Department of Pure Mathematics, University of Sydney, 1982, 300 pages.
John J. Cannon, An introduction to the group theory language, Cayley, Computational Group Theory (Proceedings of the London Mathematical Society Symposium on Computational Group Theory, Durham, England, July 30–August 9, 1982), M. D. Atkinson, editor, Academic Press, London, 1984, 145–183.
J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker, R.A. Wilson, Atlas of Finite Groups, Clarendon Press, Oxford, 1985.
M. Hall, Jr and J.K. Senior, The Groups of Order 2n, (n≤6), Macmillan, New York, 1964.
K. Kennedy and J. Schwartz, An introduction to the set theoretical language SETL, Comp. and Maths with Appls, 1 (1975) 97–119.
M.F. Newman and E.A. O'Brien, A Cayley library for the groups of order dividing 128, submitted to Proceedings of the Singapore Group Theory Conference,June 1987.
C.C. Sims, Computational methods in the study of permutation groups, Computational Problems in Abstract Algebra, (Proceedings of a conference, Oxford, 1967), John Leech (editor), Pergamon, Oxford, 1970, 169–183. (and unpublished manuscript)
N. Wirth, Programming in Modula-2, Springer-Verlag, Berlin, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butler, G., Cannon, J. (1989). Cayley, version 4: The user language. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_43
Download citation
DOI: https://doi.org/10.1007/3-540-51084-2_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51084-0
Online ISBN: 978-3-540-46153-1
eBook Packages: Springer Book Archive