Operational semantics of OBJ-3

  • Claude Kirchner
  • Hélène Kirchner
  • José Meseguer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 317)


An efficient operational semantics for order-sorted algebras is given, based on the notion of equational order-sorted rewriting with improvements such as general variables allowing to discard sort checks, and such as partition of the set of rewrite rules allowing fast selection of the rewrite rule to be applied. These improvements imply a process of specialization of the rules given in an OBJ-3 module. Under some conditions on a hierarchy of modules, this specialization can be incremental.


Operational Semantic Equational Logic Lower Sort Fair Specification Equational Deduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R.M. Burstall, D.B. MacQueen, and D.T. Sannella. Hope: an experimental applicative language. In Conference Record of the 1980 LISP Conference, pages 136–143, Stanford (Californie, USA), 1980.Google Scholar
  2. [2]
    A.J.J. Dick. Eril equational reasoning: an interactive laboratory. In B. Buchberger, editor, Proceedings of the EUROCAL conference, Springer-Verlag, Linz (Austria), 1985.Google Scholar
  3. [3]
    K. Futatsugi, J.A. Goguen, J.P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proceedings of 12th ACM Symposium on Principles of Programming Languages Conference, 1985.Google Scholar
  4. [4]
    H. Ganzinger. Completion Procedure for Conditional Equations. Technical Report 234, Dortmund University, 1987.Google Scholar
  5. [5]
    M-C. Gaudel. A First Introduction to PLUSS. Meteor Report, LRI, 1984.Google Scholar
  6. [6]
    I. Gnaedig, C. Kirchner, and H. Kirchner. Equational completion in order-sorted algebras. In M. Dauchet and M. Nivat, editors, Proceedings of the 13th Colloquium on Trees in Algebra and Programming, pages 165–184, Springer-Verlag, Nancy (France), 1988.Google Scholar
  7. [7]
    J. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, J. Meseguer, and T. Winkler. An introduction to OBJ 3. In J-P. Jouannaud and S. Kaplan, editors, Proceedings of the first international workshop on conditional term rewriting systems, Springer-Verlag, Orsay (France), June 1988. Also as internal report CRIN: 88-R-001.Google Scholar
  8. [8]
    J. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In Proceedings of the workshop on graph reduction, September 1986.Google Scholar
  9. [9]
    J. Goguen, C. Kirchner, J. Meseguer, and T. Winkler. OBJ as a language for concurrent programming. In Proceedings of the second international conference on supercomputing, May 1987.Google Scholar
  10. [10]
    J. Goguen and J. Meseguer. Order-Sorted Algebra I: Partial and Overloaded Operations, Errors and Inheritance. Technical Report To appear, SRI International, Computer Science Lab, 1988. Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983.Google Scholar
  11. [11]
    J.A. Goguen, J.P. Jouannaud, and J. Meseguer. Operational semantics for order-sorted algebra. In Proceeding of the 12th ICALP, Nafplion (Greece), pages 221–231, 1985.Google Scholar
  12. [12]
    J.A. Goguen, C. Kirchner, S. Leinwand, J. Meseguer, and T. Winkler. Progress report on the rewrite rule machine. IEEE Computer Architecture Technical Commitee Newsletter, 7–21, march 1986.Google Scholar
  13. [13]
    J.A. Goguen and J. Meseguer. Order-sorted algebra solves the constructor-selector, multiple representation and coercion problem. In Proceeding of the second symposium on Logic In Computer Science, 1987.Google Scholar
  14. [14]
    J.A. Goguen and J. Meseguer. Remarks on remarks on many-sorted equational logic. Bulletin of EATCS, (30):66–73, October 1986.Google Scholar
  15. [15]
    J.A. Goguen, J. Meseguer, and D. Plaisted. Programming with parameterized abstract objects in OBJ. Theory And Practice of Software Technology, 163–193, 1982.Google Scholar
  16. [16]
    J.A. Goguen and U. Montanari. An Abstract Machine for Fast Pattern Matching of Linear Pattern. Technical Report, SRI International, 1987.Google Scholar
  17. [17]
    C.M. Hoffmann and M.J. O'Donnell. Programming with equations. Transactions on Programming Languages and Systems, 4(1), 1982.Google Scholar
  18. [18]
    G. Huet and JJ. Levy. Computations in Non-ambiguous Linear Term Rewriting Systems. Technical Report, INRIA Laboria, 1979.Google Scholar
  19. [19]
    G. Huet and D. Oppen. Equations and rewrite rules: a survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, Academic Press, 1980.Google Scholar
  20. [20]
    J.P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, 15(4), 1986. Preliminary version in Proceedings 11th ACM Symposium on Principles of Programming Languages, Salt Lake City, 1984.Google Scholar
  21. [21]
    S. Kaplan. A compiler for term rewriting system. In Proceedings Second Conference on Rewriting Techniques and Applications, Springer Verlag, Bordeaux (France), May 1987.Google Scholar
  22. [22]
    C. Kirchner. Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles. Thèse d'état de l'Université de Nancy I, 1985.Google Scholar
  23. [23]
    C. Kirchner. Order-sorted equational unification. 1988.Google Scholar
  24. [24]
    C. Kirchner, H. Kirchner, and J. Meseguer. Operational semantics of OBJ3. Technical Report 87-R-87, Centre de Recherche en Informatique de Nancy, 1987.Google Scholar
  25. [25]
    H. Kirchner. Preuves par complétion dans les variétés d'algèbres. Thèse d'état de l'Université de Nancy I, 1985.Google Scholar
  26. [26]
    A. Megrelis. (S, <, Σ)-algebras and-homomorphisms. Personal communication, March 1986.Google Scholar
  27. [27]
    J. Meseguer. An algorithm to compile righthand sides. Personal communication, March 1987.Google Scholar
  28. [28]
    J. Meseguer and J.A. Goguen. Initiality, induction and computability. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, Cambridge University Press, 1985.Google Scholar
  29. [29]
    J. Meseguer, J.A. Goguen, and G. Smolka. Order sorted unification. In Proceedings of the Colloquium on Resolution of Equations in Algebraic Structures, May 1987.Google Scholar
  30. [30]
    G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the Association for Computing Machinery, 28:233–264, 1981.Google Scholar
  31. [31]
    M. Schmidt-Schauss. Unification in many sorted equational theories. In J. Siekmann, editor, Proceedings 8th Conference on Automated Deduction, Oxford, Springer Verlag, Oxford (England), 1986.Google Scholar
  32. [32]
    G. Smolka, W. Nutt, J.A. Goguen, and J. Meseguer. Order sorted equational computation. In Proceedings of the Colloquium on Resolution of Equations in Algebraic Structures, May 1987.Google Scholar
  33. [33]
    G.L. Steele. Common Lisp: The Language. Digital Press, 1984.Google Scholar
  34. [34]
    Y. Toyama. Counterexamples to terminating for the direct sum of term rewriting systems. In Information Processing Letters, pages 141–143, May 1986.Google Scholar
  35. [35]
    Y. Toyama. On the church-rosser property for the direct sum of term rewriting systems. Journal of the Association for Computing Machinery, 34(1):128–143, January 1986.Google Scholar
  36. [36]
    D.A. Turner, Miranda: a non-strict functional language with polymorphic types. In Proc. 2nd Conf. on Functional Programming Languages and Computer Architecture, pages 1–16, Springer Verlag, Nancy (France), 1985.Google Scholar
  37. [37]
    C. Walther. Unification in many sorted theories. In T. O'Shea, editor, Proceedings of the European Conference on Artificial Intelligence, Pisa, Italy, pages 593–602, ECAI, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Claude Kirchner
    • 1
  • Hélène Kirchner
    • 1
  • José Meseguer
    • 2
  1. 1.LORIA & CRINVandœuvre-lès-Nancy CedexFrance
  2. 2.SRI International, Computer Science LaboratoryMenlo ParkUSA

Personalised recommendations