{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:25:51Z","timestamp":1768163151321,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031849237","type":"print"},{"value":"9783031849244","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-84924-4_13","type":"book-chapter","created":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T12:00:48Z","timestamp":1742212848000},"page":"196-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Enhancing a\u00a0Hierarchical Graph Rewriting Language Based on\u00a0MELL Cut Elimination"],"prefix":"10.1007","author":[{"given":"Kento","family":"Takyu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3424-1844","authenticated-orcid":false,"given":"Kazunori","family":"Ueda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Accattoli, B.: Linear logic and strong normalization. In: van Raamsdonk, F. (ed.) 24th International Conference on Rewriting Techniques and Applications (RTA 2013). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a021, pp. 39\u201354. Dagstuhl, Germany (2013). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2013.39","DOI":"10.4230\/LIPIcs.RTA.2013.39"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Alves, S., Fern\u00e1ndez, M., Mackie, I.: A new graphical calculus of proofs. In: Electronic Proceedings in Theoretical Computer Science, vol. 48 (2011). https:\/\/doi.org\/10.4204\/EPTCS.48.8","DOI":"10.4204\/EPTCS.48.8"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Ayano, T., Hori, T., Iwasawa, H., Ogawa, S., Ueda, K.: LMNtal model checking using an integrated development environment. Comput. Softw. 27(4), 4197\u20134214 (2010). https:\/\/doi.org\/10.11309\/jssst.27.4_197","DOI":"10.11309\/jssst.27.4_197"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. Theor. Comput. Sci. 96(1), 217\u2013248 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90185-I","DOI":"10.1016\/0304-3975(92)90185-I"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Brenas, J.H., Echahed, R., Strecker, M.: Verifying graph transformation systems with description logics. In: Lambers, L., Weber, J. (eds.) ICGT 2018. LNCS, vol. 10887, pp. 155\u2013170. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92991-0_10","DOI":"10.1007\/978-3-319-92991-0_10"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci. 240(1), 177\u2013213 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00231-5","DOI":"10.1016\/S0304-3975(99)00231-5"},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/9781316219317","volume-title":"Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning","author":"B Coecke","year":"2017","unstructured":"Coecke, B., Kissinger, A.: Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning. Cambridge University Press, Cambridge (2017)"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Corradini, A., Heindel, T., Hermann, F., K\u00f6nig, B.: Sesqui-pushout rewriting. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 30\u201345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841883_4","DOI":"10.1007\/11841883_4"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Arch. Math. Logic 28(3), 181\u2013203 (1989). https:\/\/doi.org\/10.1007\/bf01622878","DOI":"10.1007\/bf01622878"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Di\u00a0Cosmo, R., Kesner, D.: Strong normalization of explicit substitutions via cut elimination in proof nets. In: Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 35\u201346 (1997). https:\/\/doi.org\/10.1109\/LICS.1997.614927","DOI":"10.1109\/LICS.1997.614927"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Di Cosmo, R., Guerrini, S.: Strong normalization of proof nets modulo structural congruences. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 75\u201389. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48685-2_6","DOI":"10.1007\/3-540-48685-2_6"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Drewes, F., Hoffmann, B., Plump, D.: Hierarchical graph transformation. J. Comput. Syst. Sci. 64(2), 249\u2013283 (2002). https:\/\/doi.org\/10.1006\/jcss.2001.1790","DOI":"10.1006\/jcss.2001.1790"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Ene, N.C., Fern\u00e1ndez, M., Pinaud, B.: Attributed hierarchical port graphs and applications. Electron. Proc. Theor. Comput. Sci. EPTCS 265, 2\u201319 (2018). https:\/\/doi.org\/10.4204\/eptcs.265.2","DOI":"10.4204\/eptcs.265.2"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Fleury, A., Retor\u00e9, C.: The mix rule. Math. Struct. Comput. Sci. 4(2), 273\u2013285 (1994). https:\/\/doi.org\/10.1017\/S0960129500000451","DOI":"10.1017\/S0960129500000451"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Ghamarian, A., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using GROOVE. Int. J. Softw. Tools Technol. Transfer 14(1), 15\u201340 (2012). https:\/\/doi.org\/10.1007\/s10009-011-0186-x","DOI":"10.1007\/s10009-011-0186-x"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Girard, J.Y.: Linear logic. Theoret. Comput. Sci. 50(1), 1\u2013101 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Girard, J.Y.: Linear logic: a survey. In: Bauer, F., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. NATO ASI Series, vol.\u00a094, pp. 63\u2013112. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-642-58041-3_3","DOI":"10.1007\/978-3-642-58041-3_3"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Gocho, M., Hori, T., Ueda, K.: Evolution of the LMNtal runtime to a parallel model checker. Comput. Softw. 28(4), 137\u2013157 (2011). https:\/\/doi.org\/10.11309\/jssst.28.4_137","DOI":"10.11309\/jssst.28.4_137"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.J.: Linear logic without boxes. In: [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp. 223\u2013234 (1992). https:\/\/doi.org\/10.1109\/LICS.1992.185535","DOI":"10.1109\/LICS.1992.185535"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Guerrini, S.: Proof nets and the $$\\lambda $$-Calculus. In: Ehrhard, T., Girard, J.Y., Ruet, P., Scott, P. (eds.) Linear Logic in Computer Science, pp. 65\u2013118. London Mathematical Society Lecture Note Series, Cambridge University Press (2004). https:\/\/doi.org\/10.1017\/CBO9780511550850.003","DOI":"10.1017\/CBO9780511550850.003"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Inui, A., Kudo, S., Hara, K., Mizuno, K., Kato, N., Ueda, K.: LMNtal: the unifying programming language based on hierarchical graph rewriting. Comput. Softw. 25(1), 1124\u20131150 (2008). https:\/\/doi.org\/10.11309\/jssst.25.1_124","DOI":"10.11309\/jssst.25.1_124"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Kissinger, A., Merry, A., Soloviev, M.: Pattern graph rewrite systems. Electron. Proc. Theor. Comput. Sci. 143, 54\u201366 (2012). https:\/\/doi.org\/10.4204\/EPTCS.143.5","DOI":"10.4204\/EPTCS.143.5"},{"key":"13_CR23","unstructured":"Kudo, S., Kato, N., Ueda, K.: Design and implementation of operation constructs of graph structures in the LMNtal system. Inf. Technol. Lett. 4, 9\u201312 (2005). http:\/\/id.nii.ac.jp\/1001\/00147815\/"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Lafont, Y.: Interaction nets. In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 95\u2013108. POPL 1990, Association for Computing Machinery, New York, NY, USA (1989). https:\/\/doi.org\/10.1145\/96709.96718","DOI":"10.1145\/96709.96718"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 16\u201335. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_2","DOI":"10.1007\/3-540-44685-0_2"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Mishina, H., Ueda, K.: Introducing quantification into a hierarchical graph rewriting language. In: 34th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2024). LNCS, vol. 14919, pp. 220\u2013239. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71294-4_13","DOI":"10.1007\/978-3-031-71294-4_13"},{"key":"13_CR27","unstructured":"Muroya, K.: Hypernet semantics of programming languages. Ph.D. thesis, University of Birmingham (2020)"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Nguy\u00ean, L.T.D.: Unique perfect matchings, forbidden transitions and proof nets for linear logic with mix. Log. Methods Comput. Sci. 16 (2019). https:\/\/doi.org\/10.23638\/LMCS-16(1:27)2020","DOI":"10.23638\/LMCS-16(1:27)2020"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Overbeek, R., Endrullis, J., Rosset, A.: Graph rewriting and relabeling with PBPO$$^{+}$$. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2021. LNCS, vol. 12741, pp. 60\u201380. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78946-6_4","DOI":"10.1007\/978-3-030-78946-6_4"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Pagani, M., Falco, L.T.D.: Strong normalization property for second order linear logic. Theor. Comput. Sci. 411(2), 410\u2013444 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2009.07.053","DOI":"10.1016\/j.tcs.2009.07.053"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Pinaud, B., Melan\u00e7on, G., Dubois, J.: PORGY: a visual graph rewriting environment for complex systems. Comput. Graph. Forum 31(3), 1265\u20131274 (2012). https:\/\/doi.org\/10.1111\/j.1467-8659.2012.03119.x","DOI":"10.1111\/j.1467-8659.2012.03119.x"},{"key":"13_CR32","unstructured":"Takyu, K., Ueda, K.: Encoding MELL cut elimination into a hierarchical graph rewriting language. In: The 21st Asian Symposium on Programming Languages and Systems SRC & Posters (2023)"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Takyu, K., Ueda, K.: Enhancing a hierarchical graph rewriting language based on MELL cut elimination (2024). https:\/\/doi.org\/10.48550\/arXiv.2411.14802","DOI":"10.48550\/arXiv.2411.14802"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Torrini, P., Heckel, R.: Towards an embedding of graph transformation in intuitionistic linear logic. In: Electronic Proceedings in Theoretical Computer Science, vol.\u00a012, pp. 99\u2013115 (2009). https:\/\/doi.org\/10.4204\/EPTCS.12.7","DOI":"10.4204\/EPTCS.12.7"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Tranquilli, P.: Confluence of pure differential nets with promotion. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 500\u2013514. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04027-6_36","DOI":"10.1007\/978-3-642-04027-6_36"},{"key":"13_CR36","doi-asserted-by":"publisher","unstructured":"Ueda, K.: Encoding distributed process calculi into LMNtal. Electron. Notes Theor. Comput. Sci. 209, 187\u2013200 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2008.04.012","DOI":"10.1016\/j.entcs.2008.04.012"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Ueda, K.: LMNtal as a hierarchical logic programming language. Theoret. Comput. Sci. 410(46), 4784\u20134800 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.07.043","DOI":"10.1016\/j.tcs.2009.07.043"},{"key":"13_CR38","unstructured":"Ueda, K.: Gentle introduction to LMNtal: language design and implementation. In: Tutorial given at the 17th International Conference on Graph Transformation (ICGT 2024) (2024). https:\/\/conf.researchr.org\/details\/icgt-2024\/icgt-2024-research-papers\/17\/Gentle-Introduction-to-LMNtal-Language-Design-and-Implementation"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"Ueda, K., Kato, N.: LMNtal: a language model with links and membranes. In: Proceedings Fifth International Workshop on Membrane Computing (WMC 2004). LNCS, vol.\u00a03365, pp. 110\u2013125 (2005). https:\/\/doi.org\/10.1007\/978-3-540-31837-8_6","DOI":"10.1007\/978-3-540-31837-8_6"},{"key":"13_CR40","unstructured":"Vaux, L.: $$\\lambda $$-calcul diff\u00e9rentiel et logique classique : interactions calculatoires. Theses, Universit\u00e9 de la M\u00e9diterran\u00e9e - Aix-Marseille II (2007). https:\/\/theses.hal.science\/tel-00194149"},{"key":"13_CR41","unstructured":"Vaux, L.: Proof nets. In: Tutorial given at the 5th International Workshop on Trends in Linear Logic and Applications (TLLA 2021) (2021). https:\/\/lipn.univ-paris13.fr\/TLLA\/2021\/"},{"key":"13_CR42","doi-asserted-by":"publisher","unstructured":"Yasen, A., Ueda, K.: Revisiting graph types in HyperLMNtal: a modeling language for hypergraph rewriting. IEEE Access 9, 133449\u2013133460 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3112903","DOI":"10.1109\/ACCESS.2021.3112903"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-84924-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T12:00:56Z","timestamp":1742212856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-84924-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031849237","9783031849244"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-84924-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denver, CO","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}