Joseph Goguen, Claude Kirchner, H'el`eneKirchner, Aristide M'egrelis, and Jos'e Meseguer. An introduction to OBJ3. In Jean-Pierre Jouannaud and Stephane Kaplan, editors, Proceedings, Conference on Conditional Term Rewriting, pages 258--263. Springer, 1988. Lecture Notes in Computer Science, Volume 308.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....both classes and packages, should support parameterized polymorphism at the level of packages only. That is, packages should be parameterized by packages. FOOPS [9, 2] first suggested this approach, using large grain structuring concepts originated from Clear [4] and later implemented in OBJ [8] and, partially, in Standard ML [14] Ada and other languages. Based on the design of FOOPS, we propose a conservative extension of Java, called PJava, with support for parameterized packages. We claim that Java s capabilities for reuse and maintenance in the large can be significantly enhanced in ....

....such a method. Also, the mapping equals eq is just an abbreviation for the mapping boolean equals(Key k) boolean eq(Code c) which should be used in case of naming conflicts. The mappings that can be inferred by a compiler may be omitted, and in some cases we may assume default views [9, 10, 8]; we omit the details here. We consider that different instantiations of a generic package yield different packages unless equivalent views are used in the instantiations. Two views are equivalent if, independent of variable names and order of appearance, they contain the same binding components. ....

Joseph Goguen, Claude Kirchner, H'el`ene Kirchner, Aristide M'egrelis, and Jos'e Meseguer. An introduction to OBJ3. In Jean-Pierre Jouannaud and Stephane Kaplan, editors, Proceedings, Conference on Conditional Term Rewriting, pages 258--263. Springer, 1988. Lecture Notes in Computer Science, Volume 308.

....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 ....

Joseph Goguen, Claude Kirchner, H'el`eneKirchner, Aristide M'egrelis, and Jos'e Meseguer. An introduction to OBJ3. In Jean-Pierre Jouannaud and Stephane Kaplan, editors, Proceedings, Conference on Conditional Term Rewriting, pages 258--263. Springer, 1988. Lecture Notes in Computer Science, Volume 308.

....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 ....

Joseph Goguen, Claude Kirchner, H'el`ene Kirchner, Aristide M'egrelis, and Jos'e Meseguer. An introduction to OBJ3. In Jean-Pierre Jouannaud and Stephane Kaplan, editors, Proceedings, Conference on Conditional Term Rewriting, pages 258--263. Springer, 1988. Lecture Notes in Computer Science, Volume 308.

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