Colimits of order-sorted specifications

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

Volumn 1376, Issue , 1998, Pages 316-332

  Mossakowski, Till ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84893135483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64299-4_42     Document Type: Conference Paper

References (16)

1. J. Adàmek, H. Herrlich, and G. Strecker. Abstract and Concrete Categories. Wiley, New York, 1990.
2. F. Borceux. Handbook of Categorical Algebra I -III. Cambridge University Press, 1994.
3. R. M. Burstall and J. A. Goguen. Putting theories together to make specifications. In Proceedings of the 5th International Joint Conference on Artificial Intelligence, pages 1045-1058. Cambridge, 1977.
4. M. CerioIi, A. Haxthausen, B. Krieg-Briickner, 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. Springer-Verlag, 1997
5. CoFI Task Group on Language Design. CASL - The CoFI Algebraic Specification Language - Summary. CoFI Document: CASL/Summary. 12, 13, September 1997.
6. CoFI Task Group on Semantics. CASL - The CoFI Algebraic Specification Language (version 0.97) - Semantics. CoFI Note: S-6. WWW 14, FTP 15, July 1997.
7. It. Diaconescu and K. Futatsugi. Logical semantics of CafeOBJ. Technical report IS-RR-96-0024S, JAIST, 1996.
8. J. A. Goguen. A categorical manifesto. Mathematical Structures in Computer Science, 1:49-67, 1991.
9. 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.
10. 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.
11. J. A. Goguen and T. Winkler. Introducing OBJ 3. Research report SRI-CSL-88-9, SRI International, 1988.
12. 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-?? Springer-Verlag, 1996.
13. T. Mossakowski. Equivalences among various logical frameworks of partial algebras. In H. K. Brining, editor, Computer Science Logic. 9th Workshop, CSL' 95. Paderborn, Germany, September 1995, Selected Papers, volume 1092 of Lecture Notes in Computer Science, pages 403-433. Springer Verlag, 1996.
14. T. Mossakowski Kolyang, and B. Krieg-Brrickner. Static semantic analysis of CASL. 12th Workshop on Algebraic Development Techniques, Taxquinia. This volume, 1997.
15. P. D. Mosses. CoFI: The common framework initiative for algebraic specification and development. In M. Bidoit and M. Dauchet, editors, Theory and Practice of Software Development, LNCS 1214, pages 115-137. Springer Verlag, 1997.
16. O. Owe and O.-J. Dahl. Generator induction in order sorted algebras. Formal Aspects of Computing, 3:2-20, 1991.