Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Semantics of Data Types

SDT 1984: Semantics of Data Types pp 357–374Cite as

A proof system for verifying composability of abstract implementations

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. 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, IV: Data Structuring', R.T. Yeh (ed.), Prentice-Hall 1978, pp. 80–149.

    Google Scholar 

  2. Ehrich, H.-D. "On the theory of specification, implementation and parameterization of abstract data types", JACM 29,1 (Jan 1982), pp. 206–227.

    Google Scholar 

  3. Ehrig, H.; Kreowski, H.-J.; Mahr, B.; Padawitz, P. "Algebraic implementations of abstract data types", TCS 20,3 (July 1982), pp. 209–263.

    Google Scholar 

  4. Ehrig, H.; Kreowski, H.-J. "Parameter passing commutes with implementation of parameterized data types", Proc. 9th. ICALP Aarhus, Springer LNCS 140, pp. 197–211.

    Google Scholar 

  5. Ganzinger, H. "Parameterized specifications: parameter passing and optimizing implementations", Tech. Rep. TU Munich-18110.

    Google Scholar 

  6. Goguen, J.A.; Meseguer, J. "Universal realization, persistent interconnection and implementation of abstract modules", Proc. 9th ICALP Aarhus, Springer LNCS 140, pp. 265–281.

    Google Scholar 

  7. Goguen, J.A.; Meseguer, J. "Completeness of many sorted equational logic", Sigplan Notices 16, 7, pp. 17–23.

    Google Scholar 

  8. Orejas, F. "On the representation of data types", Proc. ICFPC, Peniscola, Springer LNCS 107, pp. 419–431.

    Google Scholar 

  9. Orejas, F. "Characterizing composability of abstract implementations", Proc. FCT-83, Borgholm, Springer LNCS 158, pp. 335–346. Also FIB RR 82-08 (long version).

    Google Scholar 

  10. Pair, C. "Sur les modeles des types abstraits algebriques", C.R.I. Nancy Res. Rep. 80 P 052, 1980.

    Google Scholar 

  11. Sannella, D.; Wirsing, M. "Implementation of parameterised specifications", Proc. 9th ICALP Aarhus, Springer LNCS 140, pp. 473–488.

    Google Scholar 

  12. Sannella, D.; Wirsing, M. "A kernel language for algebraic specification and implementation" Proc. FCT-83, Borgholm, Springer LNCS 158, pp. 413–427.

    Google Scholar 

Download references

Author information

Author notes

  1. Fernando Drejas

    Present address: C.R.I. Nancy, B.P. 239, 54506, Vandoeuvre-les-Nancy Cedex, France

Authors and Affiliations

  1. Facultat d'Informatica, Universitat Politecnica, Barcelona, Spain

    Fernando Drejas

Authors
  1. Fernando Drejas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gilles Kahn David B. MacQueen Gordon Plotkin

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drejas, F. (1984). A proof system for verifying composability of abstract implementations. In: Kahn, G., MacQueen, D.B., Plotkin, G. (eds) Semantics of Data Types. SDT 1984. Lecture Notes in Computer Science, vol 173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13346-1_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-13346-1_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13346-9

  • Online ISBN: 978-3-540-38891-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation