Algebraic domain equations (ade’s) provide a means for implicitly or recursively specifying parameterized data types. A unique semantics is available provided the respective ade’s are defined over a category of specifications which are solely based on equational axioms. We extend this approach by showing that there exists an appropriate semantics even if the respective specifications contain as well equational as inequational axioms
AbstractThis paper presents a comparatively general method for specifying a ‘data constraint’ on a p...
Article dans revue scientifique avec comité de lecture. nationale.National audienceIn most algebraic...
Most modern programming languages allow the user to define abstract data types, thereby creating an ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractThis paper discusses a new specification method for algebraic data types consisting of an al...
AbstractEquational theorems that are valid in a given parameterized data type can be derived in the ...
This extended abstract first presents a new category theoretic approach to equationally axiomatizabl...
Loose specifications of abstract data types (ADTs) have many non-isomorphic algebras as models. An i...
AbstractThe established approaches to the semantics of algebraic (equational) specifications are bas...
The following fundamental theorem about the adequacy of the algebraic specification methods for data...
We conceive a parametrized data type as a partial functor φ: ALG (∑) --> ALG (Δ), where Δ is a sign...
AbstractThe paper proposes an axiomatic approach to specification languages, and introduces notions ...
AbstractA general specification framework based on the notion of indexed categories is introduced in...
Existing approaches to semantics of algebraically specified data types such as Initial Algebra Seman...
AbstractAn extensive survey is given of the properties of various specification mechanisms based on ...
AbstractThis paper presents a comparatively general method for specifying a ‘data constraint’ on a p...
Article dans revue scientifique avec comité de lecture. nationale.National audienceIn most algebraic...
Most modern programming languages allow the user to define abstract data types, thereby creating an ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractThis paper discusses a new specification method for algebraic data types consisting of an al...
AbstractEquational theorems that are valid in a given parameterized data type can be derived in the ...
This extended abstract first presents a new category theoretic approach to equationally axiomatizabl...
Loose specifications of abstract data types (ADTs) have many non-isomorphic algebras as models. An i...
AbstractThe established approaches to the semantics of algebraic (equational) specifications are bas...
The following fundamental theorem about the adequacy of the algebraic specification methods for data...
We conceive a parametrized data type as a partial functor φ: ALG (∑) --> ALG (Δ), where Δ is a sign...
AbstractThe paper proposes an axiomatic approach to specification languages, and introduces notions ...
AbstractA general specification framework based on the notion of indexed categories is introduced in...
Existing approaches to semantics of algebraically specified data types such as Initial Algebra Seman...
AbstractAn extensive survey is given of the properties of various specification mechanisms based on ...
AbstractThis paper presents a comparatively general method for specifying a ‘data constraint’ on a p...
Article dans revue scientifique avec comité de lecture. nationale.National audienceIn most algebraic...
Most modern programming languages allow the user to define abstract data types, thereby creating an ...