{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:26Z","timestamp":1759639046620,"version":"3.41.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319631387"},{"type":"electronic","value":"9783319631394"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63139-4_19","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T03:22:55Z","timestamp":1500866575000},"page":"328-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Nominal Unification of Higher Order Expressions with Recursive Let"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Temur","family":"Kutsia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"19_CR1","unstructured":"Aoto, T., Kikuchi, K.: A rule-based procedure for equivariant nominal unification. In: Informal Proceedings HOR, p. 5 (2016)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: A call-by-need lambda calculus. In: POPL 1995, pp. 233\u2013246. ACM Press, San Francisco (1995)","DOI":"10.1145\/199448.199507"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Klop, J.W.: Cyclic lambda graph rewriting. In: Proceedings of IEEE LICS, pp. 416\u2013425. IEEE Press (1994)","DOI":"10.1109\/LICS.1994.316066"},{"key":"19_CR4","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: A formalisation of nominal alpha-equivalence with A and AC function symbols. In: Proceedings of LSFA 2016, pp. 78\u201393 (2016)"},{"key":"19_CR5","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Nominal narrowing. In: Pientka, B., Kesner, D. (eds.) Proceedings of First FSCD, pp. 11:1\u201311:17. LIPIcs (2016)"},{"issue":"3","key":"19_CR6","first-page":"57","volume":"323","author":"M Ayala-Rinc\u00f3n","year":"2016","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Rocha-Oliveira, A.C.: Completeness in PVS of a nominal unification algorithm. ENTCS 323(3), 57\u201374 (2016)","journal-title":"ENTCS"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/B978-044450813-3\/50010-2","volume-title":"Handbook of Automated Reasoning","author":"F Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445\u2013532. Elsevier, MIT Press, New York, Cambridge (2001)"},{"key":"19_CR8","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time (2016). http:\/\/arxiv.org\/abs\/1512.03547v2"},{"issue":"2\u20133","key":"19_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.tcs.2008.05.012","volume":"403","author":"C Calv\u00e8s","year":"2008","unstructured":"Calv\u00e8s, C., Fern\u00e1ndez, M.: A polynomial nominal unification algorithm. Theor. Comput. Sci. 403(2\u20133), 285\u2013306 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR10","unstructured":"Cheney, J.: Nominal Logic Programming. Ph.D. thesis, Cornell University, Ithaca (2004)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-32033-3_7","volume-title":"Term Rewriting and Applications","author":"J Cheney","year":"2005","unstructured":"Cheney, J.: Equivariant unification. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 74\u201389. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-32033-3_7"},{"key":"19_CR12","unstructured":"Cheney, J.: Relating higher-order pattern unification and nominal unification. In: Proceedings of 19th International Workshop on Unification (UNIF 2005), pp. 104\u2013119 (2005)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Cheney, J.: Toward a general theory of names: binding and scope. In: MERLIN 2005, pp. 33\u201340. ACM (2005)","DOI":"10.1145\/1088454.1088459"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Cheney, J.: Equivariant unification. J. Autom. Reasoning 45(3), 267\u2013300 (2010). http:\/\/dx.doi.org\/10.1007\/s10817-009-9164-3","DOI":"10.1007\/s10817-009-9164-3"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Furst, M.L., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: 21st FoCS, pp. 36\u201341. IEEE Computer Society (1980)","DOI":"10.1109\/SFCS.1980.34"},{"issue":"4","key":"19_CR16","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","volume":"13","author":"WD Goldfarb","year":"1981","unstructured":"Goldfarb, W.D.: The undecidability of the second-order unification problem. Theor. Comput. Sci. 13, 225\u2013230 (1981)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"GP Huet","year":"1975","unstructured":"Huet, G.P.: A unification algorithm for typed lambda-calculus. Theor. Comput. Sci. 1(1), 27\u201357 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR19","unstructured":"Jeannin, J.B., Kozen, D., Silva, A.: CoCaml: programming with coinductive types. Technical report Computing and Information Science, Cornell University, fundamenta Informaticae (2012). http:\/\/hdl.handle.net\/1813\/30798"},{"issue":"1\u20132","key":"19_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/inco.2000.2877","volume":"159","author":"J Levy","year":"2000","unstructured":"Levy, J., Veanes, M.: On the undecidability of second-order unification. Inf. Comput. 159(1\u20132), 125\u2013150 (2000)","journal-title":"Inf. Comput."},{"key":"19_CR21","unstructured":"Levy, J., Villaret, M.: An efficient nominal unification algorithm. In: Lynch, C. (ed.) Proceedings of 21st RTA, LIPIcs, vol. 6, pp. 209\u2013226. Schloss Dagstuhl (2010)"},{"issue":"2","key":"19_CR22","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/2159531.2159532","volume":"13","author":"J Levy","year":"2012","unstructured":"Levy, J., Villaret, M.: Nominal unification from a higher-order perspective. ACM Trans. Comput. Log. 13(2), 10 (2012)","journal-title":"ACM Trans. Comput. Log."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Permutation groups and polynomial-time computation. In: Finkelstein, L., Kantor, W.M. (eds.) Groups And Computation, Proceedings of a DIMACS Workshop (DIMACS), vol. 11, pp. 139\u2013176. DIMACS\/AMS (1991)","DOI":"10.1090\/dimacs\/011\/11"},{"key":"19_CR24","unstructured":"Marlow, S. (ed.): Haskell 2010 - Language Report (2010)"},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4(2), 258\u2013282 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"19_CR26","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Log. Comput. 1(4), 497\u2013536 (1991)","journal-title":"J. Log. Comput."},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-48919-3_8","volume-title":"Coordinatio Languages and Models","author":"A Moran","year":"1999","unstructured":"Moran, A., Sands, D., Carlsson, M.: Erratic fudgets: a semantic theory for an embedded coordination language. In: Ciancarini, P., Wolf, A.L. (eds.) COORDINATION 1999. LNCS, vol. 1594, pp. 85\u2013102. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48919-3_8"},{"issue":"2","key":"19_CR28","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0304-3975(94)90185-6","volume":"131","author":"C Picouleau","year":"1994","unstructured":"Picouleau, C.: Complexity of the Hamiltonian cycle in regular graph problem. Theor. Comput. Sci. 131(2), 463\u2013473 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR29","unstructured":"Schmidt-SchauSS, M., Rau, C., Sabel, D.: Algorithms for extended alpha-equivalence and complexity. In: van Raamsdonk, F. (ed.) 24th RTA 2013. LIPIcs, vol. 21, pp. 255\u2013270. Schloss Dagstuhl (2013)"},{"key":"19_CR30","unstructured":"Schmidt-Schau\u00df, M., Sabel, D.: Unification of program expressions with recursive bindings. In: Cheney, J., Vidal, G. (eds.) 18th PPDP, pp. 160\u2013173. ACM (2016). http:\/\/doi.acm.org\/10.1145\/2967973.2968603"},{"issue":"04","key":"19_CR31","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1017\/S0956796807006624","volume":"18","author":"M Schmidt-Schau\u00df","year":"2008","unstructured":"Schmidt-Schau\u00df, M., Sch\u00fctz, M., Sabel, D.: Safety of N\u00f6cker\u2019s strictness analysis. J. Funct. Program. 18(04), 503\u2013551 (2008)","journal-title":"J. Funct. Program."},{"issue":"3","key":"19_CR32","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","volume":"37","author":"U Sch\u00f6ning","year":"1988","unstructured":"Sch\u00f6ning, U.: Graph isomorphism is in the low hierarchy. J. Comput. Syst. Sci. 37(3), 312\u2013323 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11799573_25","volume-title":"Logic Programming","author":"L Simon","year":"2006","unstructured":"Simon, L., Mallya, A., Bansal, A., Gupta, G.: Coinductive logic programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 330\u2013345. Springer, Heidelberg (2006). doi: 10.1007\/11799573_25"},{"key":"19_CR34","unstructured":"Urban, C., Kaliszyk, C.: General bindings and alpha-equivalence in nominal Isabelle. Log. Methods Comput. Sci. 8(2:14), 1\u201335 (2012). www.lmcs-online.org"},{"key":"19_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-45220-1_41","volume-title":"Computer Science Logic","author":"C Urban","year":"2003","unstructured":"Urban, C., Pitts, A., Gabbay, M.: Nominal unification. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 513\u2013527. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45220-1_41"},{"issue":"1\u20133","key":"19_CR36","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.tcs.2004.06.016","volume":"323","author":"C Urban","year":"2004","unstructured":"Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theor. Comput. Sci. 323(1\u20133), 473\u2013497 (2004)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63139-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T17:28:45Z","timestamp":1750786125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63139-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631387","9783319631394"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63139-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"25 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cliplab.org\/Conferences\/LOPSTR16\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}