{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T02:17:52Z","timestamp":1772158672336,"version":"3.50.1"},"reference-count":56,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T00:00:00Z","timestamp":1415836800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2016,5]]},"abstract":"<jats:p>What does it mean that an encoding is fully abstract? What does it<jats:italic>not<\/jats:italic>mean? In this position paper, we want to help the reader to evaluate the real benefits of using such a notion when studying the expressiveness of programming languages. Several examples and counterexamples are given. In some cases, we work at a very abstract level; in other cases, we give concrete samples taken from the field of process calculi, where the theory of expressiveness has been mostly developed in the last years.<\/jats:p>","DOI":"10.1017\/s0960129514000279","type":"journal-article","created":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T23:39:59Z","timestamp":1415921999000},"page":"639-654","source":"Crossref","is-referenced-by-count":31,"title":["Full abstraction for expressiveness: history, myths and facts"],"prefix":"10.1017","volume":"26","author":[{"given":"DANIELE","family":"GORLA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"UWE","family":"NESTMANN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"S0960129514000279_ref7","first-page":"70","article-title":"On the expressive power of polyadic synchronisation in \u03c0-calculus","volume":"10","author":"Carbone","year":"2003","journal-title":"Nordic Journal of Computing"},{"key":"S0960129514000279_ref38","unstructured":"Paterson M. S. and Hewitt C. E. (1970) Comparative schematology. In: Conference on Concurrent Systems and Parallel Computation, ACM 119\u2013127."},{"key":"S0960129514000279_ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)00122-7"},{"key":"S0960129514000279_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"S0960129514000279_ref18","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"S0960129514000279_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.11.011"},{"key":"S0960129514000279_ref54","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57208-2_6"},{"key":"S0960129514000279_ref27","volume-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"S0960129514000279_ref35","doi-asserted-by":"crossref","unstructured":"Palamidessi C. , Saraswat V. A. , Valencia F. D. and Victor B. (2006) On the expressiveness of linearity vs persistence in the asychronous Pi-calculus. In: Proceedings of Logic in Computer Science (LICS), IEEE Computer Society 59\u201368.","DOI":"10.1109\/LICS.2006.39"},{"key":"S0960129514000279_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00230-3"},{"key":"S0960129514000279_ref53","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0039066"},{"key":"S0960129514000279_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46432-8_19"},{"key":"S0960129514000279_ref33","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2868"},{"key":"S0960129514000279_ref29","volume-title":"Communicating and Mobile Systems: The \u03c0-Calculus","author":"Milner","year":"1999"},{"key":"S0960129514000279_ref12","unstructured":"Fournet C. and Gonthier G. (1996) The reflexive chemical abstract machine and the join-calculus. In: Proceedings of Principles of Programming Languages (POPL), ACM 372\u2013385."},{"key":"S0960129514000279_ref9","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1004"},{"key":"S0960129514000279_ref22","doi-asserted-by":"crossref","unstructured":"Lipton R. J. (1975) Reduction: A new method of proving properties of systems of processes. In: Proceedings of Principles of Programming Languages (POPL), ACM 78\u201386.","DOI":"10.1145\/512976.512985"},{"key":"S0960129514000279_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00220-X"},{"key":"S0960129514000279_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68679-8_29"},{"key":"S0960129514000279_ref47","doi-asserted-by":"crossref","unstructured":"Riecke J. G. (1991) Fully abstract translations between functional languages. In: Proceedings of Principles of Programming Languages (POPL), ACM 245\u2013254.","DOI":"10.1145\/99583.99617"},{"key":"S0960129514000279_ref50","unstructured":"Shapiro E. Y. (1991) Separating concurrent languages with categories of language embeddings (extended abstract). In: Proceedings of Symposium on Theory of Computing (STOC), ACM 198\u2013208."},{"key":"S0960129514000279_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.009"},{"key":"S0960129514000279_ref45","doi-asserted-by":"publisher","DOI":"10.1145\/362349.362364"},{"key":"S0960129514000279_ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"S0960129514000279_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_18"},{"key":"S0960129514000279_ref34","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129503004043"},{"key":"S0960129514000279_ref20","volume-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"S0960129514000279_ref28","volume-title":"Logic and Algebra of Specification","author":"Milner","year":"1993"},{"key":"S0960129514000279_ref55","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61604-7_66"},{"key":"S0960129514000279_ref51","unstructured":"Steele G. L. and Sussman G. J. (1976) Lambda: The ultimate imperative. AI Lab Memo AIM-353, MIT AI Lab."},{"key":"S0960129514000279_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55719-9_114"},{"key":"S0960129514000279_ref46","first-page":"345","volume-title":"The Essence of ALGOL","author":"Reynolds","year":"1981"},{"key":"S0960129514000279_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00223-5"},{"key":"S0960129514000279_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/365230.365257"},{"key":"S0960129514000279_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.04.011"},{"key":"S0960129514000279_ref52","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.89.7"},{"key":"S0960129514000279_ref26","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004323"},{"key":"S0960129514000279_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.05.002"},{"key":"S0960129514000279_ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(93)90004-9"},{"key":"S0960129514000279_ref37","doi-asserted-by":"crossref","unstructured":"Parrow J. (2014) General conditions for full abstraction. In this issue of Mathematical Structures in Computer Science.","DOI":"10.1017\/S0960129514000280"},{"key":"S0960129514000279_ref5","unstructured":"Boudol G. (1992) Asynchrony and the \u03c0-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis."},{"key":"S0960129514000279_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0057019"},{"key":"S0960129514000279_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/11817949_4"},{"key":"S0960129514000279_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28729-9_14"},{"key":"S0960129514000279_ref39","unstructured":"Perez J. A. (2009) Higher-Order Concurrency: Expressiveness and Decidability Results, Ph.D. thesis, University of Bologna."},{"key":"S0960129514000279_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(91)90036-W"},{"key":"S0960129514000279_ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.03.004"},{"key":"S0960129514000279_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(75)90032-6"},{"key":"S0960129514000279_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.05.001"},{"key":"S0960129514000279_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46432-8_16"},{"key":"S0960129514000279_ref48","unstructured":"Sangiorgi D. (1993) Expressing Mobility in Process Algebras: First-Order and Higher-Order Para-digms, Ph.D. thesis, Laboratory for Foundations of Computer Science, University of Edinburgh. CST-99-93 (also published as ECS-LFCS-93-266)."},{"key":"S0960129514000279_ref56","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62034-6_64"},{"key":"S0960129514000279_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.11.004"},{"key":"S0960129514000279_ref49","volume-title":"The \u03c0-Calculus: A Theory of Mobile Processes","author":"Sangiorgi","year":"2001"},{"key":"S0960129514000279_ref23","doi-asserted-by":"crossref","unstructured":"Lipton R. J. , Snyder L. and Zalcstein Y. (1974) A comparative study of models of parallel computation. In: 15th Annual Symposium on Switching and Automata Theory, IEEE 145\u2013155.","DOI":"10.1109\/SWAT.1974.2"},{"key":"S0960129514000279_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0120-6"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T05:26:27Z","timestamp":1566019587000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000279\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,13]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["S0960129514000279"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000279","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,13]]}}}