Skip to main content
SpringerLink
Log in

Recursive definitions revisited

  • Foundations
  • Conference paper
  • First Online:
VDM '90 VDM and Z — Formal Methods in Software Development (VDM 1990)

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

Included in the following conference series:

  • 121 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.

References

  1. Goguen, J., J. W. Thatcher, E. G. Wagner and J. B. Wright. “An initial algebra semantics and continuous algebras”. Journal of the ACM, Vol. 24(1), January 1977, pp. 68–95.

    Google Scholar 

  2. Aho, A. V., J. E. Hopcroft, and J. D. Ullman The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.

    Google Scholar 

  3. Bednarczyk, M. A. and A. M. Borzyszkowski. “Graphs make initial uniform topological algebras”, in preparation.

    Google Scholar 

  4. Bednarczyk, M. A., A. M. Borzyszkowski and W. Pawłowski. “Towards the Semantics of the Definitional Language of MetaSoft”. This volume.

    Google Scholar 

  5. Cohn, P. M. Universal Algebra. Harper and Row, 1965.

    Google Scholar 

  6. Courcelle, B. “Fundamental properties of infinite trees”. Theoretical Computer Science 25, 1983, pp. 95–169.

    Google Scholar 

  7. Courcelle, B. “Equivalences and Transformations of Regular Systems—Applications to Recursive Program Schemes and Grammars”. Theoretical Computer Science 42, 1986, pp. 1–122.

    Google Scholar 

  8. Grätzer, G. Universal Algebra. 2-nd edition, Springer-Verlag, 1979.

    Google Scholar 

  9. Milner, R. “Calculi for Synchrony and Asynchrony”. Theoretical Computer Science 25, 1983, pp. 267–310.

    Google Scholar 

  10. Park, D. “Concurrency and Automata on Infinite Sequences”. Proceedings 5th GI Conf. on Theoret. Comp. Science, Lecture Notes in Computer Science 104, Springer-Verlag, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Project MetaSoft Institute of Computer Science, Polish Academy of Sciences, Poland

    Marek A. Bednarczyk, Andrzej M. Borzyszkowski & Wiesław Pawłowski

  2. c/o Institute of Computer Science, Gdańsk Division of the PAS, ul. Jaśkowa Dolina 31, P.O.Box 562, PL-80252, Gdańsk, Poland

    Marek A. Bednarczyk, Andrzej M. Borzyszkowski & Wiesław Pawłowski

Authors
  1. Marek A. Bednarczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej M. Borzyszkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wiesław Pawłowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. Bjørner C. A. R. Hoare H. Langmaack

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bednarczyk, M.A., Borzyszkowski, A.M., Pawłowski, W. (1990). Recursive definitions revisited. In: Bjørner, D., Hoare, C.A.R., Langmaack, H. (eds) VDM '90 VDM and Z — Formal Methods in Software Development. VDM 1990. Lecture Notes in Computer Science, vol 428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52513-0_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-52513-0_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52513-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation