Division safe calculation in totalised fields
From MaRDI portal
Publication:1015383
DOI10.1007/S00224-007-9035-4zbMath1162.68479OpenAlexW2157772625MaRDI QIDQ1015383
Publication date: 8 May 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9035-4
Related Items (4)
Arithmetical datatypes with true fractions ⋮ On system rollback and totalized fields: an algebraic approach to system change ⋮ The wheel of rational numbers as an abstract data type ⋮ Meadows and the equational specification of division
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic specifications of computable and semicomputable data types
- The data type variety of stack algebras
- Recounting the Rationals
- The rational numbers as an abstract data type
- The completeness of the algebraic specification methods for computable data types
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- Elementary Algebraic Specifications of the Rational Complex Numbers
- Logical Approaches to Computational Barriers
This page was built for publication: Division safe calculation in totalised fields