{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:44:57Z","timestamp":1725565497383},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156397"},{"type":"electronic","value":"9783642156403"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15640-3_8","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T04:11:29Z","timestamp":1284523889000},"page":"103-119","source":"Crossref","is-referenced-by-count":4,"title":["Expressiveness of Generic Process Shape Types"],"prefix":"10.1007","author":[{"given":"Jan","family":"Jakub\u016fv","sequence":"first","affiliation":[]},{"given":"J. B.","family":"Wells","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-48523-6_20","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"1999","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.D.: Mobility types for mobile ambients. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 230\u2013239. Springer, Heidelberg (1999)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-44929-9_25","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.D.: Ambient groups and mobility types. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 333\u2013347. Springer, Heidelberg (2000)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Cardelli","year":"1998","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 140\u2013155. Springer, Heidelberg (1998)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Gordon, A.D.: Types for mobile ambients. In: POPL, pp. 79\u201392 (1999)","DOI":"10.1145\/292540.292550"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M.A.D. Gordon","year":"1999","unstructured":"Gordon, M.A.D.: A calculus for cryptographic protocols: The spi calculus. Inf. & Comp.\u00a0148(1), 1\u201370 (1999)","journal-title":"Inf. & Comp."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/3-540-57208-2_35","volume-title":"CONCUR\u201993","author":"K. Honda","year":"1993","unstructured":"Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 509\u2013523. Springer, Heidelberg (1993)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the pi-calculus. In: POPL, pp. 128\u2013141 (2001)","DOI":"10.1145\/360204.360215"},{"key":"8_CR8","unstructured":"Jakub\u016fv, J.: A Second Year Report. Heriot-Watt Univ., MACS (2009), http:\/\/www.macs.hw.ac.uk\/~jj36"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Jakub\u016fv, J., Wells, J.B.: The expressiveness of generic process shape types. Technical Report HW-MACS-TR-0069. Heriot-Watt Univ. (July 2009)","DOI":"10.1007\/978-3-642-15640-3_8"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","first-page":"352","volume-title":"CONCUR\u201999. Concurrency Theory","author":"B. K\u00f6nig","year":"1999","unstructured":"K\u00f6nig, B.: Generating type systems for process graphs. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 352\u2013367. Springer, Heidelberg (1999)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Makholm, H., Wells, J.B.: Instant polymorphic type systems for mobile process calculi: Just add reduction rules and close. Technical Report HW-MACS-TR-0022. Heriot-Watt Univ. (November 2004)","DOI":"10.1007\/978-3-540-31987-0_27"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-31987-0_27","volume-title":"Programming Languages and Systems","author":"H. Makholm","year":"2005","unstructured":"Makholm, H., Wells, J.B.: Instant polymorphic type systems for mobile process calculi: Just add reduction rules and close. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 389\u2013407. Springer, Heidelberg (2005)"},{"key":"8_CR13","volume-title":"Communicating and Mobile Systems: The \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: The \u03c0-Calculus. Cambridge Press, Cambridge (1999)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Inf. & Comp.\u00a0100(1), 1\u201377 (1992)","journal-title":"Inf. & Comp."},{"issue":"3","key":"8_CR15","first-page":"65","volume":"180","author":"F. Nielson","year":"2007","unstructured":"Nielson, F., Nielson, H.R., Priami, C., Rosa, D.: Control flow analysis for bioambients. ENTCS\u00a0180(3), 65\u201379 (2007)","journal-title":"ENTCS"},{"key":"8_CR16","unstructured":"Turner, D.N.: The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, Uni. of Edinburgh (1995) Rep. ECS-LFCS-96-345"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/3-540-45465-9_78","volume-title":"Automata, Languages and Programming","author":"J.B. Wells","year":"2002","unstructured":"Wells, J.B.: The essence of principal typings. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 913\u2013925. Springer, Heidelberg (2002)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-62034-6_64","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"N. Yoshida","year":"1996","unstructured":"Yoshida, N.: Graph types for monadic mobile processes. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 371\u2013386. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Trustworthly Global Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15640-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T19:38:15Z","timestamp":1559677095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15640-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156397","9783642156403"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15640-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}