{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:32:43Z","timestamp":1778297563016,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540620341","type":"print"},{"value":"9783540496311","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62034-6_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:32:22Z","timestamp":1330295542000},"page":"371-386","source":"Crossref","is-referenced-by-count":56,"title":["Graph types for monadic mobile processes"],"prefix":"10.1007","author":[{"given":"Nobuko","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Gay, S. and Nagarajan, R., Interaction Categories and Foundations of Typed Concurrent Computing. Deductive Program Design, Springer-Verlag, 1995.","DOI":"10.1007\/978-3-642-61455-2_10"},{"key":"32_CR2","volume-title":"INRIA Report 1702","author":"G. Boudol","year":"1992","unstructured":"Boudol, G., Asynchrony and \u03c0-calculus. INRIA Report 1702, INRIA, Sophia Antipolis, 1992."},{"key":"32_CR3","unstructured":"Davey, B.A. and Priestley, H.A., Introduction to Lattices and Order, CUP, 1990."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Fournet, C. and Gonthier, G., The reflexive CHAM and the join-calculus, POPL'96, pp.372\u2013385, ACM Press, 1996.","DOI":"10.1145\/237721.237805"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Gay, S., A Sort Inference Algorithm for the Polyadic \u03c0-Calculus. POPL'93, ACM Press, 1993.","DOI":"10.1145\/158511.158701"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Gay, S. and Nagarajan, R., A Typed Calculus of Synchronous Processes. LICS'95, IEEE, pp.210\u2013220, 1995.","DOI":"10.1109\/LICS.1995.523258"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y., Linear Logic, TCS, Vol. 50, pp.1\u2013102, North-Holland, 1987.","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"32_CR8","unstructured":"Honda, K., Pre-types in mobile processes, a manuscript, 1992."},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Honda, K., Types for Dyadic Interaction. CONCUR'93, LNCS 715, pp.509\u2013523, Springer, 1993.","DOI":"10.1007\/3-540-57208-2_35"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Honda, K., Composing Processes, POPL'96, pp.344\u2013357, ACM Press, 1996.","DOI":"10.1145\/237721.237802"},{"key":"32_CR11","unstructured":"Honda, K., Name-Passing Games (I): Semantics of Sortings, a type-script, July, 1996."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication. ECOOP'91, LNCS 512, pp.133\u2013147, Springer-Verlag 1991.","DOI":"10.1007\/BFb0057019"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Honda, K. and Yoshida, N., Combinatory Representation of Mobile Processes, POPL'94, pp.348\u2013360, ACM Press, 1994.","DOI":"10.1145\/174675.177953"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Honda, K. and Yoshida, N., Replication in Concurrent Combinators, TACS'94, LNCS 789, pp.786\u2013805, Springer, 1994.","DOI":"10.1007\/3-540-57887-0_125"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Honda, K. and Yoshida, N., On Reduction-Based Process Semantics. TCS, pp.437\u2013486, No.151, North-Holland, December, 1995.","DOI":"10.1016\/0304-3975(95)00074-7"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Jones, C.B., Process-Algebraic Foundations for an Object-Bated Design Notation. UMCS-93-10-1, Manchester University, 1993.","DOI":"10.1007\/3-540-57208-2_12"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Pierce, B., and Turner, D., Linear Types and \u03c0-calculus, POPL'96, pp.358\u2013371, ACM Press, 1996.","DOI":"10.1145\/237721.237804"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Lafont, Y., Interaction Nets, POPL'90, pp. 95\u2013108, ACM press, 1990.","DOI":"10.1145\/96709.96718"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Liu, X. and Walker, D., A polymorphic type system for the polyadic pi-calculus, CONCUR'95, LNCS 962, pp.103\u2013116, Springer, 1995.","DOI":"10.1007\/3-540-60218-6_8"},{"issue":"2","key":"32_CR20","first-page":"119","volume":"2","author":"R. Milner","year":"1992","unstructured":"Milner, R., Functions as Processes. MSCS, 2(2), pp.119\u2013146, 1992.","journal-title":"MSCS"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Milner, R., Polyadic \u03c0-Calculus: a tutorial. Logic and Algebra of Specification, Springer, 1992.","DOI":"10.1007\/978-3-642-58041-3_6"},{"issue":"1","key":"32_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes, Information and Computation 100(1), pp.1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Milner, R. and Sangiorgi, D., Barbed Bisimulation. Proc. of ICALP'92, LNCS 623, pp.685\u2013695, Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_114"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Mitchell, J., Type Systems for Programming Languages. Handbook of Theoretical Computer Science B, pp.367\u2013458, MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Montanari, U. and Pistore, M., Concurrent Semantics for \u03c0-calculus, MFCS'95 and ENTCS, Vol. 1. Elsevier, 1995.","DOI":"10.1016\/S1571-0661(04)00024-6"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Odersky, M., Polarized Name Passing. FSTTCS'15, LNCS 1026, pp.324\u2013335, Springer, 1995.","DOI":"10.1007\/3-540-60692-0_58"},{"key":"32_CR27","unstructured":"Pierce, B.C., Linearized Types for the \u03c0-calculus, a type script, December, 1994."},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"Pierce, B.C. and Sangiorgi. D, Typing and subtyping for mobile processes. LICS'93, pp.187\u2013215, IEEE, 1993.","DOI":"10.1109\/LICS.1993.287570"},{"key":"32_CR29","doi-asserted-by":"crossref","unstructured":"Raja, N. and Shyamasundar, R.K., Combinatory Formulations of Concurrent Languages, pp. 156\u2013170, ACSC'95, LNCS 1023, Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60688-2_42"},{"key":"32_CR30","unstructured":"Sangiorgi, D., Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms. Ph.D. Thesis, University of Edinburgh, 1992."},{"key":"32_CR31","unstructured":"Prasad, S., Towards a Formulae-as-Types View of Communicating Applicative Processes, Technical report ECRC-94-32, ECRC, 1994."},{"key":"32_CR32","doi-asserted-by":"crossref","unstructured":"Takeuchi, K., Honda, K. and Kubo, M., An Interaction-based Language and its Typing System. PARLE'94, LNCS 817, pp.398\u2013413, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58184-7_118"},{"key":"32_CR33","unstructured":"Turner, D., The \u03c0-calculus: Types, polymorphism and implementation, Phd Thesis, University of Edinburgh, 1996."},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Vasconcelos, V. and Honda, K., Principal Typing Scheme for Polyadic \u03c0-Calculus. CONCUR'93, LNCS 715, pp.524\u2013538, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57208-2_36"},{"key":"32_CR35","doi-asserted-by":"crossref","unstructured":"Winskel, G., An Introduction to Event Structures. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pp. 364\u2013397.","DOI":"10.1007\/BFb0013026"},{"key":"32_CR36","unstructured":"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.uk\/export\/ny\/pub\/graphi.ps.Z."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62034-6_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:08:52Z","timestamp":1640948932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62034-6_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620341","9783540496311"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-62034-6_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}