Thesis icon

Thesis

Reasoning with !-graphs

Abstract:

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can be built on this to allow the formalisation of inductive proofs in the string diagrams of compact closed and traced symmetric monoidal categories.

String diagrams provide an intuitive method for reasoning about monoidal categories. However, this d...

Expand abstract

Actions


Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Research group:
Quantum Computer Science
Oxford college:
Magdalen College
Role:
Author

Contributors

Division:
MPLS
Department:
Computer Science
Role:
Supervisor
Division:
MPLS
Department:
Computer Science
Role:
Supervisor
Publication date:
2013
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
Oxford University, UK

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP