Graph types for monadic mobile processes

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

Volumn 1180, Issue , 1996, Pages 371-386

  Yoshida, Nobuko ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BIOMINERALIZATION; ENCODING (SYMBOLS); PATHOLOGY; SIGNAL ENCODING; SOFTWARE ENGINEERING;

COMMUNICATION STRUCTURES; DYNAMIC ASPECTS; ENCODINGS; FULL ABSTRACTION; MOBILE PROCESS; NAME PASSING CALCULI; OPERATIONAL STRUCTURE; PI CALCULUS;

CALCULATIONS;

EID: 84947920982     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62034-6_64     Document Type: Conference Paper

References (36)

1. Abramsky, S., Gay, S. and Nagarajan, R., Interaction Categories and Foundations of Typed Concurrent Computing. Deductive Program Design, Springer-Verlag, 1995.
2. Boudol, G., Asynchrony and n-calculus. INRIA Report 1702, INRIA, Sophia Antipolis, 1992.
3. Davey, B.A. and Priestley, H.A., Introduction to Lattices and Order, CUP, 1990.
4. Fournet, C. and Gonthier, G., The reflexive CHAM and the join-calculus, POPL'96, pp.372-385, ACM Press, 1996.
5. Gay, S., A Sort Inference Algorithm for the Polyadic ir-Calculus. POPL'93, ACM Press, 1993.
6. Gay, S. and Nagarajan, R-, A Typed Calculus of Synchronous Processes. LICS'95, IEEE, pp.210-220,1995.
7. Girard, J.-Y., Linear Logic, TCS, Vol. 50, pp.1-102, North-Holland, 1987.
8. Honda, K., Pre-types in mobile processes, a manuscript, 1992.
9. Honda, K., Types for Dyadic Interaction. CONCUR'93, LNCS 715, pp.509-523, Springer, 1993.
10. Honda, K., Composing Processes, POPL '96, pp.344-357, ACM Press, 1996.
11. Honda, K., Name-Passing Games (I): Semantics of Sortings, a typescript, July, 1996.
12. Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP'91, LNCS 512, pp.133-147, Springer-Verlag 1991.
13. Honda, K. and Yoshida, N., Combinatory Representation of Mobile Processes, POPL '94, pp.348-360, ACM Press, 1994.
14. Honda, K. and Yoshida, N., Replication in Concurrent Combinators, TACS'94, LNCS 789, pp.786-805, Springer, 1994.
15. Honda, K. and Yoshida, N., On Reduction-Based Process Semantics. TCS, pp.437-486, No.151, North-Holland, December, 1995.
16. Jones, C.B., Process-Algebraic Foundations for an Object-Based Design Notation. UMCS-93-10-1, Manchester University, 1993.
17. Kobayashi, N., Pierce, B., and Turner, D., Linear Types and n-calculus, POPL'96, pp.358-371, ACM Press, 1996.
18. Lafont, Y., Interaction Nets, POPL'90, pp. 95-108, ACM press, 1990.
19. Liu, X. and Walker, D., A polymorphic type system for the polyadic pi-calculus, CONCUR'95, LNCS 962, pp.103-116, Springer, 1995.
20. Milner, R., Functions as Processes. MSCS, 2(2), pp.119-146,1992.
21. Milner, R., Polyadic Calculus: a tutorial. Logic and Algebra of Specification, Springer, 1992.
22. Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes, Information and Computation 100(1), pp.1-77,1992.
23. Milner, R. and Sangiorgi, D., Barbed Bisimulation. Proc. of ICALP'90, LNCS 623, pp.685-695, Springer-Verlag, 1992.
24. Mitchell, J., Type Systems for Programming Languages. Handbook of Theoretical Computer Science B, pp.367-458, MIT Press, 1990.
25. Montanari, U. and Pistore, M., Concurrent Semantics for îr-calculus, MFCS'95 and ENTCS, Vol. 1. Elsevier, 1995.
26. Odersky, M., Polarized Name Passing. FSTTCS'IS, LNCS 1026, pp.324-335, Springer, 1995.
27. Pierce, B.C., Linearized Types for the ir-calculus, β type script, December, 1994.
28. Pierce, B.C. and Sangiorgi. D, Typing and subtyping for mobile processes. LICS'93, pp.187-215, IEEE, 1993.
29. Raja, N. and Shyamasundar, R.K., Combinatory Formulations of Concurrent Languages, pp. 156170, ACSC'95, LNCS 1023, Springer-Verlag, 1995.
30. Sangiorgi, D., Expressing Mobility t'n Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, 1992.
31. Prasad, S., Towards a Formulae-as-Types View of Communicating Applicative Processes, Technical report ECRC-94-32, ECRC, 1994.
32. Takeuchi, K., Honda, K. and Kubo, M., An Interaction-based Language and its Typing System. PARLE'94, LNCS 817, pp.398-413, Springer-Verlag, 1994.
33. Turner, D., The v-calculus: Types, polymorphism and implementation, Phd Thesis, University of Edinburgh, 1996.
34. Vasconcelos, V. and Honda, K., Principal Typing Scheme for Polyadic n-Calculus. CONCUR'93, LNCS 715, pp.524-538, Springer-Verlag, 1993.
35. Winskel, G., An Introduction to Event Structures. In Linear Time, Branching Time and Partial Order in Logies and Models for Concurrency, LNCS 354, pp. 364-397
36. Yoshida, N., Graph Types for Mobile Process Calculi I. The full version of this paper. CS technical report, Keio University, 1996. Available from ftp. dcs. ed. ac.nk/export/njr/pnb/graphl.ps. Z.