Skip to main content
SpringerLink
Log in
Book cover

Methods of Algorithmic Language Implementation pp 188–208Cite as

Metaalgorithmic system of general application (MASON)

  • Chapter
  • First Online:

  • 112 Accesses

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

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. Sklansky J., Finkelstein M., Russel E.C. A formalism for program translation. J. ACM 15, 2 (April, 1968-), 165–175

    Google Scholar 

  2. Earley J., Sturgis H. A formalism for translator interactions. Comm. ACM 13 10 (Oct. 1970), 607–616

    Google Scholar 

  3. А.С.Клещев, В.Л.Темов Язык программирования ИНФ и его реализапия. "Наука", Ленинград, 1973. (INF programming language and its realization).

    Google Scholar 

Download references

Authors
  1. V. L. Tëmov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Ershov C. H. A. Koster

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Tëmov, V.L. (1977). Metaalgorithmic system of general application (MASON). In: Ershov, A., Koster, C.H.A. (eds) Methods of Algorithmic Language Implementation. Lecture Notes in Computer Science, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08065-1_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-08065-1_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08065-7

  • Online ISBN: 978-3-540-37510-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation