ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Theoretical Computer Science
Volume 327, Issues 1-2, 25 October 2004, Pages 135-154
Selected Papers of CMCS '03
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (259 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.tcs.2004.07.024    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Category theory for operational semantics

Marina Lenisaa, Corresponding Author Contact Information, 1, E-mail The Corresponding Author, John Powerb, 2, E-mail The Corresponding Author and Hiroshi Watanabec, 3, E-mail The Corresponding Author

aDipartimento di Matematica e Informatica,Università di Udine, I-33100 Udine, Italy bLaboratory for the Foundations of Computer Science,University of Edinburgh, King's Buildings, Edinburgh EH9 3JZ, Scotland, UK cLaboratory for Verification and Semantics, AIST, Amagasaki 661-0974, Japan

Available online 6 August 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We use the concept of a distributive law of a monad over a copointed endofunctor to define and develop a reformulation and mild generalisation of Turi and Plotkin's notion of an abstract operational rule. We make our abstract definition and give a precise analysis of the relationship between it and Turi and Plotkin's definition. Following Turi and Plotkin, our definition, suitably restricted, agrees with the notion of a set of GSOS-rules, allowing one to construct both an operational model and a canonical, internally fully abstract denotational model. Going beyond Turi and Plotkin, we construct what might be seen as large-step operational semantics from small-step operational semantics and we show how our definition allows one to combine distributive laws, in particular accounting for the combination of operational semantics with congruences.

Keywords: Abstract operational semantics; GSOS-rule; Distributive law; Initial/final semantics


Theoretical Computer Science
Volume 327, Issues 1-2, 25 October 2004, Pages 135-154
Selected Papers of CMCS '03
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.