{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:31:09Z","timestamp":1792787469788,"version":"4.5.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"ICFP","license":[{"start":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T00:00:00Z","timestamp":1786924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft","award":["527481841"],"award-info":[{"award-number":["527481841"]}],"id":[{"id":"https:\/\/ror.org\/018mejw64","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Deutsche Forschungsgemeinschaft","award":["569130867"],"award-info":[{"award-number":["569130867"]}],"id":[{"id":"https:\/\/ror.org\/018mejw64","id-type":"ROR","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2026,8,17]]},"abstract":"<jats:p>\n                    The bialgebraic\n                    <jats:italic toggle=\"yes\">abstract GSOS<\/jats:italic>\n                    framework by Turi and Plotkin provides an elegant categorical approach to modelling the operational and denotational semantics of programming and process languages. In abstract GSOS, bisimilarity is always a congruence, and it coincides with denotational equivalence. This saves the language designer from intricate, ad-hoc reasoning to establish these properties. The bialgebraic perspective on operational semantics in the style of abstract GSOS has recently been extended to higher-order languages, preserving compositionality of bisimilarity. However, a categorical understanding of bialgebraic\n                    <jats:italic toggle=\"yes\">denotational semantics<\/jats:italic>\n                    according to Turi and Plotkin\u2019s original vision has so far been missing in the higher-order setting. In the present paper, we develop a theory of adequate denotational semantics in higher-order abstract GSOS. The denotational models are parametric in an appropriately chosen semantic domain in the form of a\n                    <jats:italic toggle=\"yes\">locally final coalgebra<\/jats:italic>\n                    for a behaviour bifunctor, whose construction is fully decoupled from the syntax of the language. Our approach captures existing accounts of denotational semantics such as semantic domains built via general step-indexing, previously introduced on a per-language basis, and is shown to be applicable to a wide range of different higher-order languages, e.g. simply typed and untyped languages, or languages with computational effects such as probabilistic or non-deterministic branching.\n                  <\/jats:p>","DOI":"10.1145\/3828693","type":"journal-article","created":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T20:23:46Z","timestamp":1786998226000},"page":"611-639","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards a Higher-Order Bialgebraic Denotational Semantics"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6924-8766","authenticated-orcid":false,"given":"Sergey","family":"Goncharov","sequence":"first","affiliation":[{"name":"University of Birmingham, Birmingham, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0243-0480","authenticated-orcid":false,"given":"Marco","family":"Peressotti","sequence":"additional","affiliation":[{"name":"University of Southern Denmark, Odense, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8981-2328","authenticated-orcid":false,"given":"Stelios","family":"Tsampas","sequence":"additional","affiliation":[{"name":"University of Southern Denmark, Odense, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3265-7168","authenticated-orcid":false,"given":"Henning","family":"Urbat","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5277-1958","authenticated-orcid":false,"given":"Stefano","family":"Volpe","sequence":"additional","affiliation":[{"name":"University of Southern Denmark, Odense, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,17]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"65","volume-title":"The lazy lambda calculus","author":"Abramsky Samson","year":"1990","unstructured":"Samson Abramsky . 1990. The lazy lambda calculus. Addison-Wesley Longman Publishing Co., Inc., USA, 65\u2013116."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1017\/9781108884112"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/2060081"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(4:1)2012"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.07.010"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08918-8_8"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00035-3"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794275860"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78499-9_24"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS65433.2025.00022"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782615"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3632854"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3571215"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3747513"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.46298\/jfp.17738"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3661814.3662099"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3747540"},{"key":"e_1_3_1_21_2","article-title":"Towards a Higher-Order Bialgebraic Denotational Semantics","author":"Goncharov Sergey","year":"2026","unstructured":"Sergey Goncharov , Marco Peressotti , Stelios Tsampas , Henning Urbat , and Stefano Volpe . 2026. Towards a Higher-Order Bialgebraic Denotational Semantics. arXiv:2602.18295 [cs.PL] https:\/\/arxiv.org\/abs\/2602.18295","journal-title":"arXiv:2602.18295 [cs.PL]"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-57231-9_3"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3704871"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21593-8"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809835"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316823187"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700006353"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"e_1_3_1_29_2","unstructured":"Fabian Lenke Stefan Milius and Henning Urbat . 2026. A Unified Treatment of Substitution for Presheaves Nominal Sets Renaming Sets and so on. Accepted at the 41th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2026). arXiv:2602.11907 [cs.LO] https:\/\/arxiv.org\/abs\/2602.11907"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237XX(08)71948-7"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934516"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.351.13"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2000.855774"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2004.05.001"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0073967"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/162573.162536"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1137\/0211062"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/lics.1997.614955"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3776697"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS56636.2023.10175706"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3054.001.0001"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.009"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3828693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T08:10:40Z","timestamp":1790410240000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3828693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,17]]},"references-count":42,"journal-issue":{"issue":"ICFP","published-print":{"date-parts":[[2026,8,17]]}},"alternative-id":["10.1145\/3828693"],"URL":"https:\/\/doi.org\/10.1145\/3828693","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,17]]},"assertion":[{"value":"2026-03-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-05-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-08-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}