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

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Goncharov, Sergey, Milius, Stefan, Schröder, Lutz, Tsampas, Stelios, Urbat, Henning
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Logic in Computer Science Computer Science - Programming Languages Mathematics - Category Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!