| H. Ehrig, M. Groe-Rhode, and U. Wolter. Applications of category theory to the area of algebraic specication in computer science. APCS (Applied Categorical Structures) , (6):1-35, 1998. |
....= Or Stack Unfold Stack Escape Stack And (6) i.e. by the composition of Or, Unfold, Escape and And via the module Stack. 5 In frameworks which have been categorically characterized, e.g. many sorted algebraic speci cation, this operator usually corresponds to the push out construction [13,14]. The complete speci cation of AN is obtained by combining all the modules, as shown in Figure 10. The sublanguages obtained from combining two or more modules can be independently tested leading to a modular testing procedure. The module M obtained by composing M 1 and M 2 as shown in Figure 11 ....
H. Ehrig, M. Groe-Rhode, and U. Wolter. Applications of category theory to the area of algebraic specication in computer science. APCS (Applied Categorical Structures) , (6):1-35, 1998.
....approach to composition of software modules, meant here in its abstract categorical formulation. In order to illustrate and motivate our proposal, let us briefly summarize the principles of the algebraic approach in this abstract version; we are largely inspired by the recent surveys [43] and [23]. 1.1. The Algebraic Approach To Modularization First, since the overall aim is to provide a formal basis for the development of correct programs, software modules are modeled by mathematical entities corresponding to their abstract behavior, disregarding concrete details of code and other ....
Ehrig, H., M. Groe-Rhode, and U. Wolter: 1998, `Applications of Category Theory to the Area of Algebraic Specification in Computer Science'. Applied Categorical Structures 6(1), 1--35.
....facet with one of the other modules. Using these combinations, useful examples of the single facets can be tested in isolation. 5 In frameworks which have been categorically characterized, e.g. many sorted algebraic specification, this operator usually corresponds to the push out construction [EGRW98,EM85]. 3.2 Data Notation and Yielders Part of the AN is the Data Notation (DN) which is a collection of abstract data types given in terms of algebraic specifications. The predefined parts of DN can be implemented and executed, by interpreting the equations defining them as a term rewriting system. ....
H. Ehrig, M. Große-Rhode, and U. Wolter. Applications of category theory to the area of algebraic specification in computer science. APCS (Applied Categorical Structures), (6):1--35, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC