A Calculus of Circular Proofs and its Categorical Semantics
We present a calculus of proofs, the intended models of which
are categories with finite products and coproducts, initial algebras
and final coalgebras of functors that are recursively constructible
out of these operations, that is, mu-bicomplete categories. The
calculus satisfies the cut elimination and its main characteristic is
that the underlying graph of a proof is allowed to contain a
certain amount of cycles. To each proof of the calculus we associate
a system of equations which has a meaning in every mu-bicomplete
category. We prove that this system admits always a unique
solution, and by means of this theorem we define the semantics of
Keywords: Initial algebras, final coalgebras. Fixed point calculi, mu-calculi.
Bicompletion of categories. Models of interactive computation.
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.