乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:18:29Z","timestamp":1648937909983},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T00:00:00Z","timestamp":1193443200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2007,11,20]]},"DOI":"10.1007\/s10990-007-9011-3","type":"journal-article","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T14:41:45Z","timestamp":1193409705000},"page":"295-318","source":"Crossref","is-referenced-by-count":0,"title":["The graphical Krivine machine"],"prefix":"10.1007","volume":"20","author":[{"given":"Sylvain","family":"Lippi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,27]]},"reference":[{"key":"9011_CR1","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"The Optimal Implementation of Functional Programming Languages","author":"A. Asperti","year":"1998","unstructured":"Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages, Cambridge Tracts in Theoretical Computer Science, vol.\u00a045. Cambridge University Press, Cambridge (1998)"},{"key":"9011_CR2","doi-asserted-by":"crossref","unstructured":"Danos, V., Regnier, L.: Reversible, irreversible and optimal \u03bb-machines. Theor. Comput. Sci. 227 (1999)","DOI":"10.1016\/S0304-3975(99)00049-3"},{"issue":"1","key":"9011_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50(1), 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"9011_CR4","doi-asserted-by":"crossref","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.-J.: The geometry of optimal lambda reduction. In: Proceedings of the 19th Annnual ACM Symposium on Principles of Programming Languages (POPL\u201992), pp.\u00a015\u201326. ACM Press (1992)","DOI":"10.1145\/143165.143172"},{"key":"9011_CR5","unstructured":"Krivine, J.-L.: Un interpr\u00e9teur pour le \u03bb-calcul. Technical Report, Notes de cours de DEA, Universit\u00e9 de Paris 7 (1985)"},{"key":"9011_CR6","unstructured":"Krivine, J.-L.: Lambda-Calculus, Types and Models. Ellis Horwood Series in Computers and Their Applications (1993). Transl. from the French by Rene Cori (English)"},{"key":"9011_CR7","doi-asserted-by":"crossref","unstructured":"Lafont, Y.: Interaction nets. In: Proceedings of the 17th Annnual ACM Symposium on Principles of Programming Languages, Orlando, FL, USA, pp.\u00a095\u2013108 (1990)","DOI":"10.1145\/96709.96718"},{"key":"9011_CR8","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Advances in Linear Logic","author":"Y. Lafont","year":"1995","unstructured":"Lafont, Y.: From proof-nets to interaction nets. In: Advances in Linear Logic. London Mathematical Society Lecture Note Series, vol.\u00a0222. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"9011_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/inco.1997.2643","volume":"137","author":"Y. Lafont","year":"1997","unstructured":"Lafont, Y.: Interaction combinators. Inf. Comput. 137(1), 69\u2013101 (1997)","journal-title":"Inf. Comput."},{"key":"9011_CR10","doi-asserted-by":"crossref","unstructured":"Lamping, J.: An algorithm for optimal lambda-calculus reduction. In: Proceedings of the 17th Annnual ACM Symposium on Principles of Programming Languages, Orlando, FL, USA (1990)","DOI":"10.1145\/96709.96711"},{"key":"9011_CR11","unstructured":"Lang, F.: Mod\u00e8les de la \u03b2-r\u00e9duction pour les implantations. Ph.D. Thesis, Ecole normale sup\u00e9rieure de Lyon (1998)"},{"key":"9011_CR12","doi-asserted-by":"crossref","unstructured":"Lippi, S.: Encoding left reduction in the lambda-calculus with interaction nets. Math. Struct. Comput. Sci. 12(6) (December 2002)","DOI":"10.1017\/S0960129502003754"},{"key":"9011_CR13","volume-title":"Proceedings of Rewriting Techniques and Applications (RTA \u201902)","author":"S. Lippi","year":"2002","unstructured":"Lippi, S.: $\\textsf{in}^{2}$ : a graphical interpreter for the interaction nets. In: Proceedings of Rewriting Techniques and Applications (RTA \u201902). Springer, New York (2002)"},{"key":"9011_CR14","unstructured":"Lippi, S.: Th\u00e9orie et pratique des r\u00e9seaux d\u2019interaction. Ph.D. Thesis, Universit\u00e9 de la m\u00e9diterran\u00e9e (2002)"},{"key":"9011_CR15","unstructured":"Mackie, I.: The geometry of implementation. Ph.D. Thesis, Department of Computing, Imperial College of Science, Technology and Medicine (1994)"},{"key":"9011_CR16","doi-asserted-by":"crossref","unstructured":"Mackie, I.: Yale: yet another lambda evaluator based on intetaction nets. In: Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming (ICFP\u201998). ACM Press (1998)","DOI":"10.1145\/289423.289434"},{"key":"9011_CR17","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/inco.2002.3163","volume":"176","author":"I. Mackie","year":"2002","unstructured":"Mackie, I., Sousa Pinto, J.: Encoding linear logic with interaction combinators. Inf. Comput. 176, 153\u2013186 (2002)","journal-title":"Inf. Comput."},{"key":"9011_CR18","unstructured":"Sousa Pinto, J.: Weak reduction and garbage collection in interaction nets. In: Gramlich, B., Lucas, S. (eds.) Proceedings of the 3rd Int\u2019l Workshop on Reduction Strategies in Rewriting and Programming (2003)"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9011-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-007-9011-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-007-9011-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:29:41Z","timestamp":1559352581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-007-9011-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,27]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,11,20]]}},"alternative-id":["9011"],"URL":"https:\/\/doi.org\/10.1007\/s10990-007-9011-3","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,27]]}}}