{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:33:29Z","timestamp":1754109209736,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250263"},{"type":"electronic","value":"9783030250270"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-25027-0_5","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:04:09Z","timestamp":1564617849000},"page":"64-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting"],"prefix":"10.1007","author":[{"given":"Jes\u00fas","family":"Dom\u00ednguez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, New York (1998)"},{"key":"5_CR2","unstructured":"Byrd, W., Friedman, D.: $$\\alpha $$-kanren: a fresh name in nominal logic programming. In: Proceedings of the 2007 Workshop on Scheme and Functional Programming, pp. 79\u201390. Universit\u00e9 Laval Technical Report DIUL-RT-0701 (2007)"},{"key":"5_CR3","unstructured":"Calv\u00e8s, C.: Unifying nominal unification. In: RTA-13. LIPIcs, vol. 21, pp. 143\u2013157 (2013). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2013\/4059"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-69937-8_11","volume-title":"Logic, Language, Information and Computation","author":"C Calv\u00e8s","year":"2008","unstructured":"Calv\u00e8s, C., Fern\u00e1ndez, M.: Nominal matching and alpha-equivalence. In: Hodges, W., de Queiroz, R. (eds.) WoLLIC 2008. LNCS (LNAI), vol. 5110, pp. 111\u2013122. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69937-8_11"},{"issue":"2\u20133","key":"5_CR5","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."},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.jcss.2009.10.003","volume":"76","author":"C Calv\u00e8s","year":"2009","unstructured":"Calv\u00e8s, C., Fern\u00e1ndez, M.: Matching and alpha-equivalence check for nominal terms. J. Comput. Syst. Sci. 76(5), 283\u2013301 (2009). Special issue: Selected papers from WOLLIC 2008","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-20551-4_15","volume-title":"Logic-Based Program Synthesis and Transformation","author":"C Calv\u00e8s","year":"2011","unstructured":"Calv\u00e8s, C., Fern\u00e1ndez, M.: The first-order nominal link. In: Alpuente, M. (ed.) LOPSTR 2010. LNCS, vol. 6564, pp. 234\u2013248. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20551-4_15"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-27775-0_19","volume-title":"Logic Programming","author":"J Cheney","year":"2004","unstructured":"Cheney, J., Urban, C.: $$\\alpha $$Prolog: a logic programming language with names, binding and $$\\alpha $$-equivalence. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 269\u2013283. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27775-0_19"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-27836-8_30","volume-title":"Automata, Languages and Programming","author":"J Cheney","year":"2004","unstructured":"Cheney, J.: The complexity of equivariant unification. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 332\u2013344. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_30"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Clouston, R.A., Pitts, A.M.: Nominal equational logic. In: Cardelli, L., Fiore, M., Winskel, G. (eds.) Computation, Meaning and Logic. Articles dedicated to Gordon Plotkin, ENTCS, vol. 1496. Elsevier (2007)","DOI":"10.1016\/j.entcs.2007.02.009"},{"issue":"6","key":"5_CR11","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1093\/jigpal\/jzq006","volume":"18","author":"Gilles Dowek","year":"2010","unstructured":"Dowek, G., Gabbay, M., Mulligan, D.: Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. In: IGPL 2010, vol. 18, no. 6, pp. 769\u2013822 (2010)","journal-title":"Logic Journal of the IGPL"},{"key":"5_CR12","unstructured":"Fairweather, E., Fern\u00e1ndez, M., Szasz, N., Tasistro, A.: Dependent types for nominal terms with atom substitutions. In: TLCA 2015. LIPIcs, vol. 38, pp. 180\u2013195 (2015). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2015\/5163"},{"issue":"6","key":"5_CR13","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.ic.2006.12.002","volume":"205","author":"M Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez, M., Gabbay, M.: Nominal rewriting. Inf. Comput. 205(6), 917\u2013965 (2007). https:\/\/doi.org\/10.1016\/j.ic.2006.12.002","journal-title":"Inf. Comput."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.4204\/EPTCS.34.5","volume":"34","author":"Maribel Fern\u00e1ndez","year":"2010","unstructured":"Fern\u00e1ndez, M., Gabbay, M.J.: Closed nominal rewriting and efficiently computable nominal algebra equality. In: Proceedings 5th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP 2010, Edinburgh, UK, 14 July 2010, pp. 37\u201351 (2010). https:\/\/doi.org\/10.4204\/EPTCS.34.5","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"4\u20135","key":"5_CR15","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00165-007-0056-1","volume":"20","author":"MJ Gabbay","year":"2008","unstructured":"Gabbay, M.J., Mathijssen, A.: Capture-avoiding substitution as a nominal algebra. Formal Aspects Comput. 20(4\u20135), 451\u2013479 (2008). https:\/\/doi.org\/10.1007\/s00165-007-0056-1","journal-title":"Formal Aspects Comput."},{"issue":"6","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1093\/logcom\/exp033","volume":"19","author":"MJ Gabbay","year":"2009","unstructured":"Gabbay, M.J., Mathijssen, A.: Nominal universal algebra: equational logic with names and binding. J. Logic Comput. 19(6), 1455\u20131508 (2009)","journal-title":"J. Logic Comput."},{"issue":"3\u20135","key":"5_CR17","first-page":"341","volume":"13","author":"MJ Gabbay","year":"2001","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects Comput. 13(3\u20135), 341\u2013363 (2001)","journal-title":"Formal Aspects Comput."},{"issue":"2","key":"5_CR18","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(2), 225\u2013230 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-14052-5_6","volume-title":"Interactive Theorem Proving","author":"R Kumar","year":"2010","unstructured":"Kumar, R., Norrish, M.: (Nominal) unification by recursive descent with triangular substitutions. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 51\u201366. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14052-5_6"},{"issue":"1\u20132","key":"5_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). https:\/\/doi.org\/10.1006\/inco.2000.2877","journal-title":"Inf. Comput."},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Levy, J., Villaret, M.: An efficient nominal unification algorithm. In: RTA 2010, pp. 209\u2013226 (2010). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2010.209","DOI":"10.4230\/LIPIcs.RTA.2010.209"},{"issue":"2","key":"5_CR22","first-page":"279","volume":"191","author":"YV Matiyasevich","year":"1970","unstructured":"Matiyasevich, Y.V.: Enumerable sets are Diophantine (in Russian). Soviet Math. Doklady 191(2), 279\u2013282 (1970)","journal-title":"Soviet Math. Doklady"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-89982-2_26","volume-title":"Logic Programming","author":"JP Near","year":"2008","unstructured":"Near, J.P., Byrd, W.E., Friedman, D.P.: $$\\alpha $$leanTAP: a declarative theorem prover for first-order classical logic. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 238\u2013252. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89982-2_26"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"AM Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165\u2013193 (2003). https:\/\/doi.org\/10.1016\/S0890-5401(03)00138-X","journal-title":"Inf. Comput."},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/10722010_15","volume-title":"Mathematics of Program Construction","author":"AM Pitts","year":"2000","unstructured":"Pitts, A.M., Gabbay, M.J.: A metalanguage for programming with bound names modulo renaming. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 230\u2013255. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722010_15"},{"issue":"9","key":"5_CR26","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/944746.944729","volume":"38","author":"Mark R. Shinwell","year":"2003","unstructured":"Shinwell, M.R., Pitts, A.M., Gabbay, M.J.: FreshML: programming with binders made simple. In: SIGPLAN 2003, vol. 38, no. 9, pp. 263\u2013274 (2003)","journal-title":"ACM SIGPLAN Notices"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Suzuki, T., Kikuchi, K., Aoto, T., Toyama, Y.: Confluence of orthogonal nominal rewriting systems revisited. In: Fern\u00e1ndez, M. (ed.) 26th International Conference on Rewriting Techniques and Applications, RTA 2015, Warsaw, Poland, 29 June to 1 July 2015. LIPIcs, vol. 36, pp. 301\u2013317. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2015.301","DOI":"10.4230\/LIPIcs.RTA.2015.301"},{"issue":"1\u20133","key":"5_CR28","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.: Nominal unification. Theor. Comput. Sci. 323(1\u20133), 473\u2013497 (2004)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25027-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:24:22Z","timestamp":1710336262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25027-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250263","9783030250270"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25027-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/di.ku.dk\/fct2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}