{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:37:40Z","timestamp":1742963860517,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030684457"},{"type":"electronic","value":"9783030684464"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-68446-4_5","type":"book-chapter","created":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T19:06:39Z","timestamp":1613156799000},"page":"95-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nominal Unification with Letrec and Environment-Variables"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8809-7385","authenticated-orcid":false,"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5060-502X","authenticated-orcid":false,"given":"Yunus","family":"Kutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,13]]},"reference":[{"issue":"2\u20133","key":"5_CR1","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":"5_CR2","unstructured":"Cheney, J.: Nominal Logic Programming. Ph.D. thesis, Cornell University, Ithaca, NY, August 2004"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/S1471068417000035","volume":"17","author":"J Cheney","year":"2017","unstructured":"Cheney, J., Momigliano, A.: $$\\alpha $$-check: a mechanized metatheory model checker. Theory Pract. Logic Program. 17(3), 311\u2013352 (2017)","journal-title":"Theory Pract. Logic Program."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"A. Gasc\u00f3n, G. Godoy, and M. Schmidt-Schau\u00df. Unification and matching on compressed terms. ACM Trans. Comput. Log. 12(4):26:1\u201326:37, 2011","DOI":"10.1145\/1970398.1970402"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Hansen, M.R., Rischel, H.: Functional Programming Using F#. Cambridge (2013)","DOI":"10.1017\/CBO9781139093996"},{"key":"5_CR6","unstructured":"Haskell: Haskell, an advanced, purely functional programming language (2019)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-1-4471-3573-9_13","volume-title":"Functional Programming","author":"SP Jones","year":"1995","unstructured":"Jones, S.P., Santos, A.: Compilation by transformation in the Glasgow Haskell Compiler. In: Hammond, K., Turner, D.N., Sansom, P.M. (eds.) Functional Programming, pp. 184\u2013204. Springer, London (1995). https:\/\/doi.org\/10.1007\/978-1-4471-3573-9_13"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Kikuchi, K., Aoto., T.: Confluence and commutation for nominal rewriting systems with atom-variables. In: LOPSTR 2020 (2020, to appear)","DOI":"10.1007\/978-3-030-68446-4_3"},{"key":"5_CR9","unstructured":"Kutz, Y., Schmidt-Schau\u00df, M.: Rewriting with generalized nominal unification. Frank report 63, Institut f\u00fcr Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universit\u00e4t Frankfurt am Main (2019)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Kutz, Y., Schmidt-Schau\u00df, M.: Rewriting with generalized nominal unification. MSCS 30, 710\u2013735 (2020.) Special issue 6 (Special Issue: Unification)","DOI":"10.1017\/S0960129520000122"},{"key":"5_CR11","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)"},{"key":"5_CR12","unstructured":"Marlow, S. (ed.): Haskell 2010 - Language Report (2010)"},{"issue":"2","key":"5_CR13","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."},{"key":"5_CR14","volume-title":"Communicating And Mobile Systems - The Pi-Calculus","author":"R Milner","year":"1999","unstructured":"Milner, R.: Communicating And Mobile Systems - The Pi-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"5_CR15","unstructured":"Minsky, Y., Madhavapeddy, A., Hickey, J.: Real World OCaml. O\u2019Reilly (2013)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Pitts, A.: Nominal techniques. ACM SIGLOG News 3(1):57\u201372 (2016)","DOI":"10.1145\/2893582.2893594"},{"key":"5_CR17","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 University Press, New YorkD (2013)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-44685-0_20","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: on barbed equivalences in $$\\pi $$-calculus. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 292\u2013304. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_20"},{"key":"5_CR19","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). https:\/\/doi.org\/10.1007\/978-3-319-63139-4_19"},{"key":"5_CR20","unstructured":"Schmidt-Schau\u00df, M., Kutsia, T., Levy, J., Villaret, M., Kutz, Y.: Nominal unification of higher order expressions with recursive let. Frank report 62, Institut f\u00fcr Informatik. Fachbereich Informatik und Mathematik. J. W. Goethe-Universit\u00e4t Frankfurt am Main (2019)"},{"key":"5_CR21","unstructured":"Schmidt-Schau\u00df, M., Kutsia, T., Levy, J., Villaret, M., Kutz., Y.: Nominal unification of higher order expressions with recursive let (2019, in preparation)"},{"key":"5_CR22","unstructured":"Schmidt-Schau\u00df, 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":"5_CR23","unstructured":"Schmidt-Schau\u00df, M., Sabel, D.: Nominal unification with atom and context variables. In: Kirchner, H. (ed.) Proceedings of 3rd FSCD 2018, LIPIcs, vol. 108, pp. 28:1\u201328:20. Schloss Dagstuhl (2018)"},{"key":"5_CR24","unstructured":"Schmidt-Schau\u00df, M., Sabel, D., Kutz, Y.: Nominal unification with atom-variables. J. Symb. Comput. 90, 42\u201364 (2019)"},{"issue":"04","key":"5_CR25","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":"4","key":"5_CR26","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":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(2:14)2012","volume":"8","author":"C Urban","year":"2012","unstructured":"Urban, C., Kaliszyk, C.: General bindings and alpha-equivalence in nominal Isabelle. Log. Methods Comput. Sci. 8(2), 1\u201335 (2012)","journal-title":"Log. Methods Comput. Sci."},{"key":"5_CR28","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). https:\/\/doi.org\/10.1007\/978-3-540-45220-1_41"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68446-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T02:11:08Z","timestamp":1671243068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68446-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030684457","9783030684464"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68446-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 February 2021","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":"Bologna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nms.kcl.ac.uk\/maribel.fernandez\/LOPSTR2020\/","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":"31","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":"48% - 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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, two invited talks are included in the proceedings. Due to the COVID-19 pandemic the conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}