Abstract

A novel form of labelled transition system is proposed, where<br />the labels are the arrows of a category, and adjacent labels in computations<br /> are required to be composable. Such transition systems provide the<br />foundations for modular SOS descriptions of programming languages.<br />Three fundamental ways of transforming label categories, analogous to<br />monad transformers, are provided, and it is shown that their applications<br />preserve computations in modular SOS. The approach is illustrated with<br />fragments taken from a modular SOS for ML concurrency primitives.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.