Models of Sharing Graphs

A Categorical Semantics of let and letrec

  • Masahito¬†Hasegawa

Part of the Distinguished Dissertations book series (DISTDISS)

Table of contents

  1. Front Matter
    Pages I-XII
  2. Masahito Hasegawa
    Pages 1-17
  3. Masahito Hasegawa
    Pages 19-38
  4. Masahito Hasegawa
    Pages 39-56
  5. Masahito Hasegawa
    Pages 57-63
  6. Masahito Hasegawa
    Pages 65-70
  7. Masahito Hasegawa
    Pages 71-81
  8. Masahito Hasegawa
    Pages 83-101
  9. Masahito Hasegawa
    Pages 103-113
  10. Masahito Hasegawa
    Pages 115-116
  11. Back Matter
    Pages 117-134

About this book


Models of Sharing Graphs presents a sound mathematical basis for reasoning about models of computation involving shared resources, including graph rewriting systems, denotational semantics and concurrency theory. An algebraic approach, based on the language of category theory, is taken throughout this work, which enables the author to describe several aspects of the notion of sharing in a systematic way. In particular, a novel account of recursive computation created from cyclic sharing is developed using this framework.


Mathematica Notation algebra category theory computation equation graph graph rewriting graphs logic proof recursion semantics theorem

Authors and affiliations

  • Masahito¬†Hasegawa
    • 1
  1. 1.Research Institute for Mathematical SciencesKyoto UniversityKyotoJapan

Bibliographic information