{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:34:34Z","timestamp":1768163674880,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705888","type":"print"},{"value":"9783540705901","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_27","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"392-408","source":"Crossref","is-referenced-by-count":8,"title":["Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting"],"prefix":"10.1007","author":[{"given":"Kazunori","family":"Ueda","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0956796800000186","volume":"1","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Cardelli, L., Curien, P.-L., L\u00e9vy, J.-J.: Explicit Substitutions. Journal of Functional Programming\u00a01(4), 375\u2013416 (1991)","journal-title":"Journal of Functional Programming"},{"issue":"1\u20132","key":"27_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0304-3975(97)00183-7","volume":"211","author":"R. Bloo","year":"1999","unstructured":"Bloo, R., Geuvers, H.: Explicit Substitution: on the Edge of Strong Normalization. Theoretical Computer Science\u00a0211(1\u20132), 375\u2013395 (1999)","journal-title":"Theoretical Computer Science"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/96709.96717","volume-title":"Proc. POPL 1990","author":"G. Berry","year":"1990","unstructured":"Berry, G., Boudol, G.: The Chemical Abstract Machine. In: Proc. POPL 1990, pp. 81\u201394. ACM, New York (1990)"},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/226643.226675","volume":"43","author":"P.-L. Curien","year":"1996","unstructured":"Curien, P.-L., Hardin, T., L\u00e9vy, J.-J.: Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. J. ACM\u00a043(2), 362\u2013397 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1017\/S0960129504004633","volume":"15","author":"M. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M., Mackie, I., Sinot, F.-R.: Closed Reduction: Explicit Substitutions without \u03b1-conversion. Mathematical Structures in Computer Science\u00a015(2), 343\u2013381 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/96709.96718","volume-title":"Proc. POPL 1990","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction Nets. In: Proc. POPL 1990, pp. 95\u2013108. ACM, New York (1990)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/96709.96711","volume-title":"Proc. POPL 1990","author":"J. Lamping","year":"1990","unstructured":"Lamping, J.: An Algorithm for Optimal Lambda-Calculus Reductions. In: Proc. POPL 1990, pp. 16\u201330. ACM, New York (1990)"},{"key":"27_CR8","unstructured":"Lang, F.: Mod\u00e8les de la \u03b2-r\u00e9duction pour les implantations. Ph.D. Thesis, \u00c8cole Normale Sup\u00e9rieure de Lyon (1998)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/289423.289434","volume-title":"Proc. ICFP 1998","author":"I. Mackie","year":"1998","unstructured":"Mackie, I.: YALE: Yet Another Lambda Evaluator Based on Interaction Nets. In: Proc. ICFP 1998, pp. 117\u2013128. ACM, New York (1998)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-540-25979-4_11","volume-title":"Rewriting Techniques and Applications","author":"I. Mackie","year":"2004","unstructured":"Mackie, I.: Efficient \u03bb-Evaluation with Interaction Nets. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 155\u2013169. Springer, Heidelberg (2004)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/BFb0014062","volume-title":"Typed Lambda Calculi and Applications","author":"P.-A. Melli\u00e8s","year":"1995","unstructured":"Melli\u00e8s, P.-A.: Typed \u03bb -Calculi with Explicit Substitutions May Not Terminate. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 328\u2013334. Springer, Heidelberg (1995)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/11417170_28","volume-title":"Typed Lambda Calculi and Applications","author":"F.-R. Sinot","year":"2005","unstructured":"Sinot, F.-R.: Call-by-Name and Call-by-Value as Token-Passing Interaction Nets. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 386\u2013400. Springer, Heidelberg (2005)"},{"key":"27_CR13","volume-title":"The Implementation of Functional Programming Languages","author":"S.L. Peyton Jones","year":"1987","unstructured":"Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/978-3-540-31837-8_6","volume-title":"Membrane Computing","author":"K. Ueda","year":"2005","unstructured":"Ueda, K., Kato, N.: LMNtal: a Language Model with Links and Membranes. In: Mauri, G., P\u0103un, G., Jes\u00fas P\u00e9rez-J\u00edmenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol.\u00a03365, pp. 110\u2013125. Springer, Heidelberg (2005)"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.entcs.2008.04.012","volume":"209","author":"K. Ueda","year":"2008","unstructured":"Ueda, K.: Encoding Distributed Process Calculi into LMNtal. Electronic Notes in Theoretical Computer Science\u00a0209, 187\u2013200 (2008)","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:23:54Z","timestamp":1620001434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}