Moving between logical systems

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

Volumn 1130, Issue , 1996, Pages 479-502

  Tarlecki, Andrzej ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958627746     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61629-2_59     Document Type: Conference Paper

References (30)

1. Avron, A.: Simple consequence relations. Information and Computation, 91(1):105-139 (1991).
2. Birkhoff, G., Lipson, J.D.: Heteregeneous algebras. J. Combinatorial Theory 8:115133 (1970).
3. Broy, M., Wirsing, M.: Partial abstract data types. Acta Informatica 18(l):47-64 (1982).
4. Burstall, R.M., Goguen, J.A.: Putting theories together to make specifications. Proc. 5th Intl. Joint Conf. on Artificial Intelligence, Cambridge, Massachusetts, 1045-1058 (1977).
5. Cerioli, M.: Relationships between Logical Formalisms. PhD thesis, TD-4/93, Uni-versita di Pisa-Genova-Udine (1993).
6. Cerioli, M., Meseguer, J.: Can I borrow your logic? Proc. Intl. Symp. Mathematical Foundations of Computer Science, MFCS'93, Gdansk 1993, LNCS 711, 342-351, Springer (1993).
7. Fiadeiro, J., Sernadas, A.: Structuring theories on consequence. Recent Trends in Data Type Specification, Proc. 5th Workshop on Specification of Abstract Data Types, ADT'87, Gullane 1987, LNCS 332, 44-72, Springer (1988).
8. Gogolla, M., Drosten, K., Lipeck, U., Ehrich, H.-D.': Algebraic and operational semantics of specifications allowing exceptions and errors. Theoretical Computer Science 34:289-313 (1984).
9. Goguen, J.A., Burstall, R.M.: A study in foundations of programming methodology: specifications, institutions, charters and parchments. Proc. Intl. Workshop on Category Theory and Computer Programming, Guildford 1985, LNCS 240, 313333, Springer (1986).
10. Goguen, J.A., Burstall, R.M.: Institutions: abstract model theory for computer science. J. of the ACM 39(1992), 95-146; earlier version: Introducing institutions. Proc. Logics of Programming Workshop, LNCS 164, 221-256, Springer (1984).
11. Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Current Trends in Programming Methodology, Vol. 4-Data Structuring (R.T. Yeh, ed.). Prentice-Hall, 80-149 (1978).
12. Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the Association for Computing Machinery 40(1):143-184 (1993).
13. Harper, R., Sannella, D., Tarlecki, A.: Structured theory presentations and logic representations. Annals of Pure and Applied Logic 67:113-160 (1994).
14. Mayoh, B.: Galleries and institutions. Report DAIMI PB-191, Aarhus University (1985).
15. Meseguer, J.: General logic. Logic Colloquium'87, H.-D. Ebbinghaus et al., eds., 279-329, North-Holland (1989).
16. Milner, R., Tofte, M., Harper, R.: The Definition of Standard ML. The MIT Press (1990).
17. Mossakowski, T.: Equivalences among various logical frameworks of partial algebras. Bericht 4/95, Universitat Bremen, Fachbereich Mathematik und Informatik (1995).
18. Mossakowski, T.: Using colimits of parchments to systematically construct insti- tutions of partial algebras. In Recent Trends in Data Type Specification, M. Haveraaen, O. Owe, O.-J. Dahl, eds., Selected papers, 11th Workshop on Specification of Abstract Data Types, ADT'95, Oslo 1995, LNCS, this volume, 379-393, Springer (1996).
19. Orejas, F., Navarro, M., Sanchez, A.: Implementations and behavioural equivalence: a survey. In Recent Trends in Data Type Specification, M. Bidoit, C. Choppy, eds., Proc. 8th Worshop on Specification of Abstract Data Types, ADT'91, Dourdan 1991, LNCS 655, 93-125, Springer (1993).
20. Pawlowski, W.: Context institutions. In Recent Trends in Data Type Specification, M. Haveraaen, O. Owe, O.-J. Dahl, eds., Selected papers, 11th Workshop on Specification of Abstract Data Types, ADT'95, Oslo 1995, LNCS, this volume, 436-457, Springer (1996).
21. Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Information and Computation 76:165-210 (1988).
22. Sannella, D., Tarlecki, A.: Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233-281 (1988).
23. Sannella, D., Tarlecki, A.: Toward formal development of ML programs: foundations and methodology. Proc. Coll. on Current Issues in Programming Languages, 3rd Joint Conf. on Theory and Practice of Software Development, TapSoft'89, Barcelona 1989, LNCS 352, 375-389, Springer (1989).
24. Sannella, D., Tarlecki, A.: Model-theoretic foundations for formal program development: basic concepts and motivation. Formal Aspects of Computing, to appear; an earlier short version: Toward formal development of programs from algebraic specifications: model-theoretic foundations. Proc. Intl. Colloq. on Automata, Languages and Programming, ICALP'92, Vienna 1992, LNCS 623, 656-671, Springer (1992).
25. Sannella, D., Tarlecki, A.: Foundations of Algebraic Specifications and Formal Program Development. Cambridge Univ. Press, to appear; see http://zls.mimuw.edu.pl/"tarlecki/book/index.html
26. Sannella, D., Wirsing, M.: A kernel language for algebraic specification and implementation. Proc. Intl. Conf. Foundations of Computation Theory, FCT'83, LNCS 158, 413-427, Springer (1983).
27. Tarlecki, A.: Bits and pieces of the theory of institutions. Proc. Intl. Workshop on Category Theory and Computer Programming, Guildford 1985, LNCS 240, 334363, Springer (1986).
28. Tarlecki, A.: Institution representation. Unpublished note, Dept. of Computer Science, Univ. of Edinburgh (1987).
29. Tarlecki, A.: Structural properties of some categories of institutions. Technical report, Institute of Informatics, Warsaw University (1996); see http://zls.mimuw.edu.pl/~tarlecki/drafts/smoving.ps
30. Tarlecki, A., Wirsing, M.: Continuous abstract data types. Fundamenta Informat-icae 9:95-125 (1986).