Skip to main content
SpringerLink
Log in
Book cover

Programming Symposium pp 266–279Cite as

Listing of information structures defined by fixed-point operators

  • Theorie De La Programmation Theory Of Programming
  • Conference paper
  • First Online:

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

Abstract

First S-questionnaires are introduced as mechanical devices which permit the representation of recursively definable families of information structures by means of sets of sequences of non-negative integers. The subclass of L-questionnaires is then defined enabling: i) a bijection between such a family F and the set ℕ of non-negative integers ii) the construction of an operator admitting exactly the elements of F as its fixed-points. Two examples are treated extensively.

The research reported here was supported by the C.N.R., under contract n. 72.000246.42 of the Special Program for Informatica.

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.

References

  1. C. Böhm — "Structure informative e loro trasformazioni", Atti del III Seminario sul Trattamento Automatico delle Informazioni, Istituto Matematico U. Dini, Firenze (1972), 1–37.

    Google Scholar 

  2. C. Böhm and S. Ronchi della Rocca — "Numbering methods of finite sets and multisets through trees", Communication of ACM Symposium, Venice (1972), 516–524.

    Google Scholar 

  3. C. Böhm and M. Dezani-Ciancaglini — "Listing the functional digraph structures", Proc. International Computing Symposium 1973, A. Günther ed., Amsterdam (1974), 33–39.

    Google Scholar 

  4. W. S. Brainerd — "Three Generating Regular Systems", Information and Control, vol. 14, n. 2, (1969), 217–231.

    Google Scholar 

  5. D.E. Knuth — "The Art of Computer Programming", Vol. 2, Seminumerical Algorithms, Addison-Wesley, Menlo Park (1971), 398–422.

    Google Scholar 

  6. C. Picard — "Théorie des questionnaires", Gauthier-Villars, Paris (1965), Ch. 5.

    Google Scholar 

  7. J.R.Shoenfield — "Degrees of Unsolvability", North-Holland Mathem. Studies 2, Amsterdam (1971), 1–11.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Scienza dell'Informazione dell'Università di Torino, Via S. Massimo, n. 43, Torino

    C. Böhm, M. Dezani-Ciancaglini & S. Ronchi Della Rocca

Authors
  1. C. Böhm
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Dezani-Ciancaglini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Ronchi Della Rocca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Robinet

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Böhm, C., Dezani-Ciancaglini, M., Ronchi Della Rocca, S. (1974). Listing of information structures defined by fixed-point operators. In: Robinet, B. (eds) Programming Symposium. Lecture Notes in Computer Science, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06859-7_139

Download citation

  • DOI: https://doi.org/10.1007/3-540-06859-7_139

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37819-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation