Skip to main content
SpringerLink
Log in

Extra Theory Morphisms for Institutions: Logical Semantics for Multi-Paradigm Languages

  • Published:
Applied Categorical Structures Aims and scope Submit manuscript

Abstract

We extend the ordinary concept of theory morphism in institutions to extra theory morphisms. Extra theory morphisms map theories belonging to different institutions across institution morphisms. We investigate the basic mathematical properties of extra theory morphisms supporting the semantics of logical multi-paradigm languages, especially structuring specifications (module systems) á la OBJ-Clear. They include model reducts, free constructions (liberality), co-limits, model amalgamation (exactness), and inclusion systems.

We outline a general logical semantics for languages whose semantics satisfy certain ‘logical’ principles by extending the institutional semantics developed within the Clear-OBJ tradition. Finally, in the Appendix, we briefly illustrate this with the concrete example of CafeOBJ.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arrais, M. and Fiadeiro, J. L.: Unifying theories in different institutions, in Magne Haveraaen, Olaf Owe, and Ole-Johan Dahl (eds.), Recent Trends in Data Type Specification, Proceedings of 11th Workshop on Specification of Abstract Data Types. Oslo, Norway, September 1995, Lecture Notes in Computer Science, Springer, 1996, pp. 81–101.

  2. Burstall, Rod and Diaconescu, RĂzvan: Hiding and behaviour: an institutional approach, in A. William Roscoe (ed.), A Classical Mind: Essays in Honour of C. A. R. Hoare, Prentice-Hall, 1994, pp. 75–92. Also in Technical Report ECS-LFCS-8892–253, Laboratory for Foundations of Computer Science, University of Edinburgh, 1992.

  3. Burstall, Rod and Goguen, Joseph: The semantics of Clear, a specification language, in Dines Bjorner (ed.), Proceedings, 1979 Copenhagen Winter School on Abstract Software Specification, Lecture Notes in Computer Science 86, Springer, 1980, pp. 292–332; based on unpublished notes handed out at the Symposium on Algebra and Applications, Stefan Banach Center, Warsaw, Poland, 1978.

  4. CĂzĂnescu, Virgil Emil and Roşu, Grigore: Weak inclusion systems, Math. Structures Comput. Sci. 7(2) (1997).

  5. Diaconescu, RĂzvan: Category-based semantics for equational and constraint logic programming, PhD Thesis, University of Oxford, 1994.

  6. Diaconescu, RĂzvan: Completeness of category-based equational deduction, Math. Structures Comput. Sci. 5(1) (1995), 9–41.

    Google Scholar 

  7. Diaconescu, RĂzvan: Behavioural rewriting logic: Semantic foundations and proof theory, October 1996. Submitted for publication.

  8. Diaconescu, RĂzvan: A category-based equational logic semantics to constraint programming, in Magne Haveraaen, Olaf Owe, and Ole-Johan Dahl (eds.), Recent Trends in Data Type Specification, Proceedings of 11th Workshop on Specification of Abstract Data Types. Oslo, Norway, September 1995, Lecture Notes in Computer Science 1130, Springer, 1996, pp. 200–221.

  9. Diaconescu, RĂzvan: Category-based modularisation for equational logic programming, Acta Inform. 33(5) (1996), 477–510.

    Google Scholar 

  10. Diaconescu, RĂzvan: Foundations of behavioural specification in rewriting logic, in Proceedings, First International Workshop on Rewriting Logic and its Applications. Asilomar, California, September 1996, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, 1996.

  11. Diaconescu, RĂzvan and Futatsugi, Kokichi: Logical semantics for CafeOBJ. Technical Report IS-RR-96–0024S, Japan Advanced Institute for Science and Technology, 1996. Submitted for publication.

  12. Diaconescu, RĂzvan and Futatsugi, Kokichi: CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification, volume 6 of AMAST Series in Computing, World Scientific, 1998. To appear.

  13. Diaconescu, RĂzvan, Goguen, Joseph and Stefaneas, Petros: Logical support for modularisation, in Gerard Huet and Gordon Plotkin (eds.), Logical Environments, Proceedings of a Workshop held in Edinburgh, Scotland, May 1991, Cambridge, 1993, pp. 83–130.

  14. Goguen, Joseph: Theorem Proving and Algebra, MIT, to appear. http://www-cse. ucsd.edu/users/goguen/pubs/index.html.

  15. Goguen, Joseph and Burstall, Rod: Institutions: Abstract model theory for specification and programming, J. Assoc. Comput. Mach. 39(1) (1992), 95–146.

    Google Scholar 

  16. Goguen, Joseph and Diaconescu, RĂzvan: An Oxford survey of order sorted algebra, Math. Structures Comput. Sci. 4(4) (1994) 363–392.

    Google Scholar 

  17. Goguen, Joseph and Diaconescu, RĂzvan: Towards an algebraic semantics for the object paradigm, in Harmut Ehrig and Fernando Orejas (eds.), Recent Trends in Data Type Specification, Lecture Notes in Computer Science 785, Springer, 1994, pp. 1–34.

  18. Goguen, Joseph and Diaconescu, RĂzvan: An introduction to category-based equational logic, in V. S. Alagar and Maurice Nivat (eds.), Algebraic Methodology and Software Technology, Lecture Notes in Computer Science 936, Springer, 1995, pp. 91–126.

  19. Goguen, Joseph and Malcolm, Grant: A hidden agenda, 1996. draft, http://www-cse. ucsd.edu/users/goguen/pubs/index.html.

  20. Goguen, Joseph and Meseguer, José: Eqlog: Equality, types, and generic modules for logic programming, in Douglas DeGroot and Gary Lindstron (eds.), Logic Programming: Functions, Relations and Equations, Prentice-Hall, 1986, pp. 295–363. An earlier version appears in J. Logic Programming 1(2) (1984), 179–210.

  21. Goguen, Joseph and Meseguer, José: Models and equality for logical programming, in Hartmut Ehrig, Giorgio Levi, Robert Kowalski and Ugo Montanari (eds.), Proceedings, 1987 TAPSOFT, Lecture Notes in Computer Science 250, Springer, 1987, pp. 1–22.

  22. Goguen, Joseph and Meseguer, José: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoret. Comput. Sci. 105(2) (1992), 217–273. Also, Programming Research Group Technical Monograph PRG-80, Oxford University, December 1989.

    Google Scholar 

  23. Goguen, Joseph, Thatcher, James and Wagner, Eric: An initial algebra approach to the specification, correctness and implementation of abstract data types, Technical Report RC 6487, IBM T. J. Watson Research Center, October 1976. In Current Trends in Programming Methodology, IV, Raymond Yeh (ed.), Prentice-Hall, 1978, pp. 80–149.

  24. Goguen, Joseph, Winkler, Timothy, Meseguer, José, Futatsugi, Kokichi and Jouannaud, Jean-Pierre: Introducing OBJ, in Joseph Goguen (ed.), Algebraic Specification with OBJ: An Introduction with Case Studies, Cambridge, to appear 1995. Also to appear as Technical Report from SRI International.

  25. Herrlich, Horst, Adamek, Jiri and Strecker, George: Abstract and Concrete Categories, Wiley, 1990.

  26. Kreowski, H.-J. and Mossakovski, Till: Equivalence and difference between institutions: Simulating Horn clause logic with based algebras, Math. Struct. Comput. Sci. 5 (1995), 189–215.

    Google Scholar 

  27. Mac Lane, Saunders: Categories for the Working Mathematician, Springer, 1971.

  28. Lincoln, P., Clavel, M., Eker, S. and Meseguer, J.: Principles of Maude, in Proceedings, First International Workshop on Rewriting Logic and its Applications. Asilomar, California, September 1996, Electronic Notes in Theoretical Computer Science 4, Elsevier, 1996.

  29. Meseguer, José: Membership algebra as a logical framework for equational specification. Invited paper at the Workshop on Algebraic Development Techniques, Tarquinia, 1997.

  30. Meseguer, José: Conditional rewriting logic as a unified model of concurrency, Theoret. Comput. Sci. 96 (1992), 73–155.

    Google Scholar 

  31. Meseguer, José and Goguen, Joseph: Initiality, induction and computability, in Maurice Nivat and John Reynolds (eds.), Algebraic Methods in Semantics, Cambridge, 1985, pp. 459–541.

  32. Tarlecki, Andrzej: On the existence of free models in abstract algebraic institutions, Theoret. Comput. Sci. 37 (1986), 269–304. Preliminary version, University of Edinburgh, Computer Science Department, Report CSR-165–84, 1984.

    Google Scholar 

  33. Tarlecki, Andrzej: Moving between logical systems, in Magne Haveraaen, Olaf Owe and Ole-Johan Dahl (eds.), Recent Trends in Data Type Specification, Proceedings of 11th Workshop on Specification of Abstract Data Types. Oslo, Norway, September 1995, Lecture Notes in Computer Science, Springer, 1996, pp. 478–502.

  34. Tarlecki, Andrzej, Burstall, Rod and Goguen, Joseph: Some fundamental algebraic tools for the semantics of computation, Part 3: Indexed categories, Theoret. Comput. Sci. 91 (1991) 239–264. Also, Monograph PRG-77, August 1989, Programming Research Group, Oxford University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Japan Advanced Institute for Scienc, Romania

    Răzvan Diaconescu

Authors
  1. Răzvan Diaconescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Diaconescu, R. Extra Theory Morphisms for Institutions: Logical Semantics for Multi-Paradigm Languages. Applied Categorical Structures 6, 427–453 (1998). https://doi.org/10.1023/A:1008607717635

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008607717635

Search

Navigation