declarative definition of group indexed data structures and approximation of their domains
We introduce a new high-level programming abstraction which extends the concept of data collection. The new construct, called GBF (for Group Based Data-Field), is based on an algebra of index sets, called a shape , and a functional extension of the array type, the field type. Shape constructions are based on group theory and put the emphasis on the logical neighborhood of the data structure elements. A field is a function from a shape to some set of values. In this study, we focus on regular neigh borhood structures and we show that arrays of any dimensions, cyclic array and trees are special kind of GBF.The recursive definitions of a GBF are then studied and we provide some elements for an implementation and some computability results in the case of recursive definition.
cayley graph data-field extension analysis recursive definition of data-structures