Skip to main content
SpringerLink
Log in

Semantics and implementation of prefixing at many levels

  • Conference paper
  • First Online:
Logics of Programs and Their Applications (Logic of Programs 1980)

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

Included in the following conference series:

Abstract

A generalization of Simula's prefixing of classes is presented. The notion of one-level prefixing is first introduced by means of the example of Simula 67; the semantics of a programming language with prefixing at many levels is then discussed and analyzed.

The principles for efficiently implementing programming languages with prefixing of classes at many levels are described. A generalized display mechanism is introduced and the correctness of a display update algorithm is proved. A new data structure for efficient identification of dynamic objects is also presented.

This research was supported in part by "Zjednoczenie MERA" of Poland.

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. Bartol W.M. "The definition of the semantics of some instructions of a block structured language with type prefixing.", manuscript, 1980.

    Google Scholar 

  2. Berry D.M., Chirica L., Johnston J.B., Martin D.F. and Sorkin A. "Time required for reference count management in retention block-structured languages." Part 1, Int. J. Comp. and Inf. Sciences, Vol.7, No.1 (March 1978), pp.11–64.

    Google Scholar 

  3. Bobrow D.G., Wegbreit B. "A model and stack implementation of multiple environments", Comm.A.C.M., Vol.16, No.10 (Oct.1973), pp.591–603.

    Google Scholar 

  4. Dahl O-J., Myrhaug B., Nygaard K., "Simula 67 Common Base Language", Norwegian Computing Center 1970.

    Google Scholar 

  5. Dahl O-J., Wang A., "Coroutine sequencing in a block structured environment", B.I.T. Vol.11 (1971), pp.425–449.

    Google Scholar 

  6. Dijkstra E.W., "Recursive programming", Numerische Mathematik 2, Vol.2 (1960), pp.312–318.

    Google Scholar 

  7. Gries D., "Compiler construction for digital computers." New York, Wiley 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, 00-901, Warsaw, P.K.i N., Poland

    W. M. Bartol, A. Kreczmar, A. I. Litwiniuk & H. Oktaba

Authors
  1. W. M. Bartol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Kreczmar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. I. Litwiniuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. H. Oktaba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Salwicki

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bartol, W.M., Kreczmar, A., Litwiniuk, A.I., Oktaba, H. (1983). Semantics and implementation of prefixing at many levels. In: Salwicki, A. (eds) Logics of Programs and Their Applications. Logic of Programs 1980. Lecture Notes in Computer Science, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11981-7_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-11981-7_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation