Abstract
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.
Cite
CITATION STYLE
Mosses, P. D. (1999). Foundations of modular SOS(Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1672, pp. 70–80). Springer Verlag. https://doi.org/10.1007/3-540-48340-3_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
