{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T21:21:01Z","timestamp":1790198461875,"version":"4.1.0"},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2014,11,17]],"date-time":"2014-11-17T00:00:00Z","timestamp":1416182400000},"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,9]]},"abstract":"<jats:p>We show that the techniques for resource control that have been developed by the so-called<jats:italic>light logics<\/jats:italic>can be fruitfully applied also to process algebras. In particular, we present a restriction of higher-order \u03c0-calculus inspired by soft linear logic. We prove that any soft process terminates in polynomial time. We argue that the class of soft processes may be naturally enlarged so that interesting processes are expressible, still maintaining the polynomial bound on executions.<\/jats:p>","DOI":"10.1017\/s0960129514000310","type":"journal-article","created":{"date-parts":[[2014,11,17]],"date-time":"2014-11-17T10:29:11Z","timestamp":1416220151000},"page":"969-992","source":"Crossref","is-referenced-by-count":5,"title":["Light logics and higher-order processes"],"prefix":"10.1017","volume":"26","author":[{"given":"UGO","family":"DAL LAGO","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"SIMONE","family":"MARTINI","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"DAVIDE","family":"SANGIORGI","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,11,17]]},"reference":[{"key":"S0960129514000310_ref18","doi-asserted-by":"crossref","unstructured":"Yoshida N. , Berger M. and Honda K. (2001) Strong normalisation in the pi-calculus. In: 16th Annual IEEE Symposium on Logic in Computer Science, Proceedings 311\u2013322.","DOI":"10.1109\/LICS.2001.932507"},{"key":"S0960129514000310_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"S0960129514000310_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11623-0_4"},{"key":"S0960129514000310_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_10"},{"key":"S0960129514000310_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74915-8_21"},{"key":"S0960129514000310_ref7","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-6(3:11)2010"},{"key":"S0960129514000310_ref2","first-page":"1","article-title":"Intuitionistic light affine logic","volume":"3","author":"Asperti","year":"2002","journal-title":"Transactions on Computational Logic"},{"key":"S0960129514000310_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15375-4_23"},{"key":"S0960129514000310_ref16","volume-title":"The \u03c0-Calculus: A Theory of Mobile Processes","author":"Sangiorgi","year":"2001"},{"key":"S0960129514000310_ref15","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0096"},{"key":"S0960129514000310_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.003"},{"key":"S0960129514000310_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92687-0_10"},{"key":"S0960129514000310_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S0960129514000310_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58027-1_24"},{"key":"S0960129514000310_ref11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2700"},{"key":"S0960129514000310_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.10.018"},{"key":"S0960129514000310_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_4"},{"key":"S0960129514000310_ref1","first-page":"21","volume-title":"Proceedings of the ACM on Principles and Practice of Declarative Programming (PPDP)","author":"Amadio","year":"2007"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T13:17:50Z","timestamp":1566047870000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000310\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,17]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["S0960129514000310"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000310","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,17]]}}}