Abstract
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 has been successfully applied to obtain 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 the SKI calculus and the λ-calculus w.r.t. a strong variant of Abramsky’s applicative bisimilarity are obtained as instances.
- Carmine Abate, Matteo Busi, and Stelios Tsampas. 2021. Fully Abstract and Robust Compilation: And How to Reconcile the Two, Abstractly. In 19th Asian Symposium on Programming Languages and Systems, APLAS’21, Hakjoo Oh (Ed.) (Lecture Notes Comput. Sci., Vol. 13008). Springer, 83–101. https://doi.org/10.1007/978-3-030-89051-3_6
Google Scholar
Digital Library
- S. Abramsky. 1990. The lazy λ -calculus. In Research topics in Functional Programming. Addison Wesley, 65–117.
Google Scholar
- Samson Abramsky and C.-H. Luke Ong. 1993. Full Abstraction in the Lazy Lambda Calculus. Inf. Comput., 105, 2 (1993), 159–267. https://doi.org/10.1006/inco.1993.1044
Google Scholar
Digital Library
- Jiří Adámek, Jiří Rosický, and Enrico Vitale. 2011. Algebraic Theories. Cambridge University Press.
Google Scholar
- Nathanael Arkor and Marcelo Fiore. 2020. Algebraic models of simple type theories: A polynomial approach. In 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS’20, Holger Hermanns, Lijun Zhang, Naoki Kobayashi, and Dale Miller (Eds.). ACM, 88–101. https://doi.org/10.1145/3373718.3394771
Google Scholar
Digital Library
- Michael Barr. 1970. Coequalizers and free triples. Math. Z., 116 (1970), 307–322.
Google Scholar
Cross Ref
- Falk Bartels. 2004. On generalised coinduction and probabilistic specification formats: Distributive laws in coalgebraic modelling. Ph. D. Dissertation. Vrije Universiteit Amsterdam.
Google Scholar
- Karen L. Bernstein. 1998. A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages. In 13th Annual IEEE Symposium on Logic in Computer Science, LICS’98. IEEE Computer Society, 153–164. https://doi.org/10.1109/LICS.1998.705652
Google Scholar
Cross Ref
- Bard Bloom. 1995. Structural Operational Semantics for Weak Bisimulations. Theor. Comput. Sci., 146, 1&2 (1995), 25–68. https://doi.org/10.1016/0304-3975(94)00152-9
Google Scholar
Digital Library
- Bard Bloom, Sorin Istrail, and Albert R. Meyer. 1995. Bisimulation Can’t be Traced. J. ACM, 42, 1 (1995), 232–268. https://doi.org/10.1145/200836.200876
Google Scholar
Digital Library
- Peio Borthelle, Tom Hirschowitz, and Ambroise Lafont. 2020. A Cellular Howe Theorem. In 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS’20, Holger Hermanns, Lijun Zhang, Naoki Kobayashi, and Dale Miller (Eds.). ACM, 273–286. https://doi.org/10.1145/3373718.3394738
Google Scholar
Digital Library
- H. B. Curry. 1930. Grundlagen der Kombinatorischen Logik. Am. J. Math., 52, 3 (1930), 509–536. issn:00029327, 10806377 http://www.jstor.org/stable/2370619
Google Scholar
Cross Ref
- Ugo Dal Lago, Francesco Gavazzo, and Paul Blain Levy. 2017. Effectful applicative bisimilarity: Monads, relators, and Howe’s method. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS’17. IEEE Computer Society, 1–12. https://doi.org/10.1109/LICS.2017.8005117
Google Scholar
Cross Ref
- Derek Dreyer, Amal Ahmed, and Lars Birkedal. 2011. Logical Step-Indexed Logical Relations. Log. Methods Comput. Sci., 7, 2 (2011), https://doi.org/10.2168/LMCS-7(2:16)2011
Google Scholar
Cross Ref
- Marcelo P. Fiore. 2008. Second-Order and Dependently-Sorted Abstract Syntax. In 23d Annual IEEE Symposium on Logic in Computer Science, LICS’08. IEEE Computer Society, 57–68. https://doi.org/10.1109/LICS.2008.38
Google Scholar
Digital Library
- Marcelo P. Fiore, Gordon D. Plotkin, and Daniele Turi. 1999. Abstract Syntax and Variable Binding. In 14th Annual IEEE Symposium on Logic in Computer Science, LICS’99. IEEE Computer Society, 193–202. https://doi.org/10.1109/LICS.1999.782615
Google Scholar
Cross Ref
- Marcelo P. Fiore and Sam Staton. 2006. A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics. In 21st Annual IEEE Symposium on Logic in Computer Science, LICS’06. IEEE Computer Society, 49–58. https://doi.org/10.1109/LICS.2006.7
Google Scholar
Digital Library
- Marcelo P. Fiore and Daniele Turi. 2001. Semantics of Name and Value Passing. In 16th Annual IEEE Symposium on Logic in Computer Science, LICS’01. IEEE Computer Society, 93–104. https://doi.org/10.1109/LICS.2001.932486
Google Scholar
Cross Ref
- Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, and Henning Urbat. 2022. Stateful Structural Operational Semantics. In 7th International Conference on Formal Structures for Computation and Deduction, FSCD’22, Amy P. Felty (Ed.) (LIPIcs, Vol. 228). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 30:1–30:19. https://doi.org/10.4230/LIPIcs.FSCD.2022.30
Google Scholar
Cross Ref
- 1999. Higher Order Operational Techniques in Semantics, Andrew D. Gordon and Andrew M. Pitts (Eds.). Cambridge University Press, USA. isbn:0521631688
Google Scholar
- Claudio Hermida, Uday S. Reddy, and Edmund P. Robinson. 2014. Logical Relations and Parametricity - A Reynolds Programme for Category Theory and Programming Languages. Electron. Notes Theor. Comput. Sci., 303 (2014), 149–180. https://doi.org/10.1016/j.entcs.2014.02.008
Google Scholar
Digital Library
- Tom Hirschowitz. 2019. Familial monads and structural operational semantics. In 46th ACM-SIGACT Symposium on Principles of Programming Languages, POPL’19. 3, ACM, 21:1–21:28. https://doi.org/10.1145/3290334
Google Scholar
Digital Library
- Tom Hirschowitz and Ambroise Lafont. 2022. A categorical framework for congruence of applicative bisimilarity in higher-order languages. Log. Methods Comput. Sci., 18, 3 (2022), https://doi.org/10.46298/lmcs-18(3:37)2022
Google Scholar
Cross Ref
- Douglas J. Howe. 1989. Equality In Lazy Computation Systems. In 4th Annual Symposium on Logic in Computer Science, LICS’89. IEEE Computer Society, 198–203. https://doi.org/10.1109/LICS.1989.39174
Google Scholar
Cross Ref
- Douglas J. Howe. 1996. Proving Congruence of Bisimulation in Functional Programming Languages. Inf. Comput., 124, 2 (1996), 103–112. https://doi.org/10.1006/inco.1996.0008
Google Scholar
Digital Library
- Bartek Klin and Beata Nachyla. 2015. Presenting Morphisms of Distributive Laws. In 6th Conference on Algebra and Coalgebra in Computer Science, CALCO’15 (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 190–204. https://doi.org/10.4230/LIPIcs.CALCO.2015.190
Google Scholar
Cross Ref
- Bartek Klin and Vladimiro Sassone. 2008. Structural Operational Semantics for Stochastic Process Calculi. In 11th International Conference Foundations of Software Science and Computational Structures, FOSSACS’08, Roberto M. Amadio (Ed.) (Lecture Notes Comput. Sci., Vol. 4962). Springer, 428–442. https://doi.org/10.1007/978-3-540-78499-9_30
Google Scholar
Cross Ref
- Søren B. Lassen. 2005. Eager Normal Form Bisimulation. In 20th IEEE Symposium on Logic in Computer Science, LICS’05. IEEE Computer Society, 345–354. https://doi.org/10.1109/LICS.2005.15
Google Scholar
Digital Library
- Saunders MacLane and Ieke Moerdijk. 1992. Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Springer-Verlag. https://doi.org/10.1007/978-1-4612-0927-0
Google Scholar
Cross Ref
- Marino Miculan and Marco Peressotti. 2016. Structural operational semantics for non-deterministic processes with quantitative aspects. Theor. Comput. Sci., 655 (2016), 135–154. https://doi.org/10.1016/j.tcs.2016.01.012
Google Scholar
Digital Library
- Robin Milner. 1989. Communication and concurrency. Prentice Hall. isbn:978-0-13-115007-2
Google Scholar
Digital Library
- Robin Milner, Joachim Parrow, and David Walker. 1992. A Calculus of Mobile Processes, I. Inf. Comput., 100, 1 (1992), 1–40. https://doi.org/10.1016/0890-5401(92)90008-4
Google Scholar
Digital Library
- Mohammad Reza Mousavi and Michel A. Reniers. 2007. On Well-Foundedness and Expressiveness of Promoted Tyft: Being Promoted Makes a Difference. Electron. Notes Theor. Comput. Sci., 175, 1 (2007), 45–56. https://doi.org/10.1016/j.entcs.2006.09.015
Google Scholar
Digital Library
- Peter W. O’Hearn and Jon G. Riecke. 1995. Kripke Logical Relations and PCF. Inf. Comput., 120, 1 (1995), 107–116. https://doi.org/10.1006/inco.1995.1103
Google Scholar
Digital Library
- Andrew Pitts. 2011. Howe’s method for higher-order languages. Cambridge University Press, 197232. https://doi.org/10.1017/CBO9780511792588.006
Google Scholar
Cross Ref
- Jan J. M. M. Rutten. 2000. Universal coalgebra: a theory of systems. Theor. Comput. Sci., 249, 1 (2000), 3–80. https://doi.org/10.1016/S0304-3975(00)00056-6
Google Scholar
Digital Library
- Davide Sangiorgi. 1994. The Lazy Lambda Calculus in a Concurrency Scenario. Inf. Comput., 111, 1 (1994), 120–153. https://doi.org/10.1006/inco.1994.1042
Google Scholar
Digital Library
- Davide Sangiorgi. 1996. Bisimulation for Higher-Order Process Calculi. Inf. Comput., 131, 2 (1996), 141–178. https://doi.org/10.1006/inco.1996.0096
Google Scholar
Digital Library
- Davide Sangiorgi, Naoki Kobayashi, and Eijiro Sumii. 2007. Environmental Bisimulations for Higher-Order Languages. In 22nd Annual IEEE Symposium on Logic in Computer Science, LICS’07. IEEE Computer Society, 293–302. https://doi.org/10.1109/LICS.2007.17
Google Scholar
Digital Library
- Dana Scott. 1970. Outline of a Mathematical Theory of Computation. Oxford University Computing Laboratory.
Google Scholar
- Richard Statman. 1985. Logical Relations and the Typed lambda-Calculus. Inf. Control., 65, 2/3 (1985), 85–97. https://doi.org/10.1016/S0019-9958(85)80001-2
Google Scholar
Cross Ref
- William W Tait. 1967. Intensional interpretations of functionals of finite type I. The journal of symbolic logic, 32, 2 (1967), 198–212.
Google Scholar
- Stelios Tsampas, Andreas Nuyts, Dominique Devriese, and Frank Piessens. 2020. A Categorical Approach to Secure Compilation. In 15th IFIP WG 1.3 International Workshop on Coalgebraic Methods in Computer Science, CMCS’20, Daniela Petrisan and Jurriaan Rot (Eds.) (Lecture Notes Comput. Sci., Vol. 12094). Springer, 155–179. https://doi.org/10.1007/978-3-030-57201-3_9
Google Scholar
Cross Ref
- Stelios Tsampas, Christian Williams, Andreas Nuyts, Dominique Devriese, and Frank Piessens. 2021. Abstract Congruence Criteria for Weak Bisimilarity. In 46th International Symposium on Mathematical Foundations of Computer Science, MFCS’21, Filippo Bonchi and Simon J. Puglisi (Eds.) (LIPIcs, Vol. 202). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 88:1–88:23. https://doi.org/10.4230/LIPIcs.MFCS.2021.88
Google Scholar
Cross Ref
- Daniele Turi and Gordon D. Plotkin. 1997. Towards a Mathematical Operational Semantics. In 12th Annual IEEE Symposium on Logic in Computer Science, LICS’97. 280–291. https://doi.org/10.1109/LICS.1997.614955
Google Scholar
Cross Ref
- Rob J. van Glabbeek. 2011. On cool congruence formats for weak bisimulations. Theor. Comput. Sci., 412, 28 (2011), 3283–3302. https://doi.org/10.1016/j.tcs.2011.02.036
Google Scholar
Cross Ref
- Hiroshi Watanabe. 2002. Well-behaved Translations between Structural Operational Semantics. Electr. Notes Theor. Comput. Sci., 65, 1 (2002), 337–357. https://doi.org/10.1016/S1571-0661(04)80372-4
Google Scholar
Cross Ref
Index Terms
Towards a Higher-Order Mathematical Operational Semantics
Recommendations
Coinductive big-step operational semantics
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to describe diverging evaluations in addition to terminating evaluations. We ...
Higher-order semantic labelling for inductive datatype systems
PPDP '07: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programmingWe give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The transformation called higher-order semantic labelling attaches algebraic ...
Towards Effects in Mathematical Operational Semantics
In this paper, we study extensions of mathematical operational semantics with algebraic effects. Our starting point is an effect-free coalgebraic operational semantics, given by a natural transformation of syntax over behaviour. The operational ...






Comments