Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing

Information and Computation

Volumn 145, Issue 1, 1998, Pages 64-106

  Hartonas, Chrysafis ^a   Hennessy, Matthew ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009026820     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2723     Document Type: Article

References (38)

1. Abramsky, S. (1991), A domain equation for bisimulation, Inform. and Comput. 92, 161-218.
2. Abramsky, S., Gabbay, D. M., and Maibaum, T. S. E. (Eds.) (1994), "Handbook of Logic in Computer Science," Vol. 1-6, Oxford Science Publications, Clarendon Press, Oxford.
3. Abramsky, S. (1991), Domain theory in logical form, Ann. Pure Appl. Logic 51, 1-77.
4. Amadio, R. M. (1994), "Translating Core Facile," Technical Report ECRC-1994-3, European Computer-Industry Research Center, Munich.
5. Barendregt, H. P. (1984), "The λ-Calculus, its Syntax and Semantics," North-Holland, Amsterdam.
6. Boudol, G. (1994), A λ-calculus for (strict) parallel functions, Inform. Comput. 108, 51-127.
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. Damiani, F., Dezani-Ciancaglini, M., and Giannini, P., A filter model for mobile processes, Math. Str. Comp. Sci., to appear.
9. Dezani-Ciancaglini, M., de'Liguoro, U., and Piperno, A. (1993), Filter models for a parallel and non deterministic λ-calculus, in "Proc. Mathematical Foundations of Computer Science 1993" (A. M. Borzyszkowski and S. Sokolowski, Eds.), LNCS 711, pp. 403-412, Springer-Verlag, Berlin.
10. Giacalone, A., Mishra, P., and Prasad, S. (1989), FACILE: A symmetric integration of concurrent and functional programming, Int. J. Parallel Program. 15(2), 121-160.
11. Ferreira, W., Hennessy, M., and Jeffrey, A. (1996), A theory of weak bisimulation for core CML, in "Proceedings of ACM SIGPLAN Int. Conf. Functional Programming," LNCS, pp. 201-212, Assoc. Comput. Mach., New York.
12. Ferreira, W., and Hennessy, M. (1995), Towards a semantic theory for CML, in "Proc. Mathematical Foundations of Computer Science 1995" (J. Wiedermann and P. Hájek, Eds.), LNCS 969, pp. 454-466, Springer-Verlag, Berlin.
13. Fereira, W., Hennessy, M., and Jeffrey, A. (1996), "Combining the Typed λ-Calculus with CCS," Report 2/96, University of Sussex, Computer Science.
14. Fournet, C., and Gonthier, G. (1994), The reflexive CHAM and the join-calculus, in "Proc. 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages," pp. 372-385, Assoc. Comput. Mach., New York.
15. Jeffrey, A. (1995), A fully abstract semantics for a concurrent functional language with monadic types, in "Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science," pp. 244-254, IEEE Computer Society Press.
16. Hartonas, C. (1998), Duality for modal μ-logics, Theoretical Comput. Sci., to appear.
17. Hartonas, C., and Hennessy, M. (1998), Full abstraction for a functional/concurrent language with higher-order value-passing (extended abstract), in "Proc. Computer Science Logic, CSL 97," LNCS 1414, pp. 239-354, Springer-Verlag, Berlin.
18. Hennessy, M. (1988), "An Algebraic Theory of Processes," MIT Press, Cambridge, MA.
19. Hennessy, M. (1994), A fully abstract denotational model for higher-order processes, Inform. and Comput. 112(1), 55-95.
20. Hennessy, M., Higher-order processes and their models, in "Proceedings, 21st International Colloquium on Automata, Languages and Programming" (S. Abiteboul and E. Shamir, Eds.), LNCS 820, pp. 286-303, Springer-Verlag, Berlin.
21. Larsen, K. G. (1990), Proof systems for satisfiability in Hennessy-Milner logic with recursion, Theoret. Comput. Sci. 72, 265-288.
22. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
23. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes I, II, Inform. and Comput. 100, 1-40, 41-77.
24. Moggi, E. (1991), Notions of computation and monads, Inform. and Comput. 93, 55-92.
25. Morris, J. (1968), "Lambda-Calculus Models of Programming Languages," Ph.D. thesis, MIT.
26. Plotkin, G. (1976), A powerdomain construction, SIAM J. Comput. 5, 452-487.
27. Plotkin, G. (1997), LCF considered as a programming language, Theoret. Comput. Sci. 5, 323-355.
28. Reppy, J. H. (1991), A higher-order concurrent language, in "Proceedings of the ACM SIGPLAN '91 PLDI, SIGPLAN Notices," No. 26, pp. 294-305, Assoc. Comput. Mach., New York.
29. Reppy, J. H. (1991), "Higher-Order Concurrency," Ph.D. thesis, Cornell University.
30. Reppy, J. (1991), CML: A higher-order concurrent language, in "Proc. ACM-SIGPLAN '91, Conf. on Programming Language Design and Implementation," Assoc. Comput. Mach., New York.
31. Sangiorgi, D., Bisimulation in higher-order calculu, Inform. and Comput., to appear. [Technical Report INRIA-Sophia Antipolis RR-2508. Revised version of the homonym paper appeared in the proc. IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET'94), North Holland, 1994].
32. Sieber, K. (1993), Call-by-value and nondeterminism, in "Typed λ-Calculi and Applications" (M. Bezen and J. F. Groote, Eds.), LNCS 664, Springer-Verlag, Berlin.
33. Stark, I. (1996), A fully-abstract domain model for the π-calculus, in "Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science," pp. 36-42, IEEE Computer Society Press.
34. Stirling, C. (1985), A proof-theoretic characterization of observational equivalence, Theoret. Comput. Sci. 39, 27-45.
35. Stirling, C. (1987), Modal logics for communicating systems, Theoret. Comput. Sci. 49, 311-347.
36. Thomsen, B. (1990), "Calculi for Higher-Order Communicating Systems," Ph.D. thesis, Imperial College.
37. Thomsen, B. (1993), Plain chocs: A second generation calculus for higher order processes, Acta Informatica 30, 1-59.
38. Winskel, G. (1985), A complete proof system for SCCS with modal assertions, in "Proceedings, 5th Conference on Foundations of Software Technology and Theoretical Computer Science" (S. Maheshwari, Ed.), LNCS 206, pp. 392-410, Springer-Verlag, Berlin.