Skip to main content
SpringerLink
Log in

Procedure mechanisms of abstraction

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

The article considers the use of the procedure mechanism with procedure type parameters in modular organization of programs and program systems. Descriptions of modules realizing various types of abstractions with the aid of this mechanism are demonstrated. The notion of a mixed abstraction is introduced and a method of its realization by the procedure mechanism is proposed.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. B. Liskov, R. Atkinson, T. Bloom, E. Moss, C. Shaffert, B. Schleifer, and A. Snyder, CLU Reference Manual, MIT Lab. Comput. Sci. Techn. Rep. No. 225 (1979).

  2. J. E. B. Moss, Abstract Data Types in Stack Based Languages, MIT Lab. Comput. Sci. Tech. Rep. No. 190 (1978).

  3. W. A. Wulf, “Languages and structured programs,” in: Current Trends in Programming Methodology, Prentice-Hall, Englewood Cliffs, New Jersey (1977), pp. 33–60.

    Google Scholar 

  4. O.-J. Dahl. W. Myhrhaug, and K. Nygaard, Simula-67 Common Base Language, Norwegian Computing Center, Pub. S-22, Oslo (1971).

  5. O.-J. Dahl and C. Hoare, “Hierarchical program structures,” in: O.-J. Dahl, E. Dijkstra, and C. Hoare, Structured Programming, Academic Press, New York (1972).

    Google Scholar 

  6. M. Shaw, W. A. Wulf, and R. L. London, “Abstraction and verification in Alphard: defining and specifying iteration and genrators,” Commun. ACM,20, No. 8, 553–564 (1977).

    Google Scholar 

  7. E. Dijkstra, A Discipline of Programming, Prentice-Hall, Englewood Cliffs, New Jersey (1976).

    Google Scholar 

  8. A. I. Érshov, “On the essence of translation,” Programmirovanie, No. 5, 21–39 (1977).

    Google Scholar 

  9. Preliminary ADA Reference Manual, ACM (1979).

  10. D. R. Hanson and R. E. Griswold, “The SL5 procedure mechanism,” Commun. ACM,21, No. 5, 392–400 (1978).

    Google Scholar 

  11. C. H. Lindsey, “Specification of partial parametrization proposal,” Algol Bull., No. 39, 6–9 (1976).

    Google Scholar 

  12. H. Boom, “Separate compilation, definition modules and block structured languages,” Amsterdam Math. Centre Preprint IW 77/77.

  13. C. H. Lindsey, “Modals,” Algol Bull., No. 37, 26–29 (1973).

    Google Scholar 

  14. H. Boom, “Extended type checking,” Amsterdam Math. Centre Preprint IW 60/76.

  15. J. C. Reynolds, “User defined types and procedural data structures as complementary approaches to data abstraction,“ Conf. New Directions in Algorithmic Languages, IFIP Working Group 2.1, Munich (1975).

  16. I. O. Babaev, F. A. Novikov, and T. I. Petrushina, “The language Dekart —a source language for the system SPORA,” Prik. Inf., No. 1, 35–73 (1981).

    Google Scholar 

  17. A. S. Ivanov, “Using the procedural parameter mechanism in modular package organization,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,90, 24–38 (1979).

    Google Scholar 

  18. A. S. Ivanov, “On the organization of services,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,102, 19–26 (1980).

    Google Scholar 

  19. D. R. Vodenin and I. V. Romanovskii, “Programming in terms of services,” Kibernetika, No. 5,. 70–75 (1979).

    Google Scholar 

  20. G. S. Tseitin, “Nonmathematical thinking in programming,” in: Horizons in System and Theoretical Programming [in Russian], Novosibirsk (1979), pp. 128–132.

  21. T. Pratt, Programming Languages: Design and Implementation, Prentice-Hall, Englewood Cliffs, New Jersey (1975).

    Google Scholar 

  22. J. Weizenbaum, “Symmetric list processor,” Commun. ACM,6, No. 9, 524–544 (1963).

    Google Scholar 

  23. A. Newell (ed.), Information Processing Language Manual, Prentice-Hall, Englewood Cliffs, New Jersey (1964).

    Google Scholar 

  24. H. Abramson, “Ordered types and generalized for statement,” SIGPLAN Not.,12, No. 12, 55–59 (1977).

    Google Scholar 

  25. C. Boehm and G. Jacopini, “Flow diagrams, Turing machines, and languages with only two. formation rules,” Commun. ACM,9, No. 5, 366–371 (1966).

    Google Scholar 

  26. D. E. Knuth, “Structured programming with go to statement,” Computer Surveys,6, No. 4, 261–302 (1974).

    Google Scholar 

  27. P. Winston, Artificial Intelligence, Addison-Wesley, Reading, Mass. (1977).

    Google Scholar 

  28. P. Brown, Macro Processors and Techniques of Portable Software, Wiley, London (1974).

    Google Scholar 

  29. A. M. Addyman et al., “A draft description of Pascal,” Software Pract. and Exper.,9, No. 5 (1979).

Download references

Authors
  1. I. R. Agamirzyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 111, pp. 5–30, 1981

We would like to acknowledge the valuable comments of S. S. Lavrov, I. V. Romanovskii, N. N. Nepeivoda, T. I. Petrushina, and F. A. Novikov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Agamirzyan, I.R., Ivanov, A.S. Procedure mechanisms of abstraction. J Math Sci 24, 1–15 (1984). https://doi.org/10.1007/BF01230260

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01230260

Keywords

Search

Navigation