Titlebook: Recent Trends in Data Type Specification; Fifth Workshop on Sp D. Sannella,A. Tarlecki Conference proceedings 1988 Springer-Verlag Berlin H

HALO

The stratified loose approach: A generalization of initial and loose semantics,nitial approach nor the loose one is powerful enough to reflect our intuition and needs about software reusability and modularity, and we introduce a more sophisticated framework, the ., which can be considered as a generalization of both loose and initial semantics.

Lamina

superfluous

Structuring theories on consequence,s (sets of formulae closed for the consequence relation) and not a class of models of that logic. Adopting this point of view, the semantics of Clear-like specification building operations is analysed.

吊胃口

Jungle evaluation,ile the possibility of structural induction is maintained, and a good part of the existing graph grammar theory is applicable so that there is some hope that the rich theory of term rewriting is not lost forever without a substitute.

dissolution

The ACT-system experiences and future enhancements,he ACT-system. Furthermore a new interpretation technique is proposed, which works with arbitrary algebraic specifications. These concepts together allow testing of all algebraic specifications with initial or free functor semantics as well as using them as prototypes of software systems in a convenient way.

PANT

The stratified loose approach: A generalization of initial and loose semantics,loose semantics for a given specification language often relies on methodological considerations. In this paper, we briefly recall the main features of the . specification language, the semantics of which was originally designed following the loose approach. Then we study how far some basic concerns

幼兒

Algebraic data type and process specifications based on projection spaces,. Instead of adopting the predefined metric, it is proposed to define the metric internally, using a suitable family of projections as part of the specification and deal with projection spaces rather than metric spaces. It is also proposed to define the data type along with the processes, to allow n

GIDDY

適宜

Completion with history-dependent complexities for generated equations,tion can either be eliminated, oriented into reductive rewrite rules or considered as nonoperational. Rewrite rules are, as usual, subject to critical pair computation. Nonoperational equations are superposed by the rewrite rules on one of their conditions. A conditional equation can be eliminated i

盡責(zé)

Jungle evaluation,fied operations. Jungles — being intuitively forests of coalesced trees with shared substructures — are certain acyclic hypergraphs (or equivalently, bipartite graphs) the nodes and edges of which are labeled with the sorts and operation symbols of a signature. Jungles are manipulated and evaluated