Reasoning with !-graphs
<p>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 indu...
| Главный автор: | |
|---|---|
| Другие авторы: | |
| Формат: | Диссертация |
| Язык: | English |
| Опубликовано: |
2013
|
| Предметы: |