Abstract
We present a higher-order extension of Turi and Plotkin's abstract GSOS framework that retains the key feature of the latter: for every language whose operational rules are represented by a higher-order GSOS law, strong bisimilarity on the canonical operational model is a congruence with respect to the operations of the language. We further extend this result to weak (bi-)similarity, for which a categorical account of Howe's method is developed. It encompasses, for instance, Abramsky's classical compositionality theorem for applicative similarity in the untyped λ-calculus. In addition, we give first steps of a theory of logical relations at the level of higher-order abstract GSOS.
| Original language | English |
|---|---|
| Title of host publication | 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023) |
| Editors | Paolo Baldan, Valeria de Paiva |
| Publisher | Schloss Dagstuhl |
| Pages | 24:1-24:3 |
| ISBN (Electronic) | 9783959772877 |
| DOIs | |
| Publication status | Published - 2 Sept 2023 |
| Externally published | Yes |
| Event | 10th Conference on Algebra and Coalgebra in Computer Science, CALCO 2023 - Bloomington, United States Duration: 19 Jun 2023 → 21 Jun 2023 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 270 |
| ISSN (Print) | 1868-8969 |
Conference
| Conference | 10th Conference on Algebra and Coalgebra in Computer Science, CALCO 2023 |
|---|---|
| Country/Territory | United States |
| City | Bloomington |
| Period | 19/06/23 → 21/06/23 |
Bibliographical note
Publisher Copyright:© Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, and Henning Urbat; licensed under Creative Commons License CC-BY 4.0.
Keywords
- Abstract GSOS
- applicative bisimilarity
- bialgebra
- lambda-calculus
ASJC Scopus subject areas
- Software