{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T16:10:34Z","timestamp":1787069434256,"version":"build-2736575974"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2026,3,22]]},"abstract":"<jats:p>Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi and Plotkin's bialgebraic abstract GSOS framework, which provides off-the-shelf compositionality results for first-order languages, so far does not apply to higher-order languages. In the present work, we develop a theory of abstract GSOS specifications for higher-order languages, in effect transferring the core principles of Turi and Plotkin's framework to a higher-order setting. In our theory, the operational semantics of higher-order languages is represented by certain dinatural transformations that we term (pointed) higher-order GSOS laws. We give a general compositionality result that applies to all systems specified in this way and discuss how compositionality of combinatory logics and the lambda-calculus w.r.t. a strong variant of Abramsky's applicative bisimilarity are obtained as instances.<\/jats:p>\n                  <jats:p>Extended and updated version of arXiv:2210.13387<\/jats:p>","DOI":"10.46298\/jfp.17738","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T06:50:11Z","timestamp":1780296611000},"source":"Crossref","is-referenced-by-count":1,"title":["Higher-order bialgebraic semantics"],"prefix":"10.46298","volume":"Volume 36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6924-8766","authenticated-orcid":false,"given":"Sergey","family":"Goncharov","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03angcq70","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Birmingham"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2021-1644","authenticated-orcid":false,"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00f7hpc57","id-type":"ROR","asserted-by":"publisher"}],"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3146-5906","authenticated-orcid":false,"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00f7hpc57","id-type":"ROR","asserted-by":"publisher"}],"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8981-2328","authenticated-orcid":false,"given":"Stelios","family":"Tsampas","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03yrrjy16","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Southern Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3265-7168","authenticated-orcid":false,"given":"Henning","family":"Urbat","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00f7hpc57","id-type":"ROR","asserted-by":"publisher"}],"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2026,6,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2405.16708v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2405.16708v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T16:15:14Z","timestamp":1782317714000},"score":1,"resource":{"primary":{"URL":"https:\/\/jfp.episciences.org\/17738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,1]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/jfp.17738","relation":{"has-preprint":[{"id-type":"arxiv","id":"2405.16708v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2405.16708","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2405.16708","asserted-by":"subject"}]},"ISSN":["1469-7653"],"issn-type":[{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,1]]},"article-number":"17738"}}