{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:40Z","timestamp":1759638880917,"version":"3.37.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319944593"},{"type":"electronic","value":"9783319944609"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-94460-9_14","type":"book-chapter","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T11:36:38Z","timestamp":1531136198000},"page":"235-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Nominal C-Unification"],"prefix":"10.1007","author":[{"given":"Mauricio","family":"Ayala-Rinc\u00f3n","sequence":"first","affiliation":[]},{"given":"Washington","family":"de Carvalho-Segundo","sequence":"additional","affiliation":[]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Nantes-Sobrinho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,10]]},"reference":[{"key":"14_CR1","unstructured":"Aoto, T., Kikuchi, K.: A rule-based procedure for equivariant nominal unification. In: Pre-proceeding of Higher-Order Rewriting (HOR), pp. 1\u20135 (2016)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-40229-1_12","volume-title":"Automated Reasoning","author":"T Aoto","year":"2016","unstructured":"Aoto, T., Kikuchi, K.: Nominal confluence tool. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 173\u2013182. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1_12"},{"key":"14_CR3","first-page":"21","volume":"332","author":"M Ayala-Rinc\u00f3n","year":"2017","unstructured":"Ayala-Rinc\u00f3n, M., Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: A formalisation of nominal equivalence with associative-commutative function symbols. ENTCS 332, 21\u201338 (2017)","journal-title":"ENTCS"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-66167-4_12","volume-title":"Frontiers of Combining Systems","author":"M Ayala-Rinc\u00f3n","year":"2017","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: On solving nominal fixpoint equations. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 209\u2013226. Springer, Cham (2017)"},{"key":"14_CR5","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Nominal narrowing. In: Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction (FSCD). LIPIcs, vol. 52, pp. 11:1\u201311:17 (2016)"},{"key":"14_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, 57\u201374 (2016)","journal-title":"ENTCS"},{"key":"14_CR7","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 UP, New York (1998)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-25379-9_14","volume-title":"Certified Programs and Proofs","author":"T Braibant","year":"2011","unstructured":"Braibant, T., Pous, D.: Tactics for reasoning modulo AC in Coq. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol. 7086, pp. 167\u2013182. Springer, Heidelberg (2011)"},{"key":"14_CR9","unstructured":"Calv\u00e8s, C.F.: Complexity and implementation of nominal algorithms. Ph.D Thesis, King\u2019s College London (2010)"},{"issue":"1","key":"14_CR10","first-page":"25","volume":"176","author":"CF Calv\u00e8s","year":"2007","unstructured":"Calv\u00e8s, C.F., Fern\u00e1ndez, M.: Implementing nominal unification. ENTCS 176(1), 25\u201337 (2007)","journal-title":"ENTCS"},{"key":"14_CR11","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)"},{"key":"14_CR12","unstructured":"Cheney, J.: $$\\alpha $$Prolog Users Guide & Language Reference Version 0.3 DRAFT (2003)"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10817-009-9164-3","volume":"45","author":"J Cheney","year":"2010","unstructured":"Cheney, J.: Equivariant unification. J. Autom. Reasoning 45(3), 267\u2013300 (2010)","journal-title":"J. Autom. Reasoning"},{"key":"14_CR14","first-page":"223","volume":"172","author":"RA Clouston","year":"2007","unstructured":"Clouston, R.A., Pitts, A.M.: Nominal equational logic. ENTCS 172, 223\u2013257 (2007)","journal-title":"ENTCS"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-25979-4_5","volume-title":"Rewriting Techniques and Applications","author":"E Contejean","year":"2004","unstructured":"Contejean, E.: A certified AC matching algorithm. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 70\u201384. Springer, Heidelberg (2004)"},{"issue":"6","key":"14_CR16","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.J.: Nominal rewriting. Inf. Comput. 205(6), 917\u2013965 (2007)","journal-title":"Inf. Comput."},{"key":"14_CR17","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 of the 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice (LFMTP). EPTCS, vol. 34, pp. 37\u201351 (2010)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, M., Gabbay, M.J., Mackie, I.: Nominal rewriting systems. In: Proceedings of the 6th International Conference on Principles and Practice of Declarative Programming (PPDP), pp. 108\u2013119. ACM Press (2004)","DOI":"10.1145\/1013963.1013978"},{"issue":"6","key":"14_CR19","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":"14_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"MJ Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects Comput. 13(3\u20135), 341\u2013363 (2002)","journal-title":"Formal Aspects Comput."},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/36330.36332","volume":"21","author":"D Kapur","year":"1987","unstructured":"Kapur, D., Narendran, P.: Matching unification and complexity. SIGSAM Bull. 21(4), 6\u20139 (1987)","journal-title":"SIGSAM Bull."},{"key":"14_CR22","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)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-319-63139-4_19","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Schmidt-Schau\u00df","year":"2017","unstructured":"Schmidt-Schau\u00df, M., Kutsia, T., Levy, J., Villaret, M.: Nominal unification of higher order expressions with recursive let. In: Hermenegildo, M.V., Lopez-Garcia, P. (eds.) LOPSTR 2016. LNCS, vol. 10184, pp. 328\u2013344. Springer, Cham (2017)"},{"key":"14_CR24","unstructured":"Levy, J., Villaret, M.: An efficient nominal unification algorithm. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA). LIPIcs, vol. 6, pp. 209\u2013226 (2010)"},{"issue":"2","key":"14_CR25","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0167-6423(89)90038-5","volume":"12","author":"T Nipkow","year":"1989","unstructured":"Nipkow, T.: Equational reasoning in Isabelle. Sci. Comput. Program. 12(2), 123\u2013149 (1989)","journal-title":"Sci. Comput. Program."},{"key":"14_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139084673","volume-title":"Nominal Sets: Names and Symmetry in Computer Science","author":"AM Pitts","year":"2013","unstructured":"Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science. Cambridge UP, Cambridge (2013)"},{"key":"14_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6804-6","volume-title":"The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions","author":"BE Sagan","year":"2001","unstructured":"Sagan, B.E.: The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions, 2nd edn. Springer, New York (2001)","edition":"2"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-09519-5_53","volume-title":"Symbolic and Algebraic Computation","author":"J Siekmann","year":"1979","unstructured":"Siekmann, J.: Unification of commutative terms. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 22\u201329. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_53"},{"key":"14_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.42.1","volume":"42","author":"Christian Urban","year":"2010","unstructured":"Urban, C.: Nominal unification revisited. In: Proceedings of the 24th International Workshop on Unification (UNIF). EPTCS, vol. 42, pp. 1\u201311 (2010)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"1\u20133","key":"14_CR30","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94460-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T10:22:55Z","timestamp":1571566975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94460-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944593","9783319944609"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94460-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}