{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T12:07:13Z","timestamp":1762344433326,"version":"build-2065373602"},"reference-count":24,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.435.5","type":"journal-article","created":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:08:07Z","timestamp":1762016887000},"page":"59-70","source":"Crossref","is-referenced-by-count":0,"title":["Nominal Algebraic-Coalgebraic Data Types, with Applications to Infinitary Lambda-Calculi"],"prefix":"10.4204","volume":"435","author":[{"given":"R\u00e9my","family":"Cerda","sequence":"first","affiliation":[{"name":"Aix-Marseille Universit\u00e9, CNRS, I2M"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2720","published-online":{"date-parts":[[2025,11,4]]},"reference":[{"key":"AdamekAl18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jlamp.2017.11.003","article-title":"Fixed points of functors","volume":"95","author":"Ad\u00e1mek","year":"2018","journal-title":"Journal of Logical and Algebraic Methods in Programming"},{"key":"AdamekMiVe09","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-03741-2_5","article-title":"Semantics of Higher-Order Recursion Schemes","volume-title":"CALCO 2009: Algebra and Coalgebra in Computer Science","author":"Ad\u00e1mek","year":"2009"},{"issue":"1","key":"AppelAl07","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1190215.1190235","article-title":"A very modal model of a modern, major, general type system","volume":"42","author":"Appel","year":"2007","journal-title":"ACM SIGPLAN Notices"},{"key":"Arkor22","doi-asserted-by":"publisher","DOI":"10.17863\/CAM.86347","volume-title":"Monadic and Higher-Order Structure","author":"Arkor","year":"2022"},{"issue":"4","key":"ArnoldNivat80","doi-asserted-by":"publisher","first-page":"445","DOI":"10.3233\/fi-1980-3405","article-title":"The metric space of infinite trees. Algebraic and topological properties","volume":"3","author":"Arnold","year":"1980","journal-title":"Fundamenta Informaticae"},{"key":"Barendregt84","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-87508-2.50006-X","volume-title":"The Lambda Calculus. Its Syntax and Semantics","volume":"103","author":"Barendregt","year":"1984"},{"issue":"2","key":"Barr93","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","article-title":"Terminal coalgebras in well-founded set theory","volume":"114","author":"Barr","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"Berarducci96","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1201\/9780203748671-17","article-title":"Infinite \u03bb-calculus and non-sensible models","volume-title":"Logic and Algebra","author":"Berarducci","year":"1996"},{"key":"deBruijn72","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(72)90034-0","article-title":"Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with applications to the Church-Rosser Theorem","volume":"34","author":"de Bruijn","year":"1972","journal-title":"Indagationes Mathematic\u00e6"},{"volume-title":"Taylor Approximation for Infinitary \u03bb-Calculi","year":"2024","author":"Cerda","key":"Cerda24"},{"key":"FioreAl99","doi-asserted-by":"publisher","DOI":"10.1109\/lics.1999.782615","article-title":"Abstract syntax and variable binding","volume-title":"14th Symposium on Logic in Computer Science","author":"Fiore","year":"1999"},{"issue":"13","key":"GabbayPitts02","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","article-title":"A New Approach to Abstract Syntax with Variable Binding","author":"Gabbay","year":"2002","journal-title":"Formal Aspects of Computing"},{"key":"HirschowitzEtAl22","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-030-99253-8_20","article-title":"Variable binding and substitution for (nameless) dummies","volume-title":"FoSSaCS 2022: Foundations of Software Science and Computation Structures","author":"Hirschowitz","year":"2022"},{"issue":"1","key":"KennawayAl97","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","article-title":"Infinitary lambda calculus","volume":"175","author":"Kennaway","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"KurzPetrisanAl12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-32784-1_8","article-title":"An Alpha-Corecursion Principle for the Infinitary Lambda Calculus","volume-title":"CMCS 2012","author":"Kurz","year":"2012"},{"issue":"4","key":"KurzPetrisanAl13","doi-asserted-by":"publisher","DOI":"10.2168\/lmcs-9(4:20)2013","article-title":"Nominal Coalgebraic Data Types with Applications to Lambda Calculus","volume":"9","author":"Kurz","year":"2013","journal-title":"Logical Methods in Computer Science"},{"key":"Lambek68","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","article-title":"A Fixpoint Theorem for complete Categories","volume":"103","author":"Lambek","year":"1968","journal-title":"Mathematische Zeitschrift"},{"issue":"1","key":"LehmannSmyth81","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/bf01752392","article-title":"Algebraic specification of data types: A synthetic approach","volume":"14","author":"Lehmann","year":"1981","journal-title":"Mathematical Systems Theory"},{"key":"Moss01","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/s0304-3975(00)00126-2","article-title":"Parametric corecursion","volume":"260","author":"Moss","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"Nakano00","doi-asserted-by":"publisher","DOI":"10.1109\/lics.2000.855774","article-title":"A modality for recursion","volume-title":"Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science","author":"Nakano","year":"2000"},{"issue":"3","key":"Pitts06","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/1147954.1147961","article-title":"Alpha-structural recursion and induction","volume":"53","author":"Pitts","year":"2006","journal-title":"Journal of the ACM"},{"key":"Pitts13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139084673","volume-title":"Nominal Sets. Names and Symmetry in Computer Science","author":"Pitts","year":"2013"},{"key":"Plotkin90","first-page":"133","article-title":"An Illative Theory of Relations","volume-title":"Situation Theory and Its Applications","volume":"1","author":"Plotkin","year":"1990"},{"key":"Power07","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2007.02.024","article-title":"Abstract Syntax: Substitution and Binders","volume":"173","author":"Power","year":"2007","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T12:01:21Z","timestamp":1762344081000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2511.02595v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,4]]},"references-count":24,"URL":"https:\/\/doi.org\/10.4204\/eptcs.435.5","relation":{},"ISSN":["2075-2180"],"issn-type":[{"type":"electronic","value":"2075-2180"}],"subject":[],"published":{"date-parts":[[2025,11,4]]}}}