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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 443 LNCS, Issue , 1990, Pages 181-194

  Jagadeesan, Radha ^a   Panangaden, Prakash ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DIFFERENTIATION (CALCULUS); SEMANTICS;

ALGEBRAIC STRUCTURES; BINARY OPERATIONS; CONCEPTUAL VIEWS; CONCURRENT COMPOSITION; DOMAIN THEORETIC MODELS; HIGHER-ORDER PROCESS; OPERATIONAL SEMANTICS; POWERDOMAIN CONSTRUCTIONS;

CALCULATIONS;

EID: 85031940978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032031     Document Type: Conference Paper

References (20)

1. S. Abramsky and C. H. L. Ong. Full abstraction in the lazy lambda calculus. Submitted to Information and Computation, 1988.
2. H. P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. Studies in Logic. North-Holland, Amsterdam, revised edition edition, 1984.
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.
4. G. Berry and G. Boudol. The chemical abstract machine. In Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, 1990.
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.
6. U. Engberg and M. Neilsen. A calculus of communicating systems with label passing. DAIMI PB-208, Aarhus University, 1986.
7. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
8. R. Jagadeesan and P. Panangaden. A domain-theoretic model for a higher-order process calculus. Technical Report TR 89-1058, Cornell, 1989.
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.
10. G. Kahn. The semantics of a simple language for parallel programming. In Information Process 74, pages 993–998. North-Holland, 1977.
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.
12. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
13. F. Neilson. The typed lambda-calculus with first-class processes. In PARLE89, Lecture Notes in Computer Science 366, pages 357–373, 1989.
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.
15. G. D. Plotkin. A powerdomain construction. SIAM Journal of Computing, 5(3):452–487, 1976.
16. J. H. Reppy. Synchronous operations as first-class values. In Proceedings of the SIGPLAN conference on Programming language design and implementation, 1988.
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.
18. M. B. Smyth and G. D. Plotkin. The category theoretic solution of recursive domain equations. Siam Journal of Computing, 11(4), 1982.
19. B. Thomsen. A calculus of higher-order communicating systems. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1988.
20. ∞ models of the λ-calculus. SIAM J. Computing, 5:488–521, 76.