A calculus of circular proofs and its categorical semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2303, Issue , 2002, Pages 357-371

  Santocanale, Luigi ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SEMANTICS; TREES (MATHEMATICS);

CATEGORICAL SEMANTICS; CO-PRODUCTS; DEFINING RELATIONS; FINAL COALGEBRAS; FINITE PRODUCTS; FINITE TREES; INITIAL ALGEBRAS; SYSTEM OF EQUATIONS;

CALCULATIONS;

EID: 84948983407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45931-6_25     Document Type: Conference Paper

References (26)

1. S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. J. Symbolic Logic, 59(2):543–574, 1994.
2. P. Aczel. Non-well-founded sets. Stanford University Center for the Study of Language and Information, Stanford, CA, 1988.
3. J. Adámek and J. Rosický. Locally presentable and accessible categories. Cam bridge University Press, Cambridge, 1994.
4. A. Arnold and D. Niwinski. Rudiments of mu-calculus. Number 146 in Studies in Logic and the Foundations of Mathematics. Elsevier (North-Holland), 2001.
5. A. Blass. A game semantics for linear logic. Ann. Pure Appl. Logic, 56(1-3):183–220, 1992.
6. S. L. Bloom and Z. Ésik. Iteration theories. Springer-Verlag, Berlin, 1993. The equational logic of iterative processes.
7. S. L. Bloom, Z. Ésik, A. Labella, and E. G. Manes. Iteration 2-theories. Appl. Categ. Structures, 9(2):173–216, 2001.
8. J. R. B. Cockett and R. A. G. Seely. Finite sum-product logic. Theory and Applications of Categories, 8:63–99, 2001.
9. T. Coquand. Infinite objects in type theory. In Types for proofs and programs (Nijmegen, 1993), pages 62–78. Springer, Berlin, 1994.
10. T. Coquand and C. Paulin. Inductively defined types. In COLOG-88 (Tallinn, 1988), pages 50–66. Springer, Berlin, 1990.
11. J.-Y. Girard. Linear logic. Theoret. Comput. Sci., 50(1):101, 1987.
12. H. Hu and A. Joyal. Coherence completions of categories. Theoret. Comput. Sci., 227(1-2):153–184, 1999. Linear logic, I (Tokyo, 1996).
13. A. J. C. Hurkens, M. McArth ur, Y. N. Moschovakis, L. S. Moss, and G. T. Whitney. The logic of recursive equations. J. Symbolic Logic, 63(2):451–478, 1998.
14. A. Joyal. Free lattices, communication, and money games. In Logic and scientific methods, pages 29–68. Klu wer Academic Publishers, 1997.
15. D. Kozen. Results on the propositional µ-calculus. Theoret. Comput. Sci., 27(3):333–354, 1983.
16. J. Lambek. A fixpoint theorem for complete categories. Math. Z., 103:151–161, 1968.
17. M. Lenisa. A complete coinductive logical system for bisimulation equivalence on circular objects. In Foundations of software science and computation structures (Amsterdam, 1999), pages 243–257. Springer, Berlin, 1999.
18. J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theoret. Comput. Sci., 249(1):3–80, 2000.
19. L. Santocanale. The alternation hierarchy for the theory of µ-lattices. Technical Report RS-00-29, BRICS, November 2000. T o appear in Theory and Applications of Categories.
20. L. Santocanale. Free µ-lattices. Technical Report RS-00-28, BRICS, November 2000. T o appear in Journal of Pure and Applied Algebra.
21. L. Santocanale. Surles µ-treillis libres. PhD thesis, Université du Québec à Montréal, July 2000.
22. L. Santocanale. A calculus of circular proofs and its categorical semantics. Technical Report RS-01-15, BRICS, May 2001. Extended version available from: http://www.cpsc.ucalgary.ca/~luigis/.
23. L. Santocanale. Parity functors and µ-bicomplete categories (extended abstract). In Fixed Points in Computer Science 2001, September 2001. Extended version submitted.
24. T. Uustalu and V. Vene. Mendler-style inductive types, categorically. Nordic J. Comput., 6(3):343–361, 1999. Programming theory (Turku, 1998).
25. P. Wadler. Deforestation: transforming programs to eliminate trees. Theoret. Comput. Sci., 73(2):231–248, 1990.
26. I. Walukiewicz. Completeness of Kozen’s axiomatisation of the propositional µ-calculus. Inform. and Comput., 157(1-2):142–182, 2000. LICS 1995 (San Diego, CA).