iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/3-540-12689-9_116
Characterizing composability of abstract implementations | SpringerLink
Skip to main content
Springer Nature Link
Log in

Characterizing composability of abstract implementations

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

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

Included in the following conference series:

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.

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, Vol. 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.

    Article  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, 1982, LNCS 140, pp. 197–211.

    Google Scholar 

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

    Google Scholar 

  6. Guttag, J.V.; Horowitz, E.; Musser, D.R. "Abstract data types and software validation", USC Res. Rep. ISI/RR-76-48, 1976.

    Google Scholar 

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

    Google Scholar 

  8. Hoare, C.A.R. "Proof of correctness of data representations", Acta Informatica 1 (1972), pp. 271–281.

    Article  Google Scholar 

  9. Orejas, F. "On the representation of data types", Proc. ICFPC, Peñíscola, 1981, LNCS 107, pp. 419–431.

    Google Scholar 

  10. "Characterizing composability of abstract implementations", Fac. d'Informàtica de Barcelona, Report de Recerca RR 82/08, 1982.

    Google Scholar 

  11. Pair, C. "Sur les modèles des types abstraits algébriques", C.R.I. Nancy Res. Rep. 80 P 052, 1980.

    Google Scholar 

  12. Sannella, D.; Wirsing, M. "Implementations of parameterised implementations", Proc. 9th. ICALP Aarhus, 1982, LNCS 140, pp. 473–488.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultat d'Informàtica, Universitat Politècnica, Barcelona, SPAIN

    F. Orejas

Authors
  1. F. Orejas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orejas, F. (1983). Characterizing composability of abstract implementations. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_116

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_116

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation