A fully abstract denotational model for higher-order processes

Information and Computation

Volumn 112, Issue 1, 1994, Pages 55-95

  Hennessy, M ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002063077     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1994.1052     Document Type: Article

References (34)

1. Astesiano, E., Giovini, A., and Reggio, G. (1988), Generalised bisimulation in relational specifications, in "Proceedings of STACS 88," pp. 207-226, Lecture Notes in Computer Science, Vol. 294, Springer-Verlag, Berlin/New York.
2. Abramsky, S. (1990), The lazy lambda calculus, in "Research Topics in Functional Programming," (D. Turner, Ed.), pp. 65-117, Addison-Wesley, Reading, MA.
3. Abramsky, S. (1991), Domain theory in logical form, Ann. Pure Appl. Logic 51, 1-77.
4. Abramsky, S., and Ong, C. (1993), Full abstraction in the lazy lambda calculus, Inform, and Comput. 105, 159-267.
5. Astesiano, E., and Reggio, G. (1987), SMoLS-driven concurrent calculi, in "TAPSOFT 1987," pp. 169-201, Lecture Notes in Computer Science, Vol.351, Springer-Verlag, Berlin/New York.
6. Barendregt, H. (1984), "The Lambda Calculus," Logic, Vol. 103, North- Holland, Amsterdam.
7. Barendregt, H., Coppo, M., and Dezani-Ciancaglini, M. (1983), A filter model and the completeness of type assignment, J. Symbolic Logic 48, 931-940.
8. Boudol, G. "Towards a lambda-calculus for concurrent and communicating systems, in "Proceedings, TAPSOFT 89" (J. Diaz, Ed.), pp. 149-161, Lecture Notes in Computer Science, Vol. 351, Springer-Verlag, Berlin/New York.
9. Boudol, G. (1990), Flow event structures and (low nets, in "Semantics of Systems of Concurrent Processes, Proceedings LITP Spring School on Theoretical Computer Science, La Roche Posay" (I. Guessarian, Ed.), pp. 62-95, Lecture Notes in Computer Science, Vol. 469, Springer-Verlag, Berlingl New York.
10. Boudol, G. (1990), "A Lambda-Calculus for Parallel Functions," Technical Report 1231, INRIA-Sophia Antipolis.
11. Boudol, G. (1993), "Lambda-Calculi for (Strict) Parallel Functions," Technical Report 1387, INRIA-Sophia Antipolis; Inform, and Comput. 108, pp. 51-127.
12. Boudol, G. (1992), "A Calculus of Communicating Objects," Research Report, INRIA, to appear.
13. Baeton, J., and Weijland, W. (1990), "Process Algebra," Cambridge Tracts in Computer Science, Vol. 18, Cambridge Univ. Press, London/New York.
14. Cardone, F., and Coppo, M. (1990), Two extensions of Curry's type inference system, in "Logic in Computer Science," (P. Odifreddi, Ed.), pp. 19-25, Academic Press, San Diego.
15. DeNicola, R., and Hennessy, M. (1984), Testing equivalences for processes, Theoret. Comput. Sci. 24, 83-113.
16. Giacalone, A., Mistra, P., and Prasad, S. (1990), Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming, in "Proceedings of ICALP 90," pp. 765-780, "Lecture Notes in Computer Science," Vol.443, Springer-Verlag, Berlin/New York.
17. Guessarian, I. (1981), "Algebraic Semantics," Lecture Notes in Computer Science, Vol. 99, Springer-Verlag, Berlin/New York.
18. Hennessy, M. (1988), "An Algebraic Theory of Processes," MIT Press, Cambridge, MA.
19. Hennessy, M., and Ingolfsdottir, A. (1993), A theory of communicating processes with value-passing, Inform, and Comput. 107, pp. 202-236.
20. Hindley, R. (1983), The completeness theorem for typing ʎterms, Theoret. Comput. Sci. 22, 1-7, 127-133.
21. Hennessy, M., and Milner, R. (1985), Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Much. 32, No. 1, 137-161.
22. Hoare, C. A. R. (1985), "Communicating Sequential Processes," Prentice-Hall, Englewood Cliffs, NJ.
23. Jagadeesan, R., and Panangaden, P. (1990), A domain-theoretic model for a higher-order process calculus, in "Proceedings, ICALP 90" (M. S. Paterson, Ed.), pp. 181-194, Lecture Notes in Computer Science, Vol.443, Springer- Verlag, Berlin/New York.
24. Leth, L., and Thomsen, B. (1992), "Some Facile Chemistry," Technical Report ERCC-92-14, ERCC.
25. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
26. Milner, R. (1991), The polyadic 7t-calculus: A tutorial, in "Proceedings International Summer School on Logic and Algebra of Specification, Marktober- dorf."
27. Milner, R., Parrow, J., and Walker, D., Processes, I, Inform, and Comput. 100, 1-40.
28. Milner, R., Parrow, J., and Walker, D., Processes, II, Inform, and Comput. 100, 41-77.
29. Nielson, F. (1989), The typed a-calculus "Proceedings of Parle 89," Lecture Notes in Springer-Verlag, Berlin/New York.
30. Plotkin, G. D. (1981), A Structural Approach to Operational Semantics," Report DAIMI FN-19, Computer Science Department, Aarhus University.
31. Sangiorgo, D. (1992), "Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms," Ph.D. Thesis, Edinburgh University.
32. Scott, D. S. (1982), Domains for denotational semantics, in "Proceedings, ICALP 82" (M. Neilsen and E. M. Schmidt, Eds.), pp. 577-613, Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, Berlin/New York.
33. Thomsen, B. (1989), A calculus of higher order communicating systems, in "Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages," pp. 143-154.
34. Thomsen, B. (1990), "Calculi for Higher-Order Communicating Systems," Ph.D. Thesis, Imperial College.