Modularity and Implementation of Mathematical Operational Semantics | Zendy

Mauro Jaskelioff | Zendy; Neil Ghani | Zendy; Graham Hutton | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Modularity and Implementation of Mathematical Operational Semantics

Author(s) -

Mauro Jaskelioff,

Neil Ghani,

Graham Hutton

Publication year - 2011

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2011.02.017

Subject(s) - operational semantics , computer science , programming language , haskell , semantics (computer science) , syntax , abstract syntax , principle of compositionality , modularity (biology) , modular design , well founded semantics , denotational semantics , functional programming , theoretical computer science , artificial intelligence , biology , genetics

tructural operational semantics is a popular technique for specifying the meaning of programs by means of inductive clauses. One seeks syntactic restrictions on those clauses so that the resulting operational semantics is well-behaved. This approach is simple and concrete but it has some drawbacks. Turi pioneered a more abstract categorical treatment based upon the idea that operational semantics is essentially a distribution of syntax over behaviour. In this article we take Turiʼs approach in two new directions. Firstly, we show how to write operational semantics as modular components and how to combine such components to specify complete languages. Secondly, we show how the categorical nature of Turiʼs operational semantics makes it ideal for implementation in a functional programming language such as Haskell

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research