Modularity and Implementation of Mathematical Operational Semantics

  • Authors:
  • Mauro Jaskelioff;Neil Ghani;Graham Hutton

  • Affiliations:
  • Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Universidad Nacional de Rosario, Av. Pellegrini 250, S2000BTP Rosario, Argentina;Dept. of Computer and Information Sciences, University of Strathclyde, 26 Richmond St., Glasgow G1 1XH, United Kingdom;School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, United Kingdom

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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