{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:36Z","timestamp":1725664776123},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:40:03Z","timestamp":1330274403000},"page":"215-229","source":"Crossref","is-referenced-by-count":4,"title":["Coherence for sharing proof nets"],"prefix":"10.1007","author":[{"given":"S.","family":"Guerrini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Martini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Masini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"17_CR1","first-page":"426","volume-title":"Paths in the lambda-calculus: three years of communications without understanding","author":"A. Asperti","year":"1994","unstructured":"Andrea Asperti, Vincent Danos, Cosimo Laneve, and Laurent Regnier. Paths in the lambda-calculus: three years of communications without understanding. In Proc. of 9th Symposium on Logic in Computer Science, pages 426\u2013436, Paris, France, July 1994. IEEE."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Andrea Asperti and Cosimo Laneve. Interaction systems. In Int. Workshop on Higher Order Algebra, Logic and Term Rewriting, 1993.","DOI":"10.1007\/3-540-58233-9_1"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/FI-1995-22121","volume":"22","author":"A. Asperti","year":"1995","unstructured":"Andrea Asperti. Linear logic, comonads and optimal reductions. Fundamenta infomaticae, 22:3\u201322, 1995.","journal-title":"Fundamenta infomaticae"},{"key":"17_CR4","first-page":"102","volume-title":"LNCS 914","author":"A. Asperti","year":"1995","unstructured":"Andrea Asperti. \u03b4o!\u03b5=1: Optimizing optimal \u03bb-calculus implementations. In Jieh Hsiang, editor, Rewriting Techniques and Applications, 6th International Conference, RTA-95, LNCS 914, pages 102\u2013116, Kaiserslautern, Germany, April 5\u20137, 1995. Springer-Verlag."},{"key":"17_CR5","volume-title":"POPL","author":"A. Asperti","year":"1996","unstructured":"Andrea Asperti. On the complexity of beta-reduction. In POPL, St. Petersburg Beach, Florida, 1996. nACM."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Georges Gonthier, Mart\u00edn Abadi, and Jean-Jacques L\u00e9vy. The geometry of optimal lambda reduction. In Proc. of Nineteenth Principles of Programming Languages (POPL), pages 15\u201326. ACM, January 1992.","DOI":"10.1145\/143165.143172"},{"key":"17_CR7","first-page":"223","volume-title":"Linear logic without boxes","author":"G. Gonthier","year":"1992","unstructured":"Georges Gonthier, Mart\u00edn Abadi, and Jean-Jacques L\u00e9vy. Linear logic without boxes. In Proc. of 7th Symposium on Logic in Computer Science, pages 223\u2013234, Santa Cruz, CA, June 1992. IEEE."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J. Girard","year":"1987","unstructured":"Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"17_CR9","unstructured":"Stefano Guerrini. Sharing-graphs, sharing-morphisms, and (optimal) \u03bb-graph reductions. In Z. Khasidashvili, editor, 1st Tbilisi Symposium on Logic, Language, and Computation, CSLI Lecture Notes (to appear). Tblisi, Georgia, October 1995."},{"key":"17_CR10","volume-title":"PhD thesis","author":"S. Guerrini","year":"1996","unstructured":"Stefano Guerrini. Theoretical and Practical Aspects of Optimal Implementations of Functional Languages. PhD thesis, Dottorato di Ricerca in Informatica, Pisa-Udine, January 1996."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"John Lamping. An algorithm for optimal lambda calculus reduction. In Principles of Programming Languages (POPL), pages 16\u201330. ACM, 1990.","DOI":"10.1145\/96709.96711"},{"key":"17_CR12","unstructured":"Jean-Jacques L\u00e9vy. R\u00e9ductions Correctes et Optimales dans le lambdacalcul. PhD Thesis, Universit\u00e9 Paris VII, 1978."},{"key":"17_CR13","unstructured":"Jean-Jacques L\u00e9vy. Optimal reductions in the lambda-calculus. In Jonathan P. Seldin and J. Roger Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 159\u2013191. Academic Press, 1980."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Julia L. Lawall and Harry G. Mairson. Optimality and inefficiency: What isn't a cost model of the lambda calculus? In 1996 ACM International Conference on Functional Programming, 1996.","DOI":"10.1145\/232627.232639"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Simone Martini and Andrea Masini. A computational interpretation of modal proofs. In H. Wansing, editor, Proof theory of Modal Logics. Kluwer, 1996. To appear.","DOI":"10.1007\/978-94-017-2798-3_12"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Simone Martini and Andrea Masini. On the fine structure of the exponential rule. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Note Series, pages 197\u2013210. Cambridge University Press, 1995. Proceedings the 1993 Cornell Linear Logic Workshop.","DOI":"10.1017\/CBO9780511629150.010"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:32:10Z","timestamp":1619559130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}