Skip to main content

General programming properties of effective numberings of subrecursive classes

  • Chapter
  • First Online:
  • 140 Accesses

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

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.

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1987). General programming properties of effective numberings of subrecursive classes. In: A Connotational Theory of Program Structure. Lecture Notes in Computer Science, vol 273. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18253-5_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-18253-5_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47846-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics