Theoretical Computer Science
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
COLOG-88 Proceedings of the international conference on Computer logic
Iteration theories: the equational logic of iterative processes
Iteration theories: the equational logic of iterative processes
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Coherence completions of categories
Theoretical Computer Science - Special issue on linear logic, 1
Completeness of Kozen's axiomatisation of the propositional &mgr;-calculus
Information and Computation
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Mendler-style inductive types, categorically
Nordic Journal of Computing
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
The Variable Hierarchy for the Lattice μ-Calculus
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the Proof Theory of Regular Fixed Points
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Ambiguous classes in the games µ-calculus hierarchy
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A Categorical Setting for Lower Complexity
Electronic Notes in Theoretical Computer Science (ENTCS)
The Recursion Scheme from the Cofree Recursive Comonad
Electronic Notes in Theoretical Computer Science (ENTCS)
Safe recursion revisited I: Categorical semantics for lower complexity
Theoretical Computer Science
| Hi-index | 0.00 |
We present a calculus of "circular proofs": the graph underlying a proof is not a finite tree but instead it is allowed to contain a certain amount of cycles. The main challenge in developing a theory for the calculus is to define the semantics of proofs, since the usual method by induction on the structure is not available. We solve this problem by associating to each proof a system of equations - defining relations among undetermined arrows of an arbitrary category with finite products and coproducts as well as constructible initial algebras and final coalgebras - and by proving that this system admits always a unique solution.