| Coalgebra Proof Theory (2006) | |||||||||||||||
Abstract | |||||||||||||||
| 6.0. General introduction. In this proposal we focus on infinite objects such as streams, infinite terms, both first order and higher order (with binders as in lambda calculus), infinite trees, infinite communicating processes, infinite term graphs, infinite process graphs, recursive types and so on. We can enter this universe of discourse from various directions. One direction is classical Proof Theory, able to deal with recursive structures such as regular processes or µ-terms over a first order signature. Another main direction is Term Rewriting, in particular infinitary term rewriting and graph rewriting. The third main direction, which has seen a vigorous development in the last decade, is that of coalgebraic techniques. term graph rewriting coinductive term rewriting semantics, modeling | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||