Open AccessFoundations of Modular SOS
Author(s) -
Peter D. Mosses
Publication year - 1999
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v6i54.20124
Subject(s) - modular design , concurrency , programming language , monad (category theory) , computation , computer science , theoretical computer science , arithmetic , mathematics , discrete mathematics , functor
A novel form of labelled transition system is proposed, where the labels are the arrows of a category, and adjacent labels in computations are required to be composable. Such transition systems provide the foundations for modular SOS descriptions of programming languages. Three fundamental ways of transforming label categories, analogous to monad transformers, are provided, and it is shown that their applications preserve computations in modular SOS. The approach is illustrated with fragments taken from a modular SOS for ML concurrency primitives.