Skip to main content

Theoretical aspects of Σ-programming

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Methods of Specification and Synthesis of Software Systems '85 (MMSSS 1985)

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise J. Admissible sets and structures, B., Springer-Verlag, 1975.

    Google Scholar 

  2. Ershov Yu.L. The principle of Σ-enumeration, Doklady AN SSSR, 1983, v.270, No 5, p. 786–788.

    Google Scholar 

  3. Ershov Yu.L. The dynamic logic over admissible sets, Doklady AN SSSR, 1983, v.273, No 5, p. 1045–1048.

    Google Scholar 

  4. Goncharov S.S., Sviridenko D.I. Σ-programming. In: Vychislitel'nye sistemy, vyp.107, Novosibirsk, 1985.

    Google Scholar 

Download references

Authors

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goncharov, S.S., Sviridenko, D.I. (1986). Theoretical aspects of Σ-programming. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics