Towards a Higher-Order Mathematical Operational Semantics

10/24/2022
by   Sergey Goncharov, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2023

Weak Similarity in Higher-Order Mathematical Operational Semantics

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's f...
research
03/21/2023

A more general categorical framework for congruence of applicative bisimilarity

We prove a general congruence result for bisimilarity in higher-order la...
research
01/21/2021

Complete trace models of state and control

We consider a hierarchy of four typed call-by-value languages with eithe...
research
11/09/2017

h: A Plank for Higher-order Attribute Contraction Schemes

We present and formalize h, a core (or "plank") calculus that can serve ...
research
10/07/2022

Strong Normalization for the Calculus of Constructions

The calculus of constructions (CC) is a core theory for dependently type...
research
10/24/2020

The (In)Efficiency of Interaction

Evaluating higher-order functional programs through abstract machines in...
research
01/20/2020

Modular coinduction up-to for higher-order languages via first-order transition systems

The bisimulation proof method can be enhanced by employing `bisimulation...

Please sign up or login with your details

Forgot password? Click here to reset