Titlebook: Recent Trends in Data Type Specification; 7th Workshop on Spec H. Ehrig,K. P. Jantke,H. Reichel Conference proceedings 1991 Springer-Verlag

变形

懒惰人民

A match operation for rule-based modular system design,hich generalizes the basic ones, is used in the rule-based approach to the design of modular systems, recently introduced by the second author. In this approach, sequences of derivations which use the interfaces of a given set of modules can be realized by applying the match operation to the modules employed in the derivation.

VEST

Clausal rewriting: Applications and implementation,O90]. In this note we outline several applications of these techniques, such as efficient prototyping, checking sufficient completeness properties and theorem proving in partial specifications. Furthermore, some methods used in the implementation of these techniques are described and their correctness is proved.

Traumatic-Grief

0302-9743 Group COMPASS. The main topics covered by theworkshop were:- Modularization- Object orientation- Higher-order types anddependent types- Inductive completion- Algebraic high-level nets.978-3-540-54496-8978-3-540-38416-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

角斗士

thwart

现代

A 2-category approach to critical pair completion,ion properties are probably satisfied for all those type constructions which can be formalized as parameterized abstract data types without equations effecting the constructors, in the generalisation of the CPC algorithm scheme one has to focus the attention only on the pullback construction in the resulting category of types and terms.

GEM

立即

An association of Algebraic term nets and abstract data types for specifying real communication procation is achieved in two steps:.First, we use a constructive approach based on Algebraic Term Nets to build a compact model of the given protocol. Algebraic Term Nets are a form of high-level Petri nets, using terms of a given signature as tokens. This allows to build sufficiently refined models wi

exhilaration

Composition of algebraic high-level nets,een algebraic net scheme (as in /Va85/ or /RV87/) and algebra. We show that the algebraic high-level nets can be composed in a elegant manner using colimits and especially pushouts. We define the semantics for algebraic high-level nets as a functor into the category of coloured nets and prove that i