{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:13Z","timestamp":1760202673800,"version":"3.40.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108810"},{"type":"electronic","value":"9783319108827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10882-7_13","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T06:54:19Z","timestamp":1410418459000},"page":"206-223","source":"Crossref","is-referenced-by-count":2,"title":["Expressiveness via Intensionality and Concurrency"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Given-Wilson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"13_CR2","unstructured":"Abramsky, S.: The lazy lambda calculus. In: Research Topics in Functional Programming, pp. 65\u2013116. Addison-Wesley (1990)"},{"key":"13_CR3","unstructured":"Barendregt, H.P.: The Lambda Calculus. Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics. Elsevier Science Publishers B.V. (1985)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science\u00a07(1) (2011)","DOI":"10.2168\/LMCS-7(1:11)2011"},{"key":"13_CR5","first-page":"81","volume-title":"POPL 1990: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"G. Berry","year":"1990","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. In: POPL 1990: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 81\u201394. ACM, New York (1990)"},{"issue":"1-2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/inco.1999.2823","volume":"156","author":"N. Busi","year":"2000","unstructured":"Busi, N., Gorrieri, R., Zavattaro, G.: On the expressiveness of linda coordination primitives. Inf. Comput.\u00a0156(1-2), 90\u2013121 (2000)","journal-title":"Inf. Comput."},{"key":"13_CR7","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":"13_CR8","volume-title":"Combinatory Logic","author":"H.B. Curry","year":"1958","unstructured":"Curry, H.B., Feys, R.: Combinatory Logic, vol.\u00a0I. North-Holland, Amsterdam (1958)"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.tcs.2006.02.007","volume":"356","author":"R. Nicola De","year":"2006","unstructured":"De Nicola, R., Gorla, D., Pugliese, R.: On the expressive power of klaim-based calculi. Theor. Comput. Sci.\u00a0356(3), 387\u2013421 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0167-6423(91)90036-W","volume":"17","author":"M. Felleisen","year":"1991","unstructured":"Felleisen, M.: On the expressive power of programming languages. Science of Computer Programming\u00a017(1-3), 35\u201375 (1991)","journal-title":"Science of Computer Programming"},{"key":"13_CR11","unstructured":"Given-Wilson, T.: Concurrent Pattern Unification. PhD thesis, University of Technology, Sydney, Australia (2012)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Given-Wilson, T.: An Intensional Concurrent Faithful Encoding of Turing Machines. In: 7th Interaction and Concurrency Experience (ICE 2014), Berlin, Germany (June 2014)","DOI":"10.4204\/EPTCS.166.4"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-38493-6_5","volume-title":"Coordination Models and Languages","author":"T. Given-Wilson","year":"2013","unstructured":"Given-Wilson, T., Gorla, D.: Pattern matching and bisimulation. In: De Nicola, R., Julien, C. (eds.) COORDINATION 2013. LNCS, vol.\u00a07890, pp. 60\u201374. Springer, Heidelberg (2013)"},{"key":"13_CR14","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-15240-5_18","volume-title":"Theoretical Computer Science","author":"T. Given-Wilson","year":"2010","unstructured":"Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 244\u2013258. Springer, Heidelberg (2010)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Given-Wilson, T., Gorla, D., Jay, B.: A Concurrent Pattern Calculus. To appear in: Logical Methods in Computer Science (2014)","DOI":"10.2168\/LMCS-10(3:10)2014"},{"issue":"8","key":"13_CR16","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1016\/j.ic.2008.05.001","volume":"206","author":"D. Gorla","year":"2008","unstructured":"Gorla, D.: Comparing communication primitives via their relative expressive power. Information and Computation\u00a0206(8), 931\u2013952 (2008)","journal-title":"Information and Computation"},{"issue":"4","key":"13_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00446-010-0120-6","volume":"23","author":"D. Gorla","year":"2010","unstructured":"Gorla, D.: A taxonomy of process calculi for distribution and mobility. Distributed Computing\u00a023(4), 273\u2013299 (2010)","journal-title":"Distributed Computing"},{"issue":"9","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ic.2010.05.002","volume":"208","author":"D. Gorla","year":"2010","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Information and Computation\u00a0208(9), 1031\u20131053 (2010)","journal-title":"Information and Computation"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Jay, B.: Pattern Calculus: Computing with Functions and Data Structures. Springer (2009)","DOI":"10.1007\/978-3-540-89185-7"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"807","DOI":"10.2178\/jsl\/1309952521","volume":"76","author":"B. Jay","year":"2011","unstructured":"Jay, B., Given-Wilson, T.: A combinatory account of internal structure. Journal of Symbolic Logic\u00a076(3), 807\u2013826 (2011)","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0956796808007144","volume":"19","author":"B. Jay","year":"2009","unstructured":"Jay, B., Kesner, D.: First-class patterns. Journal of Functional Programming\u00a019(2), 191\u2013225 (2009)","journal-title":"Journal of Functional Programming"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-642-14162-1_37","volume-title":"Automata, Languages and Programming","author":"I. Lanese","year":"2010","unstructured":"Lanese, I., P\u00e9rez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness of polyadic and synchronous communication in higher-order process calculi. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 442\u2013453. Springer, Heidelberg (2010)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-11957-6_20","volume-title":"Programming Languages and Systems","author":"I. Lanese","year":"2010","unstructured":"Lanese, I., Vaz, C., Ferreira, C.: On the expressive power of primitives for compensation handling. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol.\u00a06012, pp. 366\u2013386. Springer, Heidelberg (2010)"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Milner, R.: Functions as processes. In: Proceedings of the Seventeenth International Colloquium on Automata, Languages and Programming, pp. 167\u2013180. Springer-Verlag New York, Inc., New York (1990)","DOI":"10.1007\/BFb0032030"},{"key":"13_CR25","unstructured":"Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press (June 1999)"},{"key":"13_CR26","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, part I\/II. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Nielsen, L., Yoshida, N., Honda, K.: Multiparty symmetric sum types. In: EXPRESS, pp. 121\u2013135 (2010)","DOI":"10.4204\/EPTCS.41.9"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous pi-calculus. CoRR, cs.PL\/9809008 (1998)","DOI":"10.1145\/263699.263731"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proc. of LICS, pp. 176\u2013185. IEEE Computer Society (1998)","DOI":"10.1109\/LICS.1998.705654"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Plotkin, G.: Full abstraction, totality and pcf. Math. Structures Comput. Sci.\u00a09 (1997)","DOI":"10.1017\/S0960129598002692"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J.: Musings on encodings and expressiveness. In: Proc. of EXPRESS\/SOS. EPTCS, vol.\u00a089, pp. 81\u201398 (2012)","DOI":"10.4204\/EPTCS.89.7"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10882-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T15:44:34Z","timestamp":1746373474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10882-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108810","9783319108827"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10882-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}