{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T22:50:41Z","timestamp":1672613441849},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(01)00162-1","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T19:22:41Z","timestamp":1043954561000},"page":"379-409","source":"Crossref","is-referenced-by-count":4,"title":["Coherence for sharing proof-nets"],"prefix":"10.1016","volume":"294","author":[{"given":"Stefano","family":"Guerrini","sequence":"first","affiliation":[]},{"given":"Simone","family":"Martini","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Masini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00162-1_BIB1","doi-asserted-by":"crossref","unstructured":"A. Asperti, \u03b4 \u2218 ! \u03b5 = 1: optimizing optimal \u03bb-calculus implementations, in: J. Hsiang (Ed.), Rewriting Techniques and Applications, 6th Internat. Conf. RTA-95, Lecture Notes in Computer Science, Vol. 914, Kaiserslautern, Germany, 1995, Springer, Berlin, pp. 102\u2013116.","DOI":"10.1007\/3-540-59200-8_51"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/FI-1995-22121","article-title":"Linear logic, comonads and optimal reductions","volume":"22","author":"Asperti","year":"1995","journal-title":"Funda. Inform."},{"key":"10.1016\/S0304-3975(01)00162-1_BIB3","doi-asserted-by":"crossref","unstructured":"A. Asperti, P. Coppola, S. Martini, (Optimal) Duplication is not elementary recursive, in: Proc. 27th ACM SIGPLAN-SIGACT on Principles of Programming Languages, POPL 2000, Boston, MA, January 2000, pp. 96\u2013107.","DOI":"10.1145\/325694.325707"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB4","doi-asserted-by":"crossref","unstructured":"A. Asperti, V. Danos, C. Laneve, L. Regnier, Paths in the lambda-calculus: three years of communications without understanding, in: Proc. of 9th Ann. Symp. on Logic in Computer Science, Paris, France, July 1994, pp. 426\u2013436.","DOI":"10.1109\/LICS.1994.316048"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB5","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1017\/S0960129500000566","article-title":"Interaction systems I","volume":"4","author":"Asperti","year":"1994","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(01)00162-1_BIB6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(95)00062-3","article-title":"Interaction systems II","volume":"159","author":"Asperti","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00162-1_BIB7","series-title":"Proc. 25th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL \u201998, San Diego, CA, 1998","first-page":"303","article-title":"Parallel beta reduction is not elementary recursive","author":"Asperti","year":"1998"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB8","doi-asserted-by":"crossref","unstructured":"G. Gonthier, M. Abadi, J.-J. L\u00e9vy, The geometry of optimal lambda reduction, in: Proc. 19th Ann. ACM Symp. on Principles of Programming Languages, Albequerque, NM, January 1992, pp. 15\u201326.","DOI":"10.1145\/143165.143172"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB9","doi-asserted-by":"crossref","unstructured":"G. Gonthier, M. Abadi, J.-J. L\u00e9vy, Linear logic without boxes, in: Proc. 7th Ann. Symp. on Logic in Computer Science, Santa Cruz, CA, June 1992, pp. 223\u2013234.","DOI":"10.1109\/LICS.1992.185535"},{"issue":"1","key":"10.1016\/S0304-3975(01)00162-1_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00162-1_BIB11","unstructured":"S. Guerrini, Theoretical and practical issues of optimal implementations of functional languages, Ph.D. Thesis, Dipartimento di Informatica, Pisa, 1996. TD-3\/96."},{"key":"10.1016\/S0304-3975(01)00162-1_BIB12","series-title":"The Tbilisi Symposium on Language, Logic, and Computation","article-title":"Sharing-graphs, sharing-morphisms and (optimal) \u03bb-graph reductions","author":"Guerrini","year":"1998"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(99)00050-X","article-title":"A general theory of sharing graphs","volume":"227","author":"Guerrini","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00162-1_BIB14","doi-asserted-by":"crossref","unstructured":"S. Guerrini, S. Martini, A. Masini, Coherence for sharing proof nets, in: H. Ganzinger (Ed.), Proc. 7th Internat. Conf. on Rewriting Techniques and Applications (RTA-96), Lecture Notes in Computer Science, Vol. 1103, New Brunswick, NJ, USA, 1996, Springer, Berlin, pp. 215\u2013229. Extended abstract.","DOI":"10.1007\/3-540-61464-8_54"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-3975(00)00094-3","article-title":"Proof nets, garbage, and computations","volume":"253","author":"Guerrini","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00162-1_BIB16","doi-asserted-by":"crossref","unstructured":"J. Lamping, An algorithm for optimal lambda calculus reduction, in: Proc. 17th Ann. ACM Symp. on Principles of Programming Languages, San Francisco, CA, January 1990, pp. 16\u201330.","DOI":"10.1145\/96709.96711"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB17","doi-asserted-by":"crossref","unstructured":"J.L. Lawall, H.G. Mairson, Optimality and inefficiency: What isn't a cost model of the lambda calculus? in: Proc. ACM SIGPLAN Internat. Conf. on Functional Programming, Philadelphia, PA, 1996, pp. 92\u2013101.","DOI":"10.1145\/232627.232639"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB18","unstructured":"J.-J. L\u00e9vy, R\u00e9ductions Correctes et Optimales dans le lambda-calcul, Ph.D. Thesis, Universit\u00e9 Paris VII, 1978."},{"key":"10.1016\/S0304-3975(01)00162-1_BIB19","series-title":"To H.B. Curry","first-page":"159","article-title":"Optimal reductions in the lambda-calculus","author":"L\u00e9vy","year":"1980"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB20","doi-asserted-by":"crossref","unstructured":"S. Martini, A. Masini, On the fine structure of the exponential rule, in: J.-Y. Girard, Y. Lafont, L. Regnier (Eds.), Advances in Linear Logic, Cambridge University Press, Cambridge, 1995, pp. 197\u2013210. Proc. of the Workshop on Linear Logic, Ithaca, New York, June 1993.","DOI":"10.1017\/CBO9780511629150.010"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB21","series-title":"Proof Theory of Modal Logics","first-page":"213","article-title":"A computational interpretation of modal proofs","author":"Martini","year":"1996"},{"key":"10.1016\/S0304-3975(01)00162-1_BIB22","volume":"Vol. II.","author":"Troelstra","year":"1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001621?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001621?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T23:47:57Z","timestamp":1583970477000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397501001621"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00162-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}