{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:30:06Z","timestamp":1742959806276,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031745577"},{"type":"electronic","value":"9783031745584"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74558-4_2","type":"book-chapter","created":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T04:34:57Z","timestamp":1736397297000},"page":"22-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Free Monads, Intrinsic Scoping, and\u00a0Higher-Order Preunification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-7292","authenticated-orcid":false,"given":"Nikolai","family":"Kudasov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,10]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-21691-6_5","volume-title":"Typed Lambda Calculi and Applications","author":"A Abel","year":"2011","unstructured":"Abel, A., Pientka, B.: Higher-order dynamic pattern unification for dependent types and records. In: Ong, L. (ed.) TLCA 2011. LNCS, vol. 6690, pp. 10\u201326. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21691-6_5"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Allais, G., Atkey, R., Chapman, J., McBride, C., McKinna, J.: A type and scope safe universe of syntaxes with binding: their semantics and proofs. Proc. ACM Program. Lang. 2(ICFP) (2018). https:\/\/doi.org\/10.1145\/3236785","DOI":"10.1145\/3236785"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-48168-0_32","volume-title":"Computer Science Logic","author":"T Altenkirch","year":"1999","unstructured":"Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodriguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 453\u2013468. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48168-0_32"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-39110-6_1","volume-title":"Trends in Functional Programming","author":"E Axelsson","year":"2016","unstructured":"Axelsson, E., Vezzosi, A.: Lightweight higher-order rewriting in Haskell. In: Serrano, M., Hage, J. (eds.) TFP 2015. LNCS, vol. 9547, pp. 1\u201321. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39110-6_1"},{"issue":"2\u20133","key":"2_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0167-6423(94)00022-0","volume":"23","author":"F Bellegarde","year":"1994","unstructured":"Bellegarde, F., Hook, J.: Substitution: a formal methods case study using monads and transformations. Sci. Comput. Program. 23(2\u20133), 287\u2013311 (1994). https:\/\/doi.org\/10.1016\/0167-6423(94)00022-0","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1017\/S0956796899003366","volume":"9","author":"RS Bird","year":"1999","unstructured":"Bird, R.S., Paterson, R.: De Bruijn notation as a nested datatype. J. Funct. Program. 9(1), 77\u201391 (1999). https:\/\/doi.org\/10.1017\/S0956796899003366","journal-title":"J. Funct. Program."},{"issue":"9","key":"2_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1411203.1411226","volume":"43","author":"A Chlipala","year":"2008","unstructured":"Chlipala, A.: Parametric higher-order abstract syntax for mechanized semantics. SIGPLAN Not. 43(9), 143\u2013156 (2008). https:\/\/doi.org\/10.1145\/1411203.1411226","journal-title":"SIGPLAN Not."},{"key":"2_CR8","unstructured":"Cockx, J.: 1001 Representations of Syntax with Binding (2021). https:\/\/jesper.sikanda.be\/posts\/1001-syntax-representations.html. Accessed 12 Jun 2024"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Coquand, T., Kinoshita, Y., Nordstrom, B., Takeyama, M.: A simple type-theoretic language: Mini-TT. From Semantics to Computer Science: Essays in Honour of Gilles Kahn (2009). https:\/\/doi.org\/10.1017\/CBO9780511770524.007","DOI":"10.1017\/CBO9780511770524.007"},{"issue":"5","key":"2_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"75","author":"N de Bruijn","year":"1972","unstructured":"de Bruijn, N.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae (Proceedings) 75(5), 381\u2013392 (1972). https:\/\/doi.org\/10.1016\/1385-7258(72)90034-0","journal-title":"Indagationes Mathematicae (Proceedings)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-642-15205-4_26","volume-title":"Computer Science Logic","author":"M Fiore","year":"2010","unstructured":"Fiore, M., Hur, C.-K.: Second-order equational logic (extended abstract). In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 320\u2013335. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15205-4_26"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Fiore, M., Szamozvancev, D.: Formal metatheory of second-order abstract syntax. Proc. ACM Program. Lang. 6(POPL) (2022). https:\/\/doi.org\/10.1145\/3498715","DOI":"10.1145\/3498715"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-59025-3_1","volume-title":"Functional and Logic Programming","author":"M Hamana","year":"2020","unstructured":"Hamana, M.: Theory and practice of second-order rewriting: foundation, evolution, and\u00a0SOL. In: Nakano, K., Sagonas, K. (eds.) FLOPS 2020. LNCS, vol. 12073, pp. 3\u20139. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59025-3_1"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G Huet","year":"1975","unstructured":"Huet, G.: A unification algorithm for typed $$\\lambda $$-calculus. Theoret. Comput. Sci. 1(1), 27\u201357 (1975). https:\/\/doi.org\/10.1016\/0304-3975(75)90011-0","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(76)90021-9","volume":"3","author":"DC Jensen","year":"1976","unstructured":"Jensen, D.C., Pietrzykowski, T.: Mechanizing $$\\omega $$-order type theory through unification. Theor. Comput. Sci. 3(2), 123\u2013171 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90021-9","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Kiselyov, O., Shan, C.c., Friedman, D.P., Sabry, A.: Backtracking, interleaving, and terminating monad transformers: (Functional Pearl). SIGPLAN Not. 40(9), 192\u2013203 (2005).https:\/\/doi.org\/10.1145\/1090189.1086390","DOI":"10.1145\/1090189.1086390"},{"key":"2_CR17","unstructured":"Kmett, E.: Bound (2015). https:\/\/www.schoolofhaskell.com\/user\/edwardk\/bound. Accessed 12 Jun 2024"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Kudasov, N.: E-unification for second-order abstract syntax. In: Gaboardi, M., van Raamsdonk, F. (eds.) 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0260, pp. 10:1\u201310:22. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2023.10","DOI":"10.4230\/LIPIcs.FSCD.2023.10"},{"key":"2_CR19","unstructured":"Kudasov, N.: Generalising huet-style projections in e-unification for second-order abstract syntax. In: UNIF 2023 - 37th International Workshop on Unification. Veena Ravishankar and Christophe Ringeissen, Rome, Italy (2023). https:\/\/inria.hal.science\/hal-04128229"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Liang, S., Hudak, P., Jones, M.: Monad transformers and modular interpreters. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL \u201995, New York, NY, USA, pp. 333\u2013343. Association for Computing Machinery (1995). https:\/\/doi.org\/10.1145\/199448.199528","DOI":"10.1145\/199448.199528"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Libal, T., Miller, D.: Functions-as-constructors higher-order unification. In: Kesner, D., Pientka, B. (eds.) 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a052, pp. 26:1\u201326:17. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2016.26","DOI":"10.4230\/LIPIcs.FSCD.2016.26"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"L\u00f6h, A., McBride, C., Swierstra, W.: A tutorial implementation of a dependently typed lambda calculus. Fundamenta Informaticae 102, 177\u2013207 (2010). https:\/\/doi.org\/10.3233\/FI-2010-304","DOI":"10.3233\/FI-2010-304"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Maclaurin, D., Radul, A., Paszke, A.: The foil: capture-avoiding substitution with no sharp edges. In: Proceedings of the 34th Symposium on Implementation and Application of Functional Languages. IFL \u201922, New York, NY, USA. Association for Computing Machinery (2023). https:\/\/doi.org\/10.1145\/3587216.3587224","DOI":"10.1145\/3587216.3587224"},{"key":"2_CR24","unstructured":"Martin-L\u00f6f, P.: Intuitionistic type theory, Studies in proof theory, vol.\u00a01. Bibliopolis (1984)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/11546382_3","volume-title":"Advanced Functional Programming","author":"C McBride","year":"2005","unstructured":"McBride, C.: Epigram: practical programming with dependent types. In: Vene, V., Uustalu, T. (eds.) AFP 2004. LNCS, vol. 3622, pp. 130\u2013170. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11546382_3"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0038698","volume-title":"Extensions of Logic Programming","author":"D Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. In: Schroeder-Heister, P. (ed.) ELP 1989. LNCS, vol. 475, pp. 253\u2013281. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0038698"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M Parigot","year":"1992","unstructured":"Parigot, M.: $$\\uplambda {\\upmu }$$-calculus: an algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 190\u2013201. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0013061"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Peyton\u00a0Jones, S., Marlow, S.: Secrets of the Glasgow Haskell Compiler inliner. J. Funct. Program. 12, 393\u2013434 (2002). https:\/\/www.microsoft.com\/en-us\/research\/publication\/secrets-of-the-glasgow-haskell-compiler-inliner\/","DOI":"10.1017\/S0956796802004331"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Wexelblat, R.L. (ed.) Proceedings of the ACM SIGPLAN\u201988 Conference on Programming Language Design and Implementation (PLDI), Atlanta, Georgia, USA, June 22\u201324, 1988, pp. 199\u2013208. ACM (1988). https:\/\/doi.org\/10.1145\/53990.54010","DOI":"10.1145\/53990.54010"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Riehl, E., Shulman, M.: A type theory for synthetic $$\\infty $$-categories. Higher Struct. 1 (2017). https:\/\/doi.org\/10.21136\/HS.2017.06","DOI":"10.21136\/HS.2017.06"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Sheard, T.: Generic unification via two-level types and parameterized modules - functional pearl. SIGPLAN Notices - SIGPLAN 36, 86\u201397 (2001). https:\/\/doi.org\/10.1145\/507546.507648","DOI":"10.1145\/507546.507648"},{"issue":"4","key":"2_CR32","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1017\/S0956796808006758","volume":"18","author":"W Swierstra","year":"2008","unstructured":"Swierstra, W.: Data types \u00e0 la carte. J. Funct. Program. 18(4), 423\u2013436 (2008). https:\/\/doi.org\/10.1017\/S0956796808006758","journal-title":"J. Funct. Program."},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Voigtl\u00e4nder, J.: Asymptotic improvement of computations over free monads, pp. 388\u2013403 (2008). https:\/\/doi.org\/10.1007\/978-3-540-70594-9_20","DOI":"10.1007\/978-3-540-70594-9_20"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Vukmirovic, P., Bentkamp, A., Nummelin, V.: Efficient full higher-order unification. Logical Meth. Comput. Sci. 17(4) (2021). https:\/\/doi.org\/10.46298\/lmcs-17(4:18)2021","DOI":"10.46298\/lmcs-17(4:18)2021"},{"issue":"1","key":"2_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1017\/S0956796807006557","volume":"18","author":"G Washburn","year":"2008","unstructured":"Washburn, G., Weirich, S.: Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism. J. Funct. Program. 18(1), 87\u2013140 (2008). https:\/\/doi.org\/10.1017\/S0956796807006557","journal-title":"J. Funct. Program."}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74558-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:03:30Z","timestamp":1736399010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74558-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031745577","9783031745584"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74558-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"10 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"South Orange, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}