The dissertations are selected on behalf of the CPHC by a panel of eight academics. Each dissertation chosen makes a noteworthy contribution to the subject and reaches a high standard of exposition, placing all results clearly in the context of computer science as a whole. In this way computer scientists with significantly different interests are able to grasp the essentials - or even find a means of entry - to an unfamiliar research topic.
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 developped using this framework.
Preface and Table of Contents: [ ps file | pdf file ]
Masahito Hasegawa <hassei at kurims.kyoto-u.ac.jp>