Skip to main content
SpringerLink
Log in

A domain-theoretic model for a higher-order process calculus

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1990)

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

Included in the following conference series:

Abstract

In this paper we study a higher-order process calculus, a restriction of one due to Boudol, and develop an abstract, model for it. By abstract we mean that the model is constructed domain-theoretically and reflects a certain conceptual view-point about observability. It is not constructed from the syntax of the calculus or from computation sequences. We describe a new powerdomain construction that can be given additional algebraic structure that allows one to model concurrent composition, in the same sense that Plotkin's powerdomain can have a continuous binary operation defined on it to model choice. We show that the model constructed this way is adequate with respect to the operational semantics. The model that we develop and our analysis of it is closely related to the work of Abramsky and Ong on the lazy lambda calculus.

This research was supported by the National Sciences Foundation under Grant No. CCR-8818979

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. S. Abramsky and C. H. L. Ong. Full abstraction in the lazy lambda calculus. Submitted to Information and Computation, 1988.

    Google Scholar 

  2. H. P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. Studies in Logic. North-Holland, Amsterdam, revised edition edition, 1984.

    Google Scholar 

  3. G. Berry. Some syntactic and categorical constructions of lambda-calculus models. Technical Report 80, Institute National de Recherche en Informatique et en Automatique (INRIA), 1981.

    Google Scholar 

  4. G. Berry and G. Boudol. The chemical abstract machine. In Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, 1990.

    Google Scholar 

  5. G. Boudol. Towards a lambda-calculus for concurrent and communicating systems. In J. Diaz, editor, TAPSOFT 89, Lecture Notes in Computer Science 351, pages 149–161. Springer-Verlag, 1989.

    Google Scholar 

  6. U. Engberg and M. Neilsen. A calculus of communicating systems with label passing. DAIMI PB-208, Aarhus University, 1986.

    Google Scholar 

  7. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.

    Google Scholar 

  8. R. Jagadeesan and P. Panangaden. A domain-theoretic model for a higher-order process calculus. Technical Report TR 89-1058, Cornell, 1989.

    Google Scholar 

  9. B. Jonsson. A fully abstract trace model for dataflow networks. In Proceedings of the Sixteenth Annual ACM Symposium On Principles Of Programming Languages, 1989.

    Google Scholar 

  10. G. Kahn. The semantics of a simple language for parallel programming. In Information Process 74, pages 993–998. North-Holland, 1977.

    Google Scholar 

  11. J. Kok. A fully abstract semantics for dataflow nets. In Proceedings of Parallel Architectures And Languages Europe 1987, pages 351–368, Berlin, 1987. Springer-Verlag.

    Google Scholar 

  12. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  13. F. Neilson. The typed lambda-calculus with first-class processes. In PARLE89, Lecture Notes in Computer Science 366, pages 357–373, 1989.

    Google Scholar 

  14. C. H. L. Ong. The Lazy Lambda Calculus: An Investigation into the Foundations of Functional Programming. PhD thesis, Imperial College of Science and Technology, 1988.

    Google Scholar 

  15. G. D. Plotkin. A powerdomain construction. SIAM Journal of Computing, 5(3):452–487, 1976.

    Google Scholar 

  16. J. H. Reppy. Synchronous operations as first-class values. In Proceedings of the SIGPLAN conference on Programming language design and implementation, 1988.

    Google Scholar 

  17. J. R. Russell. Full abstraction for nondeterministic dataflow networks. In Proceedings of the 30th Annual Symposium of Foundations of Computer Science, pages 170–177, 1989.

    Google Scholar 

  18. M. B. Smyth and G. D. Plotkin. The category theoretic solution of recursive domain equations. Siam Journal of Computing, 11(4), 1982.

    Google Scholar 

  19. B. Thomsen. A calculus of higher-order communicating systems. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1988.

    Google Scholar 

  20. C. P. Wadsworth. The relation between computational and denotational properties for Scott's D ∞ models of the λ-calculus. SIAM J. Computing, 5:488–521, 76.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept.of Computer Science, Cornell University, USA

    Radha Jagadeesan & Prakash Panangaden

Authors
  1. Radha Jagadeesan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prakash Panangaden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jagadeesan, R., Panangaden, P. (1990). A domain-theoretic model for a higher-order process calculus. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032031

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52826-5

  • Online ISBN: 978-3-540-47159-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation