| John Power Edinburgh, January 1995 (2007) | |||||||||||||||
Abstract | |||||||||||||||
| control structures do not have an explicit set of names, and they fit more naturally into the usual use of category theory in computer science, particularly in denotational semantics. Here, we go one step further. We drop the one (mild) categorically unnatural condition on abstract control structures, and prove an equivalence with what we call elementary control structures. Elementary control structures fit immediately into the general semantic theory of "notions of computation" of [PR], for which the simplest situation studied has a base category B with finite products and an identity on objects strict symmetric monoidal functor into a symmetric monoidal category C. That paper includes a mild generalisation of that setting, in order to incorporate the start of a study of adding state to traditional denotational semantics. So, the equivalence we prove here proves that control structures fit naturally and simply into the broader study of denotational semantics. In Section 2, we review... | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||