Equivalences among various logical frameworks of partial algebras

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

Volumn 1092, Issue , 1996, Pages 403-433

  Mossakowski, Till ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; CONFORMAL MAPPING; FORMAL LOGIC; FORMAL METHODS; INTEROPERABILITY; RECONFIGURABLE HARDWARE; SOFTWARE DESIGN; SOFTWARE ENGINEERING; SPECIFICATION LANGUAGES; SPECIFICATIONS;

EMBEDDINGS; EXISTENTIAL QUANTIFIERS; FINITE SET; LOGICAL FRAMEWORKS; MULTI-PARADIGM; PARTIAL ALGEBRA; SOUNDNESS AND COMPLETENESS; THEOREM PROVERS;

COMPUTER CIRCUITS;

EID: 0005290139     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61377-3_51     Document Type: Conference Paper

References (38)

1. J. Adámek, J. Rosický. Locally Presentable and Accessible Categories. Cambridge University Press, 1994.
2. E. Astesiauo, M. Cerioli. Multiparadigm specification languages: a first attempt at foundations. In J.F. Groote C.M.D.J. Andrews, ed., Semantics of Specification Languages (SoSl 93), Workshops in Computing, 168-185. Springer Verlag, 1994.
3. M. Barr, C. Wells. Toposes, Triples and Theories, Grundlehren der mathematis- chen Wissenschaften 278. Springer Verlag, 1985.
4. P. Burmeister. Partial algebras — survey of a unifying approach towards a twovalued model theory for partial algebras. Algebra Universalis 15, 306-358, 1982.
5. P. Burmeister. A model theoretic approach to partial algebras. Akademie Verlag, Berlin,1986.
6. R. M. Burstall, J. A. Goguen. Putting theories together to make specifications. In Proceedings of the 5th International Joint Conference on Artificial Intelligence, 1045-1058. Cambridge, 1977.
7. M. Cerioli. Relationships between Logical Formalisms. PhD thesis, TD-4/93, Universita di Pisa-Genova-Udine, 1993.
8. M. Cerioli, J. Meseguer. May I borrow your logic? In A.M. Borzyszkowski, S.Sokolowski, eds., Proc. MFCS’93 (Mathematical Foundations of Computer Science), LNCS 711, 342-351. Springer Verlag, Berlin, 1993. To appear in Theoretical Computer Science.
9. M. Coste. Localisation, spectra and sheaf representation. In M.P. Fourman, C.J. Mulvey, D.S. Scott, eds., Application of Sheaves, Lecture Notes in Mathematics 753, 212-238. Springer Verlag, 1979.
10. H. Ehrig. B. Mahr. Fundamentals of Algebraic Specification 1. Springer Verlag, Heidelberg, 1985.
11. H. Ehrig, B. Mahr. Fundamentals of Algebraic Specification 2. Springer Verlag, Heidelberg, 1990.
12. H. Ehrig, P. Pepper, F. Orejas. On recent trends in algebraic specification. In Proc. ICALP’89, LNCS 372, 263-288. Springer Verlag, 1989.
13. W. A. Farmer. A partial functions version of Church’s simple type theory. Journal of Symbolic Logic 55, 1269-1291, 1991.
14. P. Freyd. Aspects of topoi. Bull. Austral. Math. Soc. 7, 1-76. 1972.
15. P. Gabriel, F. Ulmer. Lokal präsentierbare Kategorien, Lecture Notes in Mathematics 221. Springer Verlag, Heidelberg, 1971.
16. J. A. Goguen, 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(1984):221-256.
17. J. A. Goguen, J. Meseguer. Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science 105, 217-273, 1992.
18. Joseph Goguen, Jean-Pierre Jouannaud, José Meseguer. Operational semantics of order-sorted algebra. In Wiifried Brauer. ed., Proceedings, 1985 International Conference on Automata, Languages and Programming. Springer, 1985. Lecture Notes in Computer Science, Volume 194.
19. J. W. Gray. Categorical aspects of data type constructors. Theoretical Computer Science 50, 103-135, 1987.
20. H.-J. Hoehnke. On partial algebras. In Universal Algebra (Proc. Coll. Esztergom 1977), Colloq. Math. Soc. J. Bolyai 29, 373-412. North Holland, Amsterdam, 1981.
21. G. Jarzembski. Weak varieties of partial algebras. Algebra Universalis 25, 247-262, 1988.
22. G. Jarzembski. Programs in partial algebras. Theoretical Computer Science 115, 131-149, 1993.
23. S.C. Kleene. Introduction to Metamathematics. North Holland, 1952.
24. H.-J. Kreowski, T. Mossakowski. Equivalence and difference of institutions: Simulating horn clause logic with based algebras. Mathematical Structures in Computer Science 5, 189-215, 1995.
25. J. Meseguer. General logics. In Logic Colloquium 87, 275-329. North Holland, 1989.
26. J. Meseguer, J. Goguen. Order-sorted algebra solves the constructor, selector, multiple representation and coercion problems. Information and Compulation 103(1), 114-158, March 1993.
27. T. Mossakowski. Simulations between various institutions of partial and total algebras. Talk at the Workshop of the ESPRIT Basic Research Working Group COMPASS, Dresden, September 1993.
28. T. Mossakowski. Parameterized recursion theory - a tool for the systematic classification of specification methods. In M. Nivat, C. Rattray, T. Rus, G. Scollo, eds.. Proceedings of the Third International Conference on Algebraic Methodology and Software Technology, 1993, Workshops in Computing, 139-146. Springer-Verlag, London, 1993. Also to appear in Theoretical Computer Science.
29. T. Mossakowski. A hierarchy of institutions separated by properties of parameterized abstract data types. In Recent Trends in Data Type Specification. Proceedings, Lecture Notes in Computer Science 906, 389-405. Springer Verlag, London, 1995.
30. T. Mossakowski. Different types of arrow between logical frameworks. In ICALP 96, LNCS. To appear. Springer Verlag, 1996.
31. J. Slominski. Peano-algebras and quasi-algebras, Dissertationcs Mathematicae (Rozprawy Mat.) 62. 1968.
32. A. Poigné. Algebra categorically. In D. Pitt et al., ed., Category Theory and Computer Programming, Lecture Notes in Computer Science 240, 76-102. Springer Verlag, 1986.
33. H. Reichel. Initial Computability, Algebraic Specifications and Partial Algebras. Oxford Science Publications, 1987.
34. D. Sannella, A. Tarlecki. Specifications in an arbitrary institution. Information and Computation 76, 165-210. 1988.
35. J.R. Shoenfield. Mathematical Logic. Addison-Wesley, Reading, Massachusetts, 1967.
36. A. Tarlecki. Working with multiple logical systems. Unpublished manuscript.
37. A. Tarlecki. On the existence of free models in abstract algebraic institutions. Theoretical Computer Science 37, 269-304, 1985.
38. M. Wirsing. Structured algebraic specifications: A kernel language. Theoretical Computer Science 42, 123-249, 1986.