Subtyping and locality in distributed higher order processes

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

Volumn 1664 LNCS, Issue , 1999, Pages 557-572

  Yoshida, Nobuko ^a   Hennessy, Matthew ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DISTRIBUTED SYSTEMS; GENERAL CONSTRAINTS; HIGHER-ORDER; HIGHER-ORDER PROCESS; OR CHANNELS; P CALCULUS; SUBTYPINGS;

CALCULATIONS;

EID: 84888256815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_38     Document Type: Conference Paper

References (38)

1. Abadi, M. and Gordon, A., The Spi-calculus, Computer and Communications Security, pp.36-47, ACM Press, 1997.
2. Amadio, R., Translating Core Facile, ECRC Research Report 944-3, 1994.
3. Amadio, R., An asynchronousmodel of locality, failure, and processmobility. INRIA Report 3109, 1997.
4. Boreale, M., On the Expressiveness of Internal Mobility in Name-Passing Calculi, CONCUR'96, LNCS 1119, pp.163-178, Springer-Verlag, 1996.
5. Boudol, G., The p-Calculus in Direct Style, POPL'98, pp.228-241,ACMPress, 1998.
6. Cardelli, L. and Gordon, A., TypedMobile Ambients, POPL'99, pp.79-92,ACM Press, 1999.
7. Chien, A., Concurrent Aggregates,MIT Press, 1993.
8. Ferreira,W., Hennessy,M. and Jeffrey, M., A Theory ofWeak Bisimulation for Core CML, ICFP, pp.201-212, ACM Press, 1996.
9. The full version appeared in J. Func. Pro., 8(5):447-491,1998.
10. Giacalone, A., Mistra, P. and Prasad, S., Operational and Algebraic Semantics for Facile, ICALP'90, LNCS 443, pp.765-780,Springer-Verlag, 1990.
11. Fournet, C., Gonthier, G., Lévy, J.-J., Maranget, L., and Rémy, D., A Calculus for Mobile Agents, CONCUR' 96, LNCS 1119, pp.406-421, Springer-Verlag, 1996.
12. Sun Microsystems Inc., Java home page. http://www.javasoft.com/, 1995.
13. Hartonas, C. and Hennessy, M., Full Abstractness for a Functional/Concurrent Language With Higher-Order Value-Passing, Information and Computation, Vol. 145, pp.64-106, 1998.
14. Heintze, N. and Riecke, J., The SLam Calculus: Programming with Secrecy and Integrity, POPL'98, pp.365-377.ACM Press, 1998.
15. Hennessy, M. and Riely, J., Resource Access Control in Systems of Mobile Agents, CS Report 02/98, University of Sussex, http://www.cogs.susx.ac.uk, 1998.
16. Honda, K., Composing Processes, POPL'96, pp.344-357,ACM Press, 1996.
17. Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP'91, LNCS 512, pp.133-147, Springer-Verlag 1991.
18. Honda, K. and Yoshida, N., On Reduction-Based Process Semantics. TCS, pp.437-486, No.151, North-Holland, 1995.
19. Jeffrey, A. andWakeman, I., SafetyNet. Available from: http://klee.cs.depaul.edu/an/, 1998.
20. Leth, L. and Thomsen, B., Some Facile Chemistry, ERCC Technical Report, ERCC-92-14, 1992.
21. Merro, M. and Sangiorgi, D., On asynchrony in name-passing calculi, ICALP'98, LNCS 1443, pp.856-867, Springer-Verlag, 1998.
22. Milner, R., Parrow, J.G. andWalker, D.J., A Calculus of Mobile Processes. Information and Computation, 100(1), pp.1-77, 1992.
23. De Nicola, R., Ferrari, G. and Pugliese, R., Klaim: a Kernel Language for Agents Interaction and Mobility, IEEE Trans. on Software Engineering, Vol.24(5), 1998.
24. O'Hearn, P., Power, J., Takeyama, M., and Tennent, D., Syntactic Control of Interference Revised, MFPS'97, ENCS, Elsevier, 1997.
25. Pierce, B.C. and Sangiorgi. D, Typing and subtyping for mobile processes. MSCS, 6(5):409-454, 1996.
26. Pierce, B. and Turner, D., Pict: A Programming Language Based on the Pi-calculus, Indiana University, CSCI Technical Report, 476, March, 1997.
27. Riely, J. and Hennessy, M., Trust and Partial Typing in Open Systems of Mobile Agents, CS Technical Report, University of Sussex, 04/98, Available at: http://www.cogs.susx.ac.uk, 1998.
28. Sangiorgi, D., ExpressingMobility in Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, 1992.
29. Sangiorgi, D., The name discipline of uniform receptiveness, ICALP'97, LNCS 1256, pp.303-313, 1997.
30. Sekiguchi, T. and Yonezawa, A., A calculus with code mobility, IFIP, pp.21-36, Chapman & Hall, 1997.
31. Sewell, P., Global/Local Subtyping and Capability Inference for a Distributed p-calculus, ICALP'98, LNCS 1443, pp.695-706, Springer-Verlag, 1998.
32. Vasconcelos, V. and Honda, K., Principal Typing Scheme for Polyadic p-Calculus. CONCUR'93, LNCS 715, pp.524-538,Springer-Verlag, 1993.
33. Vitek, J. and Castagna, G., A Calculus of Secure Mobile Computations, Available at: http://cuiwww.unige.ch/~jvitek,1999.
34. Yoshida, N., Graph Types for Monadic Mobile Processes, FST/TCS'16, LNCS 1180, pp. 371-386, Springer-Verlag, 1996.
35. Full version as LFCS Technical Report, ECS-LFCS-96-350, 1996.
36. Yoshida, N., Minimality and Separation Results on Asynchronous Mobile Processes: representability theorems by concurrent combinators. CONCUR'98, pp.131-146, LNCS 1466, Springer-Verlag, 1998.
37. Full version as CS Report 05/98, University of Sussex, Available at: http://www.cogs.susx.ac.uk, 1998.
38. The full version of this paper. CS Technical Report 01/99, University of Sussex, Available at: http://www.cogs.susx.ac.uk, 1999.