The Transrational Numbers as an Abstract Data Type
DOI:
https://doi.org/10.36285/tm.47Keywords:
rational numbers, arithmetical structures, division by zero, meadows, wheels, transrationals, equational specification, initial algebra semanticsAbstract
In an arithmetical structure one can make division a total function by defining 1/0 to be an element of the structure, or by adding a new element, such as an error element also denoted with a new constant symbol, an unsigned infinity or one or both signed infinities, one positive and one negative. We define an enlargement of a field to a transfield, in which division is totalised by setting 1/0 equal to the positive infinite value and -1/0 equal to its opposite, and which also contains an error element to help control their effects. We construct the transrational numbers as a transfield of the field of rational numbers and consider it as an abstract data type. We give it an equational specification under initial algebra semantics.
References
J.A.D.W. Anderson, N. Völker, and A.A. Adams. Perspex Machine VIII: axioms of transreal arithmetic. In Longin Jan Latecki, David M. Mount,and Angela Y. Wu, editors, Vision Geometry XV, volume 6499, pages 7 –18. SPIE, 2007.
Anon. British computer scientist’s new “nullity” idea provokes reaction from mathematicians. 2011.
J.A. Bergstra and J.V. Tucker. Algebraic specifications of computable and semicomputable data types. Theoretical Computer Science, 50:137–181,1987.
J.A. Bergstra. Division by zero: A survey of options. Transmathematica,1(1):1–20, 2019.
J.A. Bergstra, I. Bethke, and A. Ponse. Cancellation meadows: A generic basis theorem and some applications. Computer Journal, 56(1):3–14, 2013.
J.A. Bergstra, Y. Hirshfeld, and J.V. Tucker. Meadows and the equational specification of division. Theoretical Computer Science, 410(12-13):1261–1271, 2009.
J.A. Bergstra and C.A. Middelburg. Inversive meadows and divisive meadows. J. Applied Logic, 9(3):203–220, 2011.
J.A. Bergstra and C.A. Middelburg. Transformation of fractions into simple fractions in divisive meadows. J. Applied Logic, 16:92–110, 2016
J.A. Bergstra and A. Ponse. Division by zero in common meadows. In Rocco De Nicola and Rolf Hennicker, editors, Software, Services, and Systems - Essays Dedicated to Martin Wirsing on the Occasion of His Retirement from the Chair of Programming and Software Engineering, volume 8950 of Lecture Notes in Computer Science, pages 46–61. Springer, 2015.
J.A. Bergstra and A. Ponse. Fracpairs and fractions over a reduced commutative ring. Indagationes Mathematicae, 27:727–748, 2016.
J.A. Bergstra and A. Ponse. Probability functions in the context of signed involutive meadows (extended abstract). In Recent Trends in Algebraic Development Techniques - 23rd IFIP WG 1.3 International Workshop, WADT2016, Gregynog, UK, September 21-24, 2016, Revised Selected Papers, pages 73–87, 2016.
J.A. Bergstra and J.V. Tucker. The completeness of the algebraic specification methods for computable data types. Information and Control, 54(3):186–200, 1982.
J.A. Bergstra and J.V. Tucker. Initial and final algebra semantics for datatype specifications: Two characterization theorems. SIAM Journal of Computing, 12(2):366–387, 1983.
J.A. Bergstra and J.V. Tucker. The rational numbers as an abstract datatype. Journal ACM, 54(2):7, 2007.
J.A. Bergstra and J.V. Tucker. Division safe calculation in totalised fields. Theory Computing Systems, 43(3-4):410–424, 2008.
J.A. Bergstra and J.V. Tucker. The wheel of rational numbers as an abstract data type. Workshop on Algebraic Development Techniques, SLNCS, to appear, 2020.
J. Carlström. Wheels: on division by zero. Mathematical Structures in Computer Science, 14:143–184, 2004.
T.S. dos Reis, W. Gomide, and J.A.D.W. Anderson. Construction of thetransreal numbers and algebraic transfields. IAENG International Journalof Applied Mathematics, 46(1):11–23, 2016.
H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations und Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer, 1985.
J. Loeckx, H-D Ehrich, and M. Wolf. Specification of abstract data types. Wiley, 1996.
K. Meinke and J.V. Tucker. Universal algebra. In S Abramsky, D Gabbay,and T Maibaum, editors, Handbook of Logic for Computer Science, pages 189–411. Oxford University Press, 1992.
H. Ono. Equational theories and universal theories of fields. Journal of theMathematical Society of Japan, 35(2):289–306, 1983.
D.A. Patterson and J.L. Hennessy. Computer Organisation and Design: The Hardware/Software Interface. Morgan Kaufmann, 1998.
A. Setzer. Wheels (draft). 1997.
V. Stoltenberg-Hansen and J.V. Tucker. Effective algebras. In S Abramsky, D Gabbay, and T Maibaum, editors, Handbook of Logic in Computer Science. Volume IV: Semantic Modelling, pages 357–526. Oxford UniversityPress, 1995.
V. Stoltenberg-Hansen and J.V. Tucker. Computable rings and fields. In E Griffor, editor, Handbook of Computability Theory, pages 363–447. Else-vier, 1999.
W. Wechler. Universal Algebra for Computer Scientists. Springer-Verlag,1992.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 J.A. Bergstra
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors retain copyright and, if appropriate, performance rights but licence the journal to publish submissions. The lead author confirms that the submission is bound by the CC Attributtion Share Alike 4.0 licence.
