Kokichi Futatsugi, Joseph Goguen, Jos'e Meseguer, and Koji Okada. Parameterized programming in OBJ2. In Robert Balzer, editor, Proceedings, Ninth International Conference on Software Engineering, pages 51--60. IEEE Computer Society, March 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....implemented or may be implemented without taking regard of its context (for instance, of the other components of a specification in which this completed specification component is used) The semantics of PLUSS is expressed in terms of the ASL kernel specification language. OBJ3 [421] cf. OBJ2 [358]) is a specification and logic programming language based on order sorted algebras and logic [413, 884] Within this framework, many of the problems with partiality and polymorphism can be solved. OBJ3 inherits its structuring mechanisms, parameterization and views from CLEAR. OBSCURE [604] is ....

K. Futatsugi, J. Goguen, J. Meseguer, and K. Okada. Parameterized programming in OBJ2. In Proc. 9th IEEE Intl. Conf. on Software Engineering, pages 50--61, 1987.

....improvements of OBJ1 over OBJT included rewriting modulo associativity and or commutativity, hash coded memo functions, the use of theories with loose semantics as well as objects with initial semantics, and new interactive features [77] which made the system more convenient for users. OBJ2 [35, 36] was implemented using parts of OBJ1 during 1984 85 at SRI by Kokichi Futatsugi and Jean Pierre Jouannaud, following a design in which Jos e Meseguer and Joseph Goguen also participated, based on order sorted algebra [44, 76, 62, 73, 141] rather than error algebra; also, OBJ2 provided Clear like ....

....errors in some older specifications. 4 Parameterized Programming Both the costs and the demands for software are enormous, and are growing rapidly. One way to diminish these effects is to maximize the reuse of software, through the systematic use of what we call parameterized programming (see [85, 47, 52, 49, 36, 37, 55, 77]) Successful software reuse depends upon the following tasks being sufficiently easy: 1. finding old parts that are close enough to what you need; 2. understanding those parts; 3. getting them to do what you need now; and 4. putting them all together correctly. Under these conditions, the ....

[Article contains additional citation context not shown here]

Kokichi Futatsugi, Joseph Goguen, Jos'e Meseguer, and Koji Okada. Parameterized programming in OBJ2. In Robert Balzer, editor, Proceedings, Ninth International Conference on Software Engineering, pages 51--60. IEEE Computer Society, March 1987.

....equations as (left to right) rewrite rules; and 8. A rigorous model theoretic semantics for all these features. The research reported here supports OBJ, a programming language with mathematical semantics given by order sorted algebra, and operational semantics given by order sorted term rewriting [19, 14, 15, 23]. Our experience with OBJ shows that subsorts are enormously helpful in practice, since they can greatly improve both expressivity and readability. 1.1 Type Disciplines A type discipline for a programming language has two main benefits: 1. it facilitates conceptual clarity by making explicit ....

....as discussed in [29] and briefly reviewed in Section 1. 5 below, while parametric polymorphism is provided by parameterized ordered sorted algebras such as LIST[X] that provide higher order capabilities in a first order setting [21] These are called parameterized objects in the OBJ language [14, 15, 19], and their semantics will be treated in Part III of this paper. 1.2 Logical and Operational Semantics The original vision of logic programming called for using pure first order predicate calculus directly as a programming language [49] As has been well argued by Prolog advocates (e.g. ....

[Article contains additional citation context not shown here]

Kokichi Futatsugi, Joseph Goguen, Jos'e Meseguer, and Koji Okada. Parameterized programming in OBJ2. In Robert Balzer, editor, Proceedings, Ninth International Conference on Software Engineering, pages 51--60. IEEE Computer Society, March 1987.

....plus an image construct for parameterization. David Plaisted implemented OBJ1 by enhancing OBJT, during 1982 83 at SRI; improvements included (an efficient form of) matching modulo associativity and or commutativity, hash coded memo functions, and a highly interactive environment [44] OBJ2 [21, 22] was implemented during 1984 85 at SRI by Kokichi Futatsugi and Jean Pierre Jouannaud, following a design led by Joseph Goguen and Jos e Meseguer, based on order sorted algebra [43, 40, 36] rather than on error algebra; also, OBJ2 provided Clear like parameterized modules, theories and views, ....

Kokichi Futatsugi, Joseph Goguen, Jos'e Meseguer, and Koji Okada. Parameterized programming in OBJ2. In Robert Balzer, editor, Proceedings, Ninth International Conference on Software Engineering, pages 51--60. IEEE Computer Society Press, March 1987.

....example that we have been using for motivation. This section is devoted to the case of classical terms. 5.1 Terms We first define terms over a given fixed set of function symbols. Terms appear as a basic data structure in many functional and logic programming languages, for example, OBJ [23, 9, 10, 19], Hope [4] and Prolog [6] An unsorted (or one sorted) signature consists of a set Sigma whose elements are called function symbols and a function ff : Sigma assigning an arity to each symbol; oe 2 Sigma is a constant symbol when ff(oe) 0. Let Sigma n be foe 2 Sigma j ff(oe) ng. Now ....

....goal, but was more complex than necessary. 22] gives a thorough development of basic theory for our current approach, while [34] discuss unification; 47] gives a slightly different approach. 18] gives details about the operational semantics that is the basis for the OBJ2 programming language [9, 10], and [28] does the same for OBJ3. Order sorted unification has interesting applications to knowledge representation with is a hierarchies, and to polymorphic type inference where there are subtypes. Three essential ideas of order sorted algebra are: 1. Impose a partial ordering on the set S of ....

Kokichi Futatsugi, Joseph Goguen, Jos'e Meseguer, and Koji Okada. Parameterized programming in OBJ2. In Robert Balzer, editor, Proceedings, Ninth International Conference on Software Engineering, pages 51--60. IEEE Computer Society, March 1987.

....are represented by theories, in essentially the same sense as Lawvere (but many sorted, and with signatures) and specifications are put together by colimits in the category of such theories. More specifically, the application of a generic theory to an actual is computed by a pushout. OBJ [13, 28, 14], Eqlog [30] and FOOPS [31] extend this notion of generic module to functional, logic (i.e. relational) and object oriented programming, and in their combinations. It has even been applied to Ada [21, 63] 6.2 Graph Rewriting. Another important problem in computing science is to find models of ....

Kokichi Futatsugi, Joseph Goguen, Jos'e Meseguer, and Koji Okada. Parameterized programming in OBJ2. In Robert Balzer, editor, Proceedings, Ninth International Conference on Software Engineering, pages 51--60. IEEE Computer Society, March 1987.

....multi institutional specification. However, it did take nine years ( for the basic paper on institutions to be published in journal form [75] this is the longest refereeing and editorial delay of which I ever heard. 2. 6 Parameterized Programming and Generic Modules Parameterized programming [48, 52, 27, 28] makes the advantages of the Clear module system available for real programming languages, as well as for more practical specification languages. In addition to semantic interfaces for generic modules (where axioms describe when the module will behave as advertised) parameterized programming ....

Kokichi Futatsugi, Joseph Goguen, Jos'e Meseguer, and Koji Okada. Parameterized programming in OBJ2. In Robert Balzer, editor, Proceedings, Ninth International Conference on Software Engineering, pages 51--60. IEEE Computer Society, March 1987.

.... Joseph Goguen and Jos e Meseguer; improvements of OBJ1 over OBJT included rewriting modulo associativity and or commutativity, hash coded memo functions, the use of theories with loose semantics as well as objects with initial algebra semantics, and some convenient interactive features [61] OBJ2 [27, 28] was implemented using parts of OBJ1 during 1984 85 at SRI by Kokichi Futatsugi and Jean Pierre Jouannaud, following a design in which Jos e Meseguer and Joseph Goguen also participated, based on order sorted algebra [36, 60, 50, 57, 118] rather than error algebra; also, OBJ2 provided Clear like ....

....errors in some older specifications. 4 Parameterised Programming Both the costs and the demands for software are enormous, and are growing rapidly. One way to diminish these effects is to maximise the reuse of software, through the systematic use of what we call parameterised programming (see [39, 44, 41, 28, 29, 47, 61]) Successful software reuse depends upon the following tasks being sufficiently easy: 1. finding old parts that are close enough to what you need; 2. understanding those parts; 3. getting them to do what you need now; and 4. putting them all together correctly. Under these conditions, the total ....

[Article contains additional citation context not shown here]

Kokichi Futatsugi, Joseph Goguen, Jos'e Meseguer, and Koji Okada. Parameterized programming in OBJ2. In Robert Balzer, editor, Proceedings, Ninth International Conference on Software Engineering, pages 51--60. IEEE Computer Society, March 1987.

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