Computer Arithmetic in Theory and Practice deals with computer arithmetic and the various implementations of the entire arithmetic package on diverse processors, including microprocessors. It illustrates the importance of theoretical development in the sound implementation of arithmetic on computers, and argues that such an implementation requires the establishment of various isomorphisms between different definitions of arithmetic operations. Comprised of seven chapters, this volume begins with an introduction to the theory of computer arithmetic by giving an axiomatic characterization of the essential properties of sets and subsets; complete lattices and complete subnets; screens and roundings; and arithmetic operations. The discussion then turns to the concepts of a ringoid and a vectoid as well as those of ordered or weakly ordered ringoids and vectoids; interval arithmetic; and floating-point arithmetic. The operations in interval spaces are defined by means of semimorphisms. The final chapter shows how to embed the five basic data types (integer, real, complex, real interval, and complex interval) together with the arithmetic operations that are defined for all of these types into existing higher programming languages. This book will be helpful to students and practitioners in the fields of computer science and applied mathematics.