Preview
Unable to display preview. Download preview PDF.
References
R. Amadio. Locality and failures II. To appear as a Technical Report, INRIA-Sophia Antipolis, 1997.
Fournet C. and Gonthier G. The Reflexive Chemical Abstract Machine and the Join calculus. In Proc. 23th POPL. ACM Press, 1996.
K. Honda. Types for dydadic interaction. In E. Best, editor, Proc. CONCUR '93, LNCS 715, pages 509–523. Springer Verlag, 1993.
K. Honda. Composing processes. In Proc. 23th POPL. ACM Press, 1996.
C.B. Jones. Constraining interference in an object-based design method. Proc. TAPSOFT'93, LNCS 668, pages 136–150. Springer Verlag, 1993.
N. Kobayashi. A partially deadlock-free typed process calculus. To appear as a technical report, Department of Information Science, University of Tokyo, 1997. A summary is to appear in Proc. 12th LICS Conf., 1997.
N. Kobayashi, B.C. Pierce, and D.N. Turner. Linearity and the pi-calculus. In Proc. 23th POPL. ACM Press, 1996.
R. Milner. Functions as processes. Research Report 1154, INRIA, Sophia Antipolis. Final version in J. Mathem. Struct. in Computer Science 2(2):119–141, 1992.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.
B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Journal of Mathematical Structures in Computer Science, 6(5):409–454, 1996.
B. Pierce and D. Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. In 24th POPL. ACM Press, 1997.
B. C. Pierce and D. N. Turner. Pict: A programming language based on the picalculus. In preparation, 1997.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, University of Edinburgh, 1992.
D. Sangiorgi. An interpretation of typed objects into typed π-calculus. Technical Report RR-3000, INRIA-Sophia Antipolis, 1996.
D. Sangiorgi. π-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science, 167(2):235–274, 1996.
D. Sangiorgi. Typed π-calculus at work: a proof of Jones's parallelisation transformation on concurrent objects. Presented at Fourth Workshop on Foundations of Object-Oriented Languages, 1997. Available as ftp://zenon.inria.fr/meije/theorie-par/davides/JonesTransform.ps.gz.
D. Sangiorgi. The name discipline of uniform receptiveness. (This is a slightly longer version of the present paper.) Available as ftp://zenon.inria.fr/meije/theorie-par/davides/RecePi.ps.Z.
B. Thomsen. Plain CHOCS, a second generation calculus for higher-order processes. Acta Informatica, 30:1–59, 1993.
Nobuko Yoshida. Graph types for monadic mobile processes. In Proc. FST & TCS, LNCS 1180, pages 371–386. Springer Verlag, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sangiorgi, D. (1997). The name discipline of uniform receptiveness (extended abstract). In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_187
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_187
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive