Skip to main content

Translating OBJ3 into CASL: The Institution Level

  • Conference paper
  • First Online:
Recent Trends in Algebraic Development Techniques

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1589))

Abstract

We translate OBJ3 to CASL. At the level of basic specifications, we set up several institution representations between the underlying institutions. They correspond to different methodological views of OBJ3. The translations can be the basis for automated tools translating OBJ3 to CASL.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Burmeister. Partial algebras — survey of a unifying approach towards a twovalued model theory for partial algebras. Algebra Universalis, 15:306–358, 1982.

    Article  MathSciNet  Google Scholar 

  2. M. Cerioli, A. Haxthausen, B. Krieg-Brückner, and T. Mossakowski. Permissive subsorted partial logic in Casl. In M. Johnson, editor, Algebraic methodology and software technology: 6th international conference, AMAST 97, volume 1349 of Lecture Notes in Computer Science, pages 91–107. Springer-Verlag, 1997.

    Chapter  Google Scholar 

  3. M. Cerioli, T. Mossakowski, and H. Reichel. From total equational to partial first order logic. In E. Astesiano, H.-J. Kreowski, and B. Krieg-Brückner, editors, Algebraic Foundations of Systems Specifications. Chapman and Hall, 1999. To appear

    Google Scholar 

  4. CoFI. The Common Framework Initiative for algebraic specification and development, electronic archives. Notes and Documents accessible by WWW13 and FTP14, 1998.

    Google Scholar 

  5. CoFI Language Design Task Group. CASL-The CoFI Algebraic Specification Language-Summary 1.0. In CoFI Archives [4]. Documents/CASLSummary.

    Google Scholar 

  6. CoFI Semantics Task Group. CASL-The CoFI Algebraic Specification Language (version 1.0)-Semantics. In CoFI Archives [4]. Note S9.

    Google Scholar 

  7. J. Goguen, J.-P. Jouannaud, and J. Meseguer. Operational semantics of ordersorted algebra. In W. Brauer, editor, Proceedings, 1985 International Conference on Automata, Languages and Programming, volume 194 of Lecture Notes in Computer Science, pages 221–231. Springer, 1985.

    Google Scholar 

  8. J. Goguen, J. Meseguer, T. Winkler, K. Futatsugi, P. Lincoln, and J.-P. Jouannaud. Introducing OBJ. Technical Report SRI-CSL-88-8, Computer Science Lab, SRI International, August 1988; revised version from 24th October 1993.

    Google Scholar 

  9. J. A. Goguen. Stretching first order equational logic: Proofs about partiality using subsorts and retracts. Journal of Symbolic Computation, submitted for publication, 1998.

    Google Scholar 

  10. J. A. Goguen and R. M. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39:95–146, 1992. Predecessor in: LNCS 164, 221–256, 1984.

    MATH  Google Scholar 

  11. J. A. Goguen and J. Meseguer. Remarks on remarks on many-sorted equational logic. EATCS Bulletin, 30:66–73, 1986.

    MATH  Google Scholar 

  12. J. A. Goguen and J. Meseguer. Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105:217–273, 1992.

    Article  MathSciNet  Google Scholar 

  13. A. Haxthausen and F. Nickl. Pushouts of order-sorted algebraic specifications. In Proceedings of AMAST’96, volume 1101 of Lecture Notes in Computer Science, pages 132–147. Springer-Verlag, 1996.

    MATH  Google Scholar 

  14. J. Meseguer. General logics. In Logic Colloquium 87, pages 275–329. North Holland, 1989.

    Google Scholar 

  15. J. Meseguer and J. Goguen. Order-sorted algebra solves the constructor, selector, multiple representation and coercion problems. Information and Computation, 103(1):114–158, March 1993.

    Article  MathSciNet  Google Scholar 

  16. T. Mossakowski. Representations, hierarchies and graphs of institutions. PhD thesis, Bremen University, 1996.

    Google Scholar 

  17. T. Mossakowski. Sublanguages of CASL. In CoFI Archives [4]. Note L7.

    Google Scholar 

  18. T. Mossakowski. Colimits of order-sorted specifications revisited. In F. Parisi Presicce, editor, Recent trends in algebraic development techniques. Proc. 12th International Workshop, volume 1376 of Lecture Notes in Computer Science, pages 316–332. Springer, 1998.

    Chapter  Google Scholar 

  19. T. Mossakowski, Kolyang, and B. Krieg-Brückner. Static semantic analysis and theorem proving for CASL. In F. Parisi Presicce, editor, Recent trends in algebraic development techniques. Proc. 12th International Workshop, volume 1376 of Lecture Notes in Computer Science, pages 333–348. Springer, 1998.

    Chapter  Google Scholar 

  20. P. D. Mosses. CoFI: The Common Framework Initiative for Algebraic Specification and Development. In TAPSOFT ’97: Theory and Practice of Software Development, volume 1214 of LNCS, pages 115–137. Springer-Verlag, 1997. Also in CoFI Archives [4]. Documents/Tentative/Mosses97TAPSOFT.

    Chapter  Google Scholar 

  21. A. Tarlecki. On the existence of free models in abstract algebraic institutions. Theoretical Computer Science, 37:269–304, 1985.

    Article  MathSciNet  Google Scholar 

  22. A. Tarlecki. Moving between logical systems. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specifications. 11th Workshop on Specification of Abstract Data Types, volume 1130 of Lecture Notes in Computer Science, pages 478–502. Springer Verlag, 1996.

    Chapter  Google Scholar 

  23. H. Yan. Theory and Implementation of Sort Constraints for Order Sorted Algebra. PhD thesis, Oxford University, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mossakowski, T. (1999). Translating OBJ3 into CASL: The Institution Level. In: Fiadeiro, J.L. (eds) Recent Trends in Algebraic Development Techniques. Lecture Notes in Computer Science, vol 1589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48483-3_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-48483-3_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66246-4

  • Online ISBN: 978-3-540-48483-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics