Skip to main content
SpringerLink
Log in

The algebraic specification of semicomputable data types

  • Conference paper
  • First Online:
Recent Trends in Data Type Specification (ADT 1987)

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

Included in the following conference series:

Abstract

A proof is given for a theorem stating that every semicomputable data type can be specified with only one hidden sort. Preceding this, definitions for the notions signature and algebra are given in the setting of category theory and the notion of a (semi-)computable algebra is discussed.

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. Bergstra, J.A., J.V. Tucker, Algebraic specifications of computable and semicomputable data types, Theoretical Computer Science, 50, 1987.

    Google Scholar 

  2. —, The Completeness of the Algebraic Specification Methods for Computable Data Types, Information and Control, 54, (1982), pp. 186–200.

    Google Scholar 

  3. —, A characterisation of computable data types by means of a finite, equational specification method, in J.W. de Bakker and J. v. Leeuwen (eds.) Automata, Languages and Programming, Seventh Colloquium, Noordwijkerhout, 1980, Springer Verlag, Berlin, 1980, pp. 76–90.

    Google Scholar 

  4. Bloom, S.L., E.G.Wagner, Many-sorted theories and their algebras with some applications to data types, In Algebraic Methods in Semantics, edited by M.Nivat, J.C.Reynolds, Cambridge University Press, 1985, pp. 133–68.

    Google Scholar 

  5. Ehrig, H., B. Mahr, Fundamentals of Algebraic Specification 1, EATCS, Monographs on Theoretical Computer Science 6, Springer-Verlag, Berlin, 1985.

    Google Scholar 

  6. Malcev, A. I., Constructive algebras, I., Russian Mathematical Surveys 16 (1961) pp. 77–129.

    Google Scholar 

  7. MacLane,S., Categories for the Working Mathematician, Springer-Verlag, New York Inc., 1971.

    Google Scholar 

  8. J.Meseguer, J.A.Goguen, Initiality, induction and computability. In Algebraic Methods in Semantics, edited by M.Nivat, J.C.Reynolds, Cambridge University Press, 1985, pp. 459–541.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, University of Amsterdam, Aten Laboratorium, Kruislaan 409, 1098 SJ, Amsterdam

    J. L. M. Vrancken

Authors
  1. J. L. M. Vrancken
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. Sannella A. Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vrancken, J.L.M. (1988). The algebraic specification of semicomputable data types. In: Sannella, D., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT 1987. Lecture Notes in Computer Science, vol 332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50325-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-50325-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45970-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation