Secd-m: a virtual machine for applicative programming

  • S. Abramsky
  • R. Sykes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 201)


We present a virtual machine to support applicative multiprogramming — in description of concurrent, asynchronous systems such as operating systems in a functional style. The machine extends Landin's secd machine to support multiple concurrent expression evaluation, non-determinism in the form of the fair merge, and a full range of input and output devices. This allows systems programs to be written in a functional style. The secd-m machine has been implemented and a number of functional concurrent programs demonstrated.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

10. References

  1. Abramsky, S. On Semantic Foundations for Applicative Multiprogramming, in Automata, Languages and Programming: 10th International Colloquium, ed. J. Diaz, Springer LNCS Vol 154, 1983.Google Scholar
  2. Abramsky, S. Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming, in Foundations of Computation Theory, ed. M. Karpinski, Springer LNCS Vol 158, 1983.Google Scholar
  3. Abramsky, S. Reasoning about Concurrent Systems: a Functional Approach, in Distributed Computing, ed F.Chambers and D.Duce, Academic Press, 1984.Google Scholar
  4. Friedman, D and Wise, D. CONS Should not Evaluate its Arguments. in Automata, Languages and Programming. ed. S. Michaelson & R. Milner. Edinburgh University Press. 1976.Google Scholar
  5. Henderson, P. and Morris, J. H. A Lazy Evaluator. Proc. Third Acm Conference on Principles of Programming Languages, 1976.Google Scholar
  6. Henderson, P. Functional Programming, Application and Implementation. Academic Press, 1980Google Scholar
  7. Hennessey, M. The Semantics of Call-by-Name and Call-by-Value in a Non-deterministic Environment. SIAM J. Computing, 1980.Google Scholar
  8. Landin, P. J. The Mechanical Evaluation of Expressions. Computer Journal, 1964.Google Scholar
  9. McCarthy, J. A Basis for a Mathematical Theory of Computation. In Studies in Logic: Computer Programming and Formal Systems. ed. Braffort & Hirschberg. North Holland 1963.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • S. Abramsky
    • 1
  • R. Sykes
    • 1
  1. 1.Department of ComputingImperial College of Science and TechnologyLondon

Personalised recommendations