scholarly journals The Transrational Numbers as an Abstract Data Type

2020 ◽  
Author(s):  
Jan Aldert Bergstra ◽  
John V. Tucker

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.

2007 ◽  
Vol 54 (2) ◽  
pp. 7 ◽  
Author(s):  
J. A. Bergstra ◽  
J. V. Tucker

2008 ◽  
Vol 16 (4) ◽  
pp. 329-339 ◽  
Author(s):  
Damian W.I. Rouson

This article approaches scientific software architecture from three analytical paths. Each path examines discrete time advancement of multiphysics phenomena governed by coupled differential equations. The new object-oriented Fortran 2003 constructs provide a formal syntax for an abstract data type (ADT) calculus. The first analysis uses traditional object-oriented software design metrics to demonstrate the high cohesion and low coupling associated with the calculus. A second analysis from the viewpoint of computational complexity theory demonstrates that a more representative bug search strategy than that considered by Rouson et al. (ACM Trans. Math. Soft.34(1) (2008)) reduces the number of lines searched in a code with λ total lines from O(λ2) to O(λ log2λ ), which in turn becomes nearly independent of the overall code size in the context of ADT calculus. The third analysis derives from information theory an argument that ADT calculus simplifies developer communications in part by minimizing the growth in interface information content as developers add new physics to a multiphysics package.


Author(s):  
Zdenka Telnarova

Patterns are mentioned usually in the extraction context. Little stress is posed in their representation and management. This chapter is focused on the representation of the patterns, manipulation with patterns and query patterns. Crucial issue can be seen in systematic approach to pattern management and specific pattern query language which takes into consideration semantics of patterns. In the background we discuss two different approaches to the pattern store and manipulation (based on inductive database and PANDA project). General pattern model is illustrated using abstract data type implemented in Oracle. In the following chapters the introduction to querying patterns and simple scheme of the architecture PBMS is shown.


Author(s):  
Emmanuelle Anceaume ◽  
Antonella Del Pozzo ◽  
Romaric Ludinard ◽  
Maria Potop-Butucaru ◽  
Sara Tucci-Piergiovanni

Sign in / Sign up

Export Citation Format

Share Document