Towards a Higher-Order Mathematical Operational Semantics

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 compositio...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of ACM on programming languages Vol. 7; no. POPL; pp. 632 - 658
Main Authors:	Goncharov, Sergey, Milius, Stefan, Schröder, Lutz, Tsampas, Stelios, Urbat, Henning
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 09.01.2023
Subjects:	Categorical semantics Operational semantics Theory of computation Categorical semantics Abstract GSOS Higher-order reasoning
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!