One advantage of our axiomatic approach to the semantic models of sharing theories is that it enables us to compare similar systems arising from computer science by relating the classes of models. In this chapter we give a few case studies: we relate the first-order acyclic sharing theories and the higher-order ones; and our sharing theories with those of Moggi’s notions of computation [71, 72]; and also with intuitionistic linear type theory [12, 18, 20].
KeywordsMonoidal Category Sharing Theory Sharing Structure Monoidal Functor Symmetric Monoidal Category
Unable to display preview. Download preview PDF.