Skip to main content
SpringerLink
Log in

Moving between logical systems

  • Contributions
  • Conference paper
  • First Online:
Recent Trends in Data Type Specification (ADT 1995, COMPASS 1995)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avron, A.: Simple consequence relations. Information and Computation, 91(1):105–139 (1991).

    Google Scholar 

  2. Birkhoff, G., Lipson, J.D.: Heteregeneous algebras. J. Combinatorial Theory 8:115–133 (1970).

    Google Scholar 

  3. Broy, M., Wirsing, M.: Partial abstract data types. Acta Informatica 18(1):47–64 (1982).

    Google Scholar 

  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).

    Google Scholar 

  5. Cerioli, M.: Relationships between Logical Formalisms. PhD thesis, TD-4/93, Universitá di Pisa-Genova-Udine (1993).

    Google Scholar 

  6. Cerioli, M., Meseguer, J.: Can I borrow your logic? Proc. Intl. Symp. Mathematical Foundations of Computer Science, MFCS'93, Gdańsk 1993, LNCS 711, 342–351, Springer (1993).

    Google Scholar 

  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).

    Google Scholar 

  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).

    Google Scholar 

  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, 313–333, Springer (1986).

    Google Scholar 

  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).

    Google Scholar 

  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).

    Google Scholar 

  12. Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the Association for Computing Machinery 40(1):143–184 (1993).

    Google Scholar 

  13. Harper, R., Sannella, D., Tarlecki, A.: Structured theory presentations and logic representations. Annals of Pure and Applied Logic 67:113–160 (1994).

    Google Scholar 

  14. Mayoh, B.: Galleries and institutions. Report DAIMI PB-191, Aarhus University (1985).

    Google Scholar 

  15. Meseguer, J.: General logic. Logic Colloquium'87, H.-D. Ebbinghaus et al., eds., 279–329, North-Holland (1989).

    Google Scholar 

  16. Milner, R., Tofte, M., Harper, R.: The Definition of Standard ML. The MIT Press (1990).

    Google Scholar 

  17. Mossakowski, T.: Equivalences among various logical frameworks of partial algebras. Bericht 4/95, Universität Bremen, Fachbereich Mathematik und Informatik (1995).

    Google Scholar 

  18. Mossakowski, T.: Using colimits of parchments to systematically construct institutions 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).

    Google Scholar 

  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).

    Google Scholar 

  20. Pawłowski, 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).

    Google Scholar 

  21. Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Information and Computation 76:165–210 (1988).

    Google Scholar 

  22. Sannella, D., Tarlecki, A.: Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233–281 (1988).

    Google Scholar 

  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).

    Google Scholar 

  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).

    Google Scholar 

  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.

    Google Scholar 

  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).

    Google Scholar 

  27. Tarlecki, A.: Bits and pieces of the theory of institutions. Proc. Intl. Workshop on Category Theory and Computer Programming, Guildford 1985, LNCS 240, 334–363, Springer (1986).

    Google Scholar 

  28. Tarlecki, A.: Institution representation. Unpublished note, Dept. of Computer Science, Univ. of Edinburgh (1987).

    Google Scholar 

  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.

    Google Scholar 

  30. Tarlecki, A., Wirsing, M.: Continuous abstract data types. Fundamenta Informaticae 9:95–125 (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Poland

    Andrzej Tarlecki

  2. Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland

    Andrzej Tarlecki

Authors
  1. Andrzej Tarlecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Magne Haveraaen Olaf Owe Ole-Johan Dahl

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tarlecki, A. (1996). Moving between logical systems. In: Haveraaen, M., Owe, O., Dahl, OJ. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1995 1995. Lecture Notes in Computer Science, vol 1130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61629-2_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-61629-2_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61629-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation