Advertisement

Real—Time Functional Programming

  • Peter D. Grogono
Conference paper

Abstract

We can envision a real-time program as a system of concurrent processes. While concurrent processes suggest an efficient implementation, reasoning about them is difficult. An abstract representation based on a functional notation makes reasoning easier. The functional program that represents a particular real-time system can be transformed into an equivalent system of concurrent processes.

Keywords

Output Port Functional Program Concurrent Process Output Stream Functional Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abramsky, S. and R. Sykes• SBCD-M: a virtual machine for applicative programming. In Functional Programming Languages and Computer Architecture ,LNCS 201, Springer-Verlag 1985, 81–98.Google Scholar
  2. 2.
    Burstall, R.M. and J. Darlington. A transformation model for developing recursive programs. J. ACM, 24 ,1, 44–67 (1977).CrossRefGoogle Scholar
  3. 3.
    Dannenberg, R. B. Arctic: a functional language for real-time control. In Symposium on LISP and Functional Programming ,ACM, 1984, 96–103.CrossRefGoogle Scholar
  4. 4.
    Davis, E. A high-level real-time programming language. Technical Report No. 145 and Robotics Report No. 36 ,New York University, 1984.Google Scholar
  5. 5.
    Henderson, P. Purely functional operating systems. In Functional Programming and its Applications: an Advanced Course ,J. Darlington, P. Henderson, and D. Turner (eds), Cambridge University Press, 1982, 177–192.Google Scholar
  6. 6.
    Hoare, C.A.R. Communicating Sequential Processes. Comm. ACM, 21 ,8, 666–677 (1978).CrossRefGoogle Scholar
  7. 7.
    Kluge, W.E. and H. Schlutter. Petri net models for the evaluation of applicative programs based on λ-expressions. IEEE Trans. Soft. Engrg., SE-9 ,4, 415–426 (1983).CrossRefGoogle Scholar
  8. 8.
    Silberschatz, A. Port directed communication. Comp. J., 24 ,1, 78–82 (1981).CrossRefGoogle Scholar
  9. 9.
    Wadler, P.L. Listlessness is Better than Laziness. Ph.D. Thesis, Carnegie-Mellon University, 1984.Google Scholar
  10. 10.
    Warren, D.H.D. An improved Prolog implementation which optimizes tail recursion. DAI Research Report 141, University of Edinburgh, 1980.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Peter D. Grogono
    • 1
  1. 1.Department of Computer ScienceConcordia UniversityMontréalCanada

Personalised recommendations