Abstract
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].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London Limited
About this chapter
Cite this chapter
Hasegawa, M. (1999). Relating Models. In: Models of Sharing Graphs. Distinguished Dissertations. Springer, London. https://doi.org/10.1007/978-1-4471-0865-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0865-8_5
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1221-1
Online ISBN: 978-1-4471-0865-8
eBook Packages: Springer Book Archive