乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T05:31:15Z","timestamp":1733290275005,"version":"3.30.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":4702,"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":[[2000,9]]},"DOI":"10.1016\/s0304-3975(00)00198-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:37Z","timestamp":1027606897000},"page":"83-140","source":"Crossref","is-referenced-by-count":13,"title":["Interaction nets for linear logic"],"prefix":"10.1016","volume":"247","author":[{"given":"Ian","family":"Mackie","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0304-3975(00)00198-5_BIB1","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1017\/S0956796800001994","article-title":"The bologna optimal higher-order machine","volume":"6","author":"Asperti","year":"1996","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB2","series-title":"The Optimal Implementation of Functional Programming Languages","volume":"vol. 45","author":"Asperti","year":"1998"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB3","doi-asserted-by":"crossref","unstructured":"M. Fern\u00e1ndez, I. Mackie, Coinductive techniques for operational equivalence of interaction nets, Proc. 13th Ann. IEEE Symp. on Logic in Computer Science (LICS\u201998), IEEE Computer Society Press, Silver Spring, MD, June 1998, pp. 321\u2013332.","DOI":"10.1109\/LICS.1998.705668"},{"issue":"1","key":"10.1016\/S0304-3975(00)00198-5_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(97)00082-0","article-title":"Interaction nets and term rewriting systems","volume":"190","author":"Fern\u00e1ndez","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00198-5_BIB5","series-title":"Proc. Internat. Conf. on Principles and Practice of Declarative Programming (PPDP\u201999)","first-page":"170","article-title":"A calculus for interaction nets","volume":"vol. 1702","author":"Fern\u00e1ndez","year":"1999"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB6","series-title":"Theory and Formal Methods of Computing 94","first-page":"63","article-title":"Combinators for interaction nets","author":"Gay","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(00)00198-5_BIB7","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(00)00198-5_BIB8","series-title":"Logic Colloquium 88, Studies in Logic and the Foundations of Mathematics, vol. 127","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0049-237X(08)70271-4","article-title":"Geometry of interaction 1","author":"Girard","year":"1989"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB9","series-title":"Advances in Linear Logic, London Mathematical Society","first-page":"329","article-title":"Geometry of interaction III","volume":"vol. 222","author":"Girard","year":"1995"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB10","series-title":"Advances in Linear Logic, London Mathematical Society","first-page":"1","article-title":"Linear logic","volume":"vol. 222","author":"Girard","year":"1995"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB11","doi-asserted-by":"crossref","unstructured":"G. Gonthier, M. Abadi, J.-J. L\u00e9vy, The geometry of optimal lambda reduction, Proc. 19th ACM Symp. on Principles of Programming Languages (POPL\u201992), ACM Press, New York, January 1992, pp. 15\u201326.","DOI":"10.1145\/143165.143172"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB12","doi-asserted-by":"crossref","unstructured":"G. Gonthier, M. Abadi, J.-J. L\u00e9vy, Linear logic without boxes, Proc. 7th Ann. IEEE Symp. on Logic in Computer Science (LICS\u201992), IEEE Computer Society Press, Silverspring, MD, 1992, pp. 223\u2013234.","DOI":"10.1109\/LICS.1992.185535"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB13","doi-asserted-by":"crossref","unstructured":"Y. Lafont, Interaction nets, Proc. 17th ACM Symp. on Principles of Programming Languages (POPL\u201990), ACM Press, New York, January 1990, pp. 95\u2013108.","DOI":"10.1145\/96709.96718"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB14","series-title":"Advances in Linear Logic, London Mathematical Society","first-page":"225","article-title":"From proof nets to interaction nets","volume":"vol. 222","author":"Lafont","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(00)00198-5_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/inco.1997.2643","article-title":"Interaction combinators","volume":"137","author":"Lafont","year":"1997","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00198-5_BIB16","doi-asserted-by":"crossref","unstructured":"J. Lamping, An algorithm for optimal lambda calculus reduction, Proc. 17th ACM Symp. on Principles of Programming Languages (POPL\u201990), ACM Press, New York, January 1990, pp. 16\u201330.","DOI":"10.1145\/96709.96711"},{"key":"10.1016\/S0304-3975(00)00198-5_BIB17","unstructured":"J.-J. L\u00e9vy, R\u00e9ductions Correctes et Optimales dans le Lambda-Calcul, Th\u00e8se d\u2019\u00e9tat, Universit\u00e9 Paris VII, January 1978."},{"key":"10.1016\/S0304-3975(00)00198-5_BIB18","unstructured":"I. Mackie, The geometry of implementation, Ph.D. Thesis, Department of Computing, Imperial College of Science, Technology and Medicine, September 1994."},{"key":"10.1016\/S0304-3975(00)00198-5_BIB19","doi-asserted-by":"crossref","unstructured":"I. Mackie, YALE: yet another lambda evaluator based on interaction nets, Proc. 3rd ACM SIGPLAN Internat. Conf. on Functional Programming (ICFP\u201998), ACM Press, New York, September 1998, pp. 117\u2013128.","DOI":"10.1145\/289423.289434"},{"issue":"1","key":"10.1016\/S0304-3975(00)00198-5_BIB20","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree-manipulating systems and Church-Rosser theorems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001985?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001985?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T02:24:56Z","timestamp":1733279096000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397500001985"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00198-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}