Skip to main content
Springer Nature Link
Log in

Continuous abstract data types: Basic machinery and results

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

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

Included in the following conference series:

  • 114 Accesses

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.

8 References

  1. Goguen, J.A., Thatcher, J.W. and Wagner, E.G. An initial algebra approach to the specification, correctness, and implementation of abstract data types. Current Trends in Programming Methodology, Vol. 4: Data Structuring (R.T. Yeh, ed.), Prentice-Hall, pp. 80–149 (1978).

    Google Scholar 

  2. Goguen, J.A., Thatcher, J.W., Wagner, E.G. and Wright, J.B. Initial algebra semantics and continuous algebras. JACM 24, 1, pp. 68–95.

    Google Scholar 

  3. Thatcher, J.W., Wagner, E.G. and Wright, J.B. Data type specification: parameterization and the power of specification techniques. TOPLAS 4(4), pp. 711–732 (1982).

    Google Scholar 

  4. Adamek, J., Nelson, E. and Reiterman, J. A Birkhoff variety theorem for continuous algebras. Draft report, February 1984.

    Google Scholar 

  5. Bauer, F.L. et al (the CIP Language Group). Report on a wide spectrum language for program specification and development (tentative version). Report TUM-I8104, Technische Univ. München (to appear in Springer LNCS).

    Google Scholar 

  6. Bergstra, J.A., Tucker, J.V. Top-down design and the algebra of communicating processes, Report CS-R8401, CWI, Amsterdam.

    Google Scholar 

  7. Birkhoff, G. and Lipson, D. Heterogeneous algebras. Journal of Combinatorial Theory 8, pp. 115–133.

    Google Scholar 

  8. Blikle, A. and Tarlecki, A. Naive denotational semantics. Proc. IFIP 83 Congress (ed. R.E.A. Mason), North Holland, Amsterdam.

    Google Scholar 

  9. Broy, M. and Wirsing, M. Programming languages as abstract data types, Proc. CAAP'80 (M.Dauchet, ed.), Lille, Université de Lille, pp. 160–177.

    Google Scholar 

  10. Broy, M. and Wirsing, M. Partial abstract types. Acta Informatica 18, pp. 47–64.

    Google Scholar 

  11. Broy, M. and Wirsing, M. Algebraic definition of a functional programming language and its semantic models. R.A.I.R.O. Theoretical Informatics, 17 (1983), pp. 137–161.

    Google Scholar 

  12. Broy, M. and Wirsing, M. Generalized heterogeneous algebras and partial interpretations. Proc. CAAP'84, Springer LNCS 159, pp. 1–34.

    Google Scholar 

  13. Burmeister, P. Partial algebras — survey of a unifying approach towards a two-valued model theory for partial algebras. Algebra Universalis 15, pp. 306–358.

    Google Scholar 

  14. Burstall, R.M., Goguen, J.A. Algebras, theories and freeness: an introduction for computer scientists. Proc. 1981 Marktoberdorf NATO Summer School, Reidel.

    Google Scholar 

  15. Dosch, W., Möller, B. Busy and lazy FP with infinite objects. Proc. 1984 ACM Symp. on Functional Programming, Austin, Texas.

    Google Scholar 

  16. Ehrich, H.-D. and Lipeck, U. Algebraic domain equations. Theoretical Computer Science 27, pp. 167–196 (1983).

    Google Scholar 

  17. Giarratana, V., Gimona, F. and Montanari, U. Observability concepts in abstract data type specification. Proc. 5th MFCS, Gdansk. Springer LNCS 45.

    Google Scholar 

  18. Goguen, J.A. and Burstall, R.M. Introducing institutions. Proc. Logics of Programming Workshop (E.Clarke, ed.), Springer LNCS 164, pp. 221–256.

    Google Scholar 

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

    Google Scholar 

  20. Guttag, J.V. The specification and application to programming of abstract data types. Ph.D. thesis, University of Toronto.

    Google Scholar 

  21. Kamin, S. Final data types and their specification. TOPLAS 5, 1, pp. 97–121.

    Google Scholar 

  22. Levy, M.R. and Maibaum, T.S.E. Continuous data types. SIAM J. Computing 11, 2, pp.201–216.

    Google Scholar 

  23. Mahr, B. and Makowsky, J.A. Characterizing specification languages which admit initial semantics. Theoretical Computer Science 31(1984), pp.49–60.

    Google Scholar 

  24. Meseguer, J. Varieties of chain-complete algebras. Journal of Pure and Applied Algebra 19(1980), pp. 347–383.

    Google Scholar 

  25. Milner, R. Fully abstract semantics of typed λ-calculi. Theoretical Computer Science 4(1977), pp. 1–22.

    Google Scholar 

  26. Möller, B. An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language. Proc. ICALP'83 (J.Diaz, ed.), Springer LNCS 154, pp. 513–526.

    Google Scholar 

  27. Möller, B. On the algebraic specification of infinite objects — ordered and continuous models of algebraic types. To appear in Acta Informatica.

    Google Scholar 

  28. Nivat, M. On the interpretation of recursive polyadic program schemes. Instituto Nazionale di Alta Matematica, Symposia Matematica XV. London, Academic Press 1975, pp. 255–281.

    Google Scholar 

  29. Mosses, P.D. Abstract semantic algebras! Proc. IFIP TC2 Working Conf. on Formal Description of Programming Concepts — II, Garmisch-Partenkirchen, North-Holland 1983.

    Google Scholar 

  30. Mosses, P.D. A basic abstract semantic algebra. Proc. Intl. Symp. Semantics of Data Types, Sophia-Antipolis, France, Springer LNCS 173, pp. 87–108.

    Google Scholar 

  31. Plotkin, G.D. LCF considered as a programming language. Theoretical Computer Science 4(1977), pp. 223–255.

    Google Scholar 

  32. Sannella, D.T. and Tarlecki, A. Building specifications in an arbitrary institution. Proc. Intl. Symposium on Semantics of Data Types, Sophia-Antipolis, Springer LNCS 173, pp. 337–356.

    Google Scholar 

  33. Sannella, D.T. and Tarlecki, A. On observational equivalence and algebraic specification. Proc. CAAP'85 (TAPSOFT), Berlin, Springer LNCS 185, pp. 308–322.

    Google Scholar 

  34. Sannella, D.T. and Wirsing, M. A kernel language for algebraic specification and implementation. Proc. Intl. Conf. on Foundations of Computation Theory, Borgholm, Sweden. Springer LNCS 158, pp. 413–427.

    Google Scholar 

  35. Scott, D. The lattice of flow diagrams. Symp. The Semantics of Programming Languages (E.Engeler, ed.), Springer LNM 188, pp. 311–372.

    Google Scholar 

  36. Scott, D. Data types as lattices. SIAM Journal on Computing, 5(1976), pp. 522–587.

    Google Scholar 

  37. Stoy, J.E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge 1977.

    Google Scholar 

  38. Tarlecki, A. On the existence of free models in abstract algebraic institutions. Draft report, Dept. of Computer Science, Univ. of Edinburgh.

    Google Scholar 

  39. Tarlecki, A. Quasi-varieties in abstract algebraic institutions. Report CSR-173-84, Dept. of Computer Science, Univ. of Edinburgh.

    Google Scholar 

  40. Wand, M. Final algebra semantics and data type extensions. JCSS 19, pp. 27–44.

    Google Scholar 

  41. Wirsing, M., Pepper, P., Partsch, H., Dosch, W. and Broy, M. On hierarchies of abstract data types. Acta Informatica 20, pp. 1–33.

    Google Scholar 

  42. Zilles, S.N. Algebraic specification of data types. Computation Structures Group memo 119, Laboratory for Computer Science, MIT.

    Google Scholar 

Download references

Author information

Author notes

  1. Andrzej Tarlecki

    Present address: Institute of Computer Science, Polish Academy of Sciences, Warsaw

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, UK

    Andrzej Tarlecki

  2. Fakultät für Informatik, Universität Passau, Germany

    Martin Wirsing

Authors
  1. Andrzej Tarlecki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Wirsing
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tarlecki, A., Wirsing, M. (1985). Continuous abstract data types: Basic machinery and results. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028827

Download citation

  • DOI: https://doi.org/10.1007/BFb0028827

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics