{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T15:22:38Z","timestamp":1725722558423},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_18","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T09:14:02Z","timestamp":1314263642000},"page":"265-279","source":"Crossref","is-referenced-by-count":9,"title":["Typed \u03c8-calculi"],"prefix":"10.1007","author":[{"given":"Hans","family":"H\u00fcttel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"18_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/324133.324266","volume":"46","author":"M. Abadi","year":"1999","unstructured":"Abadi, M.: Secrecy by typing in security protocols. J. ACM\u00a046(5), 749\u2013786 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0304-3975(02)00863-0","volume":"298","author":"M. Abadi","year":"2003","unstructured":"Abadi, M., Blanchet, B.: Secrecy types for asymmetric communication. Theor. Comput. Sci.\u00a0298(3), 387\u2013415 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR3","first-page":"36","volume-title":"Proc. CCS 1997","author":"M. Abadi","year":"1997","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the spi calculus. In: Proc. CCS 1997, pp. 36\u201347. ACM, New York (1997)"},{"key":"18_CR4","first-page":"39","volume-title":"Proc. of LICS 2009","author":"J. Bengtson","year":"2009","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: Mobile Processes, Nominal Data, and Logic. In: Proc. of LICS 2009, pp. 39\u201348. IEEE, Los Alamitos (2009)"},{"issue":"2","key":"18_CR5","first-page":"70","volume":"10","author":"M. Carbone","year":"2003","unstructured":"Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in \u03c0-calculus. Nordic Journal of Computing\u00a010(2), 70\u201398 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"18_CR6","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, p. 140. Springer, Heidelberg (1998)"},{"issue":"7","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ic.2006.03.002","volume":"204","author":"Y. Deng","year":"2006","unstructured":"Deng, Y., Sangiorgi, D.: Ensuring termination by typability. Inf. Comput.\u00a0204(7), 1045\u20131082 (2006)","journal-title":"Inf. Comput."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-00945-7_8","volume-title":"Trustworthy Global Computing","author":"E. Elsborg","year":"2009","unstructured":"Elsborg, E., Hildebrandt, T., Sangiorgi, D.: Type systems for bigraphs. In: Kaklamanis, C., Nielson, F. (eds.) TGC 2008. LNCS, vol.\u00a05474, pp. 126\u2013140. Springer, Heidelberg (2009)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization policies. ACM Trans. Program. Lang. Syst.\u00a029(5) (2007)","DOI":"10.1145\/1275497.1275500"},{"issue":"6","key":"18_CR10","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1093\/logcom\/exp033","volume":"19","author":"M.J. Gabbay","year":"2009","unstructured":"Gabbay, M.J., Mathijssen, A.: Nominal (universal) algebra: Equational logic with names and binding. J. Log. Comput.\u00a019(6), 1455\u20131508 (2009)","journal-title":"J. Log. Comput."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"451","DOI":"10.3233\/JCS-2003-11402","volume":"11","author":"A.D. Gordon","year":"2003","unstructured":"Gordon, A.D., Jeffrey, A.: Authenticity by typing for security protocols. J. Comput. Secur.\u00a011(4), 451\u2013519 (2003)","journal-title":"J. Comput. Secur."},{"key":"18_CR12","first-page":"344","volume-title":"Proc. of POPL 1996","author":"K. Honda","year":"1996","unstructured":"Honda, K.: Composing processes. In: Proc. of POPL 1996, pp. 344\u2013357. ACM, New York (1996)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the Pi-calculus. Theor. Comput. Sci.\u00a0(11), 121\u2013163 (2004)","DOI":"10.1016\/S0304-3975(03)00325-6"},{"issue":"5","key":"18_CR14","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N. Kobayashi","year":"1999","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst.\u00a021(5), 914\u2013947 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Kobayashi, N., Sangiorgi, D.: A hybrid type system for lock-freedom of mobile processes. ACM Trans. Program. Lang. Syst.\u00a032(5) (2010)","DOI":"10.1145\/1745312.1745313"},{"key":"18_CR16","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":"18_CR17","first-page":"203","volume-title":"The polyadic pi-calculus: a tutorial","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic pi-calculus: a tutorial, pp. 203\u2013246. Springer, Heidelberg (1993)"},{"key":"18_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626661","volume-title":"The Space and Motion of Communicating Agents","author":"R. Milner","year":"2009","unstructured":"Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press, Cambridge (2009)"},{"issue":"5","key":"18_CR19","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B.C. Pierce","year":"1996","unstructured":"Pierce, B.C., Sangiorgi, D.: Typing and subtyping for mobile processes. Mathematical Structures in Computer Science\u00a06(5), 409\u2013453 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"18_CR20","first-page":"378","volume-title":"Proceedings of POPL 1998","author":"J. Riely","year":"1998","unstructured":"Riely, J., Hennessy, M.: A typed language for distributed mobile processes. In: Proceedings of POPL 1998, pp. 378\u2013390. ACM, New York (1998)"},{"issue":"3-4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/B:JARS.0000021016.61054.3b","volume":"31","author":"J. Riely","year":"2003","unstructured":"Riely, J., Hennessy, M.: Trust and partial typing in open systems of mobile agents. J. Autom. Reasoning\u00a031(3-4), 335\u2013370 (2003)","journal-title":"J. Autom. Reasoning"},{"issue":"1-2","key":"18_CR22","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0304-3975(99)00040-7","volume":"221","author":"D. Sangiorgi","year":"1999","unstructured":"Sangiorgi, D.: The name discipline of uniform receptiveness. Theor. Comput. Sci.\u00a0221(1-2), 457\u2013493 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR23","volume-title":"The \u03c0-Calculus - A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-Calculus - A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"18_CR24","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.tcs.2005.03.017","volume":"340","author":"L. Wischik","year":"2005","unstructured":"Wischik, L., Gardner, P.: Explicit fusions. Theor. Comput. Sci.\u00a0340(3), 606\u2013630 (2005)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T07:45:08Z","timestamp":1560498308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}