{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:51:36Z","timestamp":1726080696708},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030452599"},{"type":"electronic","value":"9783030452605"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45260-5_8","type":"book-chapter","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T14:02:31Z","timestamp":1587477751000},"page":"123-138","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Certified Functional Nominal C-Unification Algorithm"],"prefix":"10.1007","author":[{"given":"Mauricio","family":"Ayala-Rinc\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel Ferreira","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Nantes-Sobrinho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"key":"8_CR1","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66167-4_12"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-94460-9_14","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Ayala-Rinc\u00f3n","year":"2018","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Nominal C-unification. In: Fioravanti, F., Gallagher, J.P. (eds.) LOPSTR 2017. LNCS, vol. 10855, pp. 235\u2013251. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94460-9_14"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2019.02.020","volume":"781","author":"M Ayala-Rinc\u00f3n","year":"2019","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D., Rocha-Oliveira, A.: A formalisation of nominal alpha-equivalence with A, C, and AC function symbols. Theoret. Comput. Sci. 781, 3\u201323 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR4","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Nominal narrowing. In: 1st International Conference on Formal Structures for Computation and Deduction (FSCD). LIPIcs, vol. 52, pp. 11:1\u201311:17 (2016)"},{"key":"8_CR5","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Fixed-point constraints for nominal equational unification. In: 3rd International Conference on Formal Structures for Computation and Deduction (FSCD). LIPIcs, vol. 108, pp. 7:1\u20137:16 (2018)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.entcs.2016.06.005","volume":"323","author":"M Ayala-Rinc\u00f3n","year":"2016","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Rocha-Oliveira, A.: Completeness in PVS of a nominal unification algorithm. Elect. Notes Theor. Comp. Sci. 323, 57\u201374 (2016)","journal-title":"Elect. Notes Theor. Comp. Sci."},{"key":"8_CR7","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1999","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1999)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Handbook of Automated Reasoning (in 2 volumes), pp. 445\u2013532. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"key":"8_CR9","unstructured":"Baumgartner, A., Kutsia, T., Levy, J., Villaret, M.: Nominal anti-unification. In: 26th International Conference on Rewriting Techniques and Applications (RTA). LIPIcs, vol. 36, pp. 57\u201373 (2015)"},{"issue":"2\u20133","key":"8_CR10","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. Theoret. Comput. Sci. 403(2\u20133), 285\u2013306 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR11","unstructured":"de Carvalho Segundo, W.L.R.: Nominal equational problems modulo associativity, commutativity and associativity-commutativity. Ph.D. thesis, Universidade de Brasilia (2019)"},{"key":"8_CR12","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27775-0_19"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0304-3975(93)90108-6","volume":"118","author":"H Comon","year":"1993","unstructured":"Comon, H.: Complete axiomatizations of some quotient term algebras. Theoret. Comput. Sci. 118(2), 167\u2013191 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"8_CR14","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)","journal-title":"Inf. Comput."},{"key":"8_CR15","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14052-5_6"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-70590-1_17","volume-title":"Rewriting Techniques and Applications","author":"J Levy","year":"2008","unstructured":"Levy, J., Villaret, M.: Nominal unification from a higher-order perspective. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 246\u2013260. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70590-1_17"},{"key":"8_CR17","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)"},{"key":"8_CR18","unstructured":"Owre, S., Shankar, N., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS System Guide - Version 2.4 (2001). \nhttp:\/\/pvs.csl.sri.com\/documentation.shtml"},{"key":"8_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139084673","volume-title":"Nominal Sets: Names and Symmetry in Computer Science","author":"A Pitts","year":"2013","unstructured":"Pitts, A.: Nominal Sets: Names and Symmetry in Computer Science. Cambridge University Press, Cambridge (2013)"},{"key":"8_CR20","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). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63139-4_19"},{"issue":"4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10817-008-9097-2","volume":"40","author":"C Urban","year":"2008","unstructured":"Urban, C.: Nominal techniques in Isabelle\/HOL. J. Autom. Reasoning 40(4), 327\u2013356 (2008)","journal-title":"J. Autom. Reasoning"},{"issue":"1\u20133","key":"8_CR22","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., Gabbay, M.: Nominal unification. Theoret. Comput. Sci. 323(1\u20133), 473\u2013497 (2004)","journal-title":"Theoret. 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-030-45260-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T14:03:26Z","timestamp":1587477806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45260-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452599","9783030452605"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45260-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 April 2020","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":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"8 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cs.unibo.it\/projects\/lopstr19\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}