Skip to main content
SpringerLink
Log in

The construction of types of abstract machines in SIMAC

  • Grundlagen Der Programmierung
  • Conference paper
  • First Online:
GI — 5. Jahrestagung (GI 1975)

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

Included in the following conference series:

  • 1972 Accesses

Abstract

In this paper, we have shown how, starting from very elementary tools, one could construct a powerful type of abstract machine with its own language. Machines of this type are pratical enough to construct the remainder of SIMAC.

Through our approach, a machine can be looked upon as a network of other machines (its computing operators) synchronized by the processor and the controlling operator. Of course, this machine can, in turn, be used for further extensions.

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. J. Arsac — Un langage de programmation sans branchements (RAIRO, B2, Juin 1972).

    Google Scholar 

  2. T.E. Cheatham — J.A. Fischer and P.Jorrand — On the basis for ELF, an extensible language facility (FJCC, December 1968).

    Google Scholar 

  3. C.Daquin, C.Girault — SIMAC, simulateur conversationnel d'automates (RAIRO, B3, Septemore 1972).

    Google Scholar 

  4. C.Daquin, C.Girault — SIMAC, an extensible system for abstract machines (n o I.P. 73.17, novembre 1973).

    Google Scholar 

  5. C.Daquin — SIMAC, un système extensible de mise en oeuvre de machines abstraites (thèse de troisième cycle, n o IP, 74–5, Mai 1974).

    Google Scholar 

  6. J.B. Dennis — First version of a data flow procedure language (Colloque sur la programmation, Paris Avril 1974).

    Google Scholar 

  7. C.A.R. Hoare — An operating system structuring concept (CACM. october 1974).

    Google Scholar 

  8. D.E. Knuth — Examples of formal semantics (Symposium on semantics of algorithmic languages edited by Erwin Engeler, University of Minnesota, Springer lecture notes, 1971).

    Google Scholar 

  9. B. Liskov, S. Zilles — Programming with abstract data types. (Proceedings of a symposium on very high level languages March 1974. SIGPLAN NOTICES, Volume 9, number 4, April 1974).

    Google Scholar 

  10. D.C.Luckam, D.Park, M.S.Paterson — Formalized computer programs (J.C.S.S. June 1970).

    Google Scholar 

  11. J.Neuhold — The Formal Description of Programming Languages (IBM Systems Journal, 1971, vol. 10, n o 2).

    Google Scholar 

Download references

Authors
  1. C. Daquin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Girault
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Mülbacher

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Daquin, C., Girault, C. (1975). The construction of types of abstract machines in SIMAC. In: Mülbacher, J. (eds) GI — 5. Jahrestagung. GI 1975. Lecture Notes in Computer Science, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07410-4_631

Download citation

  • DOI: https://doi.org/10.1007/3-540-07410-4_631

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07410-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation