The rational numbers as an abstract data type

Journal of the ACM

Volumn 54, Issue 2, 2007, Pages

  Bergstra, J A ^a   Tucker, J V ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Abstract data types; Algebraic specification; Computable algebras; Division by zero; Equations; Field; Initial algebra; Meadow; Rational numbers; Total versus partial functions

Indexed keywords

ALGEBRA; PROBLEM SOLVING; SEMANTICS; SPECIFICATIONS;

ABSTRACT DATA TYPES; ALGEBRAIC SPECIFICATION; COMPUTABLE ALGEBRAS; DIVISION-BY-ZERO; INITIAL ALGEBRA; RATIONAL NUMBERS;

DIFFERENTIAL EQUATIONS;

EID: 34247247158     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1219092.1219095     Document Type: Article

References (36)

1. ADAMEK, J., HEBERT, M., AND ROSICKY, J. 2002. On abstract data types presented by multiequations. Theoret. Comput. Sci. 275, 427-462.
2. BERGSTRA, J. A. 2006. Elementary algebraic specifications of the rational function field. In Logical approaches to computational barriers. Proceedings of Computability in Europe 2006, A. Beckmann et al. Eds. Lecture Notes in Computer Science, vol. 3988, Springer-Verlag, New York, 40-54.
3. BERGSTRA, J. A., AND TUCKER, J. V. 1982. The completeness of the algebraic specification methods for data types. Inf. Cont. 54, 186-200.
4. BERGSTRA, J. A., AND TUCKER, J. V. 1983. Initial and final algebra semantics for data type specifications: Two characterisation theorems. SIAM J. Comput. 12, 366-387.
5. BERGSTRA, J. A., AND TUCKER, J. V. 1987. Algebraic specifications of computable and semicomputable data types. Theoret. Comput. Sci. 50, 137-181.
6. BERGSTRA, J. A., AND TUCKER, J. V. 1995. Equational specifications, complete term rewriting systems, and computable and semicomputable algebras. J. ACM 42, 1194-1230.
7. BERGSTRA, J. A., AND TUCKER, J. V. 2005. The rational numbers as an abstract data type. Res. Rep. PRG0504, Programming Research Group, University of Amsterdam, August 2005, orTech. Rep. CSR12-2005, Department of Computer Science, University of Wales, Swansea, August 2005.
8. BERGSTRA, J. A., AND TUCKER, J. V. 2006a. Elementary algebraic specifications of the rational complex numbers. In Goguen Festschrift, K. Futatsugi et al., Eds. Lecture Notes in Computer Science, vol. 4060. Springer-Verlag, New York, pp. 459-475.
9. BERGSTRA, J. A., AND TUCKER, J. V. 2006b. Division safe calculation in totalised fields. Res. Rep. PRG 0605, Programming Research Group, University of Amsterdam, September 2006 or Tech. Rep. CSR 14-2006, Department of Computer Science, University of Wales Swansea, September 2006.
10. CALKIN, N., AND WILF, H. S. 2000. Recounting the rationals. Amer. Math. Monthly 107, 360-363.
11. CARLSTRÖM, J. 2004. Wheels - On division by zero. Math. Struct. Comput. Sci. 14, 143-184.
12. CHEN, M., AND TUCKER, J. V. 2000. Constructive volume geometry. Computer Graphics Forum 19, 281-293.
13. CONTEJEAN, E., MARCHE, C., AND RABEHASAINA, L. 1997. Rewrite systems for natural, integral, and rational arithmetic. In Rewriting Techniques and Applications 1997. Lecture Notes in Computer Science vol. 1232. Springer-Verlag, Berlin, Germany, pp. 98-112.
14. DICKSON, L. E. 1952. History of the Theory of Numbers. Chelsea, New York.
15. GOGUEN, J. A., THATCHER, J. W., AND WAGNER, E. G. 1978. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Current Trends in Programming Methodology. IV. Data Structuring R.T. Yeh, Ed., Prentice-Hall, Engelwood Cliffs, pp. 80-149.
16. HARRISON, J. 1998. Theorem Proving with the Real Numbers, Springer-Verlag, New York.
17. HAVERAAEN, M. 2000. Case study on algebraic software methodologies for scientific computing. Sci. Prog. 5, 261-273.
18. HAVERAAEN, M., FRIIS, H. A., AND MUNTHE-KAAS, H. 2005. Computable scalar fields: A basis for PDE software. J. Logic Alg. Prog. 65, 36-49.
19. HODGES, W. 1993. Model Theory. Cambridge University Press, Cambridge, UK.
20. MEINKE, K., AND TUCKER, J. V. 1992. Universal algebra. In Handbook of Logic in Computer Science. Volume 1: Mathematical Structures, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Oxford University Press, Oxford, UK, pp. 189-411.
21. MESEGUER, J., AND GOGUEN, J. A. 1985. Initiality, induction and computability. In Algebraic Methods in Semantics. M. Nivat and J. Reynolds, Eds. Cambridge University Press, Cambridge, pp. 459-541.
22. KLOP, J. W. 1992. Term rewriting systems. In Handbook of Logic in Computer Science. Volume 2: Mathematical Structures, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Oxford University Press, Oxford, UK, pp. 1-116.
23. MOSS, L. 2001. Simple equational specifications of rational arithmetic. Discr. Math. Theoret. Comput. Sci. 4, 291-300.
24. ROGGENBACH, M., SCHRÖDER, L., AND MOSSAKOWSKI, T. 2004. Specifying real numbers in CASL. In Recent Trends in Algebraic Development Techniques. 14th International Workshop (WADT '99) (Chateau de Bonas, Sept. 15-18, 1999), D. Bert, C. Choppy, and P. D. Mosses, Eds. Lecture Notes in Computer Science, vol. 1827. Springer-Verlag, Berlin, 146-161.
25. SETZER, A. 1997. Wheels. Manuscript, 8 pp. Download at: http://www.cs.swan.ac.uk/csetzer.
26. STOLTENBERG-HANSEN, V., AND TUCKER, J. V. 1995. Effective algebras. In Handbook of Logic in Computer Science. Volume IV: Semantic Modelling, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Oxford University Press, Oxford, UK, pp. 357-526.
27. STOLTENBERG-HANSEN, V., AND TUCKER, J. V. 1999. Computable rings and fields. In Handbook of Computability Theory, E. Griffor, Ed. Elsevier, North-Holland, Amsterdam, The Netherlands, pp. 363-447.
28. STOLTENBERG-HANSEN, V., AND TUCKER, J. V. 1999. Concrete models of computation for topological algebras. Theoret. Comput. Sci. 219, 347-378.
29. TERESE, 2003. Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science 55, Cambridge University Press, Cambridge, UK.
30. TUCKER, J. V., AND ZUCKER, J. I. 2000. Computable functions and semicomputable sets on many sorted algebras. In Handbook of Logic for Computer Science. Volume V: Logic and Semantical Methods, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Oxford University Press, Oxford, UK, pp. 317-523.
31. TUCKER, J. V., AND ZUCKER, J. I. 2002. Infinitary initial algebraic specifications for stream algebras. In Reflections on the Foundations of Mathematics: Essays in honour of Solomon Feferman, W. Sieg, R. Somer and C. Talcott, Eds. Lecture Notes in Logic, Vol. 15, Association for Symbolic Logic, pp. 234-253.
32. TUCKER, J. V., AND ZUCKER, J. I. 2004. Abstract versus concrete computation on metric partial algebras. ACM Trans. Computat. Logic 5, 4, 611-668.
33. TUCKER, J. V., AND ZUCKER, J. I. 2005. Computable total functions on metric algebras, universal algebraic specifications and dynamical systems. J. Alg. Logic Prog. 62, 71-108.
34. WECHLER, W. 1992. Universal algebra for computer scientists. EATCS Monographs in Computer Science. Springer-Verlag, New York.
35. VAN WUNGAARDEN, A. 1966. Numerical analysis as an independent science. BIT 6, 68-81.
36. WIRSING, M. 1990. Algebraic specifications. In Handbook of Theoretical Computer Science. Volume B: Formal Models and Semantics, J. van Leeuwen, Ed. North-Holland, Amsterdam, The Netherland, pp. 675-788.