Translating OBJ3 into CASL: The institution level

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1589, Issue , 1999, Pages 198-215

  Mossakowski, Till ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATED TOOLS;

ALGEBRA;

EID: 22644452728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48483-3_14     Document Type: Conference Paper

References (23)

1. P. Burmeister. Partial algebras-survey of a unifying approach towards a twovalued model theory for partial algebras. Algebra Universalis, 15:306-358, 1982. 201
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. 200, 211
3. M. Cerioli, T. Mossakowski, and H. Reichel. From total equational to partial rst order logic. In E. Astesiano, H.-J. Kreowski, and B. Krieg-Brückner, editors, Algebraic Foundations of Systems Specications. Chapman and Hall, 1999. To appear. 201
4. CoFI. The Common Framework Initiative for algebraic specication and development, electronic archives. Notes and Documents accessible by 13 and 14, 1998. 214, 214, 214, 215
5. CoFI Language Design Task Group. CASL - The CoFI Algebraic Specication Language - Summary 1.0. In CoFI Archives [4]. Documents/CASLSummary. 198, 200
6. CoFI Semantics Task Group. CASL - The CoFI Algebraic Specication Language (version 1.0) - Semantics. In CoFI Archives [4]. Note S9. 200, 200, 201
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. 203
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. 198, 203
9. J. A. Goguen. Stretching rst order equational logic: Proofs about partiality using subsorts and retracts. Journal of Symbolic Computation, submitted for publication, 1998. 204, 206, 207, 208
10. J. A. Goguen and R. M. Burstall. Institutions: Abstract model theory for speci- cation and programming. Journal of the Association for Computing Machinery, 39:95-146, 1992. Predecessor in: LNCS 164, 221-256, 1984. 199
11. J. A. Goguen and J. Meseguer. Remarks on remarks on many-sorted equational logic. EATCS Bulletin, 30:66-73, 1986. 212, 212
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. 201, 203, 203, 203, 204, 205, 205, 205, 205, 206, 206, 206, 211, 212, 212
13. A. Haxthausen and F. Nickl. Pushouts of order-sorted algebraic specications. In Proceedings of AMAST'96, volume 1101 of Lecture Notes in Computer Science, pages 132-147. Springer-Verlag, 1996. 204
14. J. Meseguer. General logics. In Logic Colloquium 87, pages 275-329. North Holland, 1989. 198, 199, 199
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. 203
16. T. Mossakowski. Representations, hierarchies and graphs of institutions. PhD thesis, Bremen University, 1996. 199
17. T. Mossakowski. Sublanguages of CASL. In CoFI Archives [4]. Note L7. 203, 209, 211, 212
18. T. Mossakowski. Colimits of order-sorted specications 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. 203
19. T. Mossakowski, Kolyang K, 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. 212
20. P. D. Mosses. CoFI: The Common Framework Initiative for Algebraic Specication 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. 198
21. A. Tarlecki. On the existence of free models in abstract algebraic institutions. Theoretical Computer Science, 37:269-304, 1985. 206
22. A. Tarlecki. Moving between logical systems. In M. Haveraaen, O. Owe, and O.-J. Dahl, editors, Recent Trends in Data Type Specications. 11th Workshop on Specication of Abstract Data Types, volume 1130 of Lecture Notes in Computer Science, pages 478-502. Springer Verlag, 1996. 198, 199
23. H. Yan. Theory and Implementation of Sort Constraints for Order Sorted Algebra. PhD thesis, Oxford University, 1993. 203, 203, 204, 205