Structural Induction and Coinduction in a Fibrational Setting

Information and Computation

Volumn 145, Issue 2, 1998, Pages 107-152

  Hermida, Claudio ^a   Jacobs, Bart ^b  

^a MCGILL UNIVERSITY   (Canada)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001055350     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2725     Document Type: Article

References (58)

1. Aczel, P., and Mendler, N. (1989), A final coalgebra theorem, in "Category Theory and Computer Science" (D. H. Pitt, A. Poigné, and D. E. Rydeheard, Eds.), Springer LNCS 389, pp. 357-365, Springer-Verlag, Berlin.
2. Abramsky, S., and Jung, A. (1994), Domain theory, in "Handbook of Logic in Computer Science 3" (S. Abramsky, Dov M. Gabbai, and T. S. E. Maibaum, Eds.), pp. 1-68, Oxford Univ. Press, London.
3. America, P., and Rutten, J. (1989), Solving reflexive domain equations in a category of complete metric spaces, J. Comp. Syst. Sci. 39, No. 3, 343-375.
4. Arbib, M. A., and Manes, E. G. (1975), "Arrows, Structures and Functors. The Categorical Imperative," Academic Press, New York.
5. Arbib, M. A., and Manes, E. G. (1982), Parametrized data types do not need highly constrained parameters, Inform. Contr. 52, 139-158.
6. Backhouse, R., and Bijsterveld, M. (1994), The "Beautiful Theorem", manuscript, Univ. Eindhoven, Presented at IFIP Working Group 2.3.
7. de Bakker, J., and Vink, E. (1996), "Control Flow Semantics," The MIT Press, Boston.
8. Barr, M. (1992), Algebraically compact functors, J. Pure Appl. Alg. 82, 211-231.
9. Cockett, J. R. B. (1991), Introduction to distributive categories, Math. Struct. Comp. Science 1, 1-20.
10. Cockett, J. R. B., and Spencer, D. (1992), Strong categorical datatypes I, in "Category Theory 1991" (R. A. G. Seely, Ed.), CMS Conference Proceedings 13, pp. 141-169.
11. Cockett, J. R. B., and Spencer, D. (1995), Strong categorical datatypes II: A term logic for categorical programming, Theor. Comp. Sci. 139, 69-113.
12. Crole, R. L. (1993), "Categories for Types," Cambridge Univ. Press, Cambridge, UK.
13. Crole, R. L., and Pitts, A. M. (1992), New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic, Inform. Comput. 98, No. 2, 171-210.
14. Ehrhard, Th. (1988), A categorical semantics of constructions, in "Logic in Comp. Sci. 3," pp. 264-273, IEEE Comp. Sci. Press, Los Alamitos, CA.
15. Fiech, A. (1992), Colimits in the category Cpo, Technical Report, Kansas State University.
16. Fiore, M. (1996), A coinduction principle for recursive data types based on bisimulation, Inform. Comput. 127, No. 2, 186-198.
17. Fiore, M. (1996), "Axiomatic Domain Theory in Categories of Partial Maps," Cambridge Univ. Press, Cambridge, UK.
18. Freyd, P. J. (1990), Recursive types reduced to inductive types, in "Logic in Comp. Sci. 5" pp. 498-507, IEEE Comp. Sci. Press, Los Alamitos, CA.
19. Freyd, P. J. (1992), Remarks on algebraically compact categories, in "Applications of Categories in Computer Science" (M. P. Fourman, P. T. Johnstone, and A. M. Pitts, Eds.), pp. 95-106, Cambridge Univ. Press, Cambridge, UK.
20. Freyd, P. J., and Scedrov, A. (1990), "Categories, Allegories," Math. Library 39, North-Holland, Amsterdam.
21. Goguen, J. A., Thatcher, J., and Wagner, E. (1978), An initial algebra approach to the specification, correctness and implementatiton of abstract data types, "Current Trends in Programming Methodology," (R. Yeh, Ed.), pp. 80-149, Prentice Hall, New York.
22. Hagino, T. (1987), A typed lambda calculus with categorical type constructors, in "Category and Computer Science" (D. H. Pitt, A. Poigné, and D. E. Rydeheard, Eds.), Springer LNCS 283, pp. 140-157, Springer-Verlag, Berlin.
23. Hensel, U., and Jacobs, B. (1997), Proof principles for datatypes with iterated recursion, in ́Category Theory and Computer Sciencé (E. Moggi and G. Rosolini, Eds.), Springer LNCS 1290, pp. 220-241, Springer-Verlag, Berlin.
24. Hermida, C. (1993), Fibrations, logical predicates and indeterminates, Ph.D. thesis, Univ. of Edinburgh, Techn. rep. LFCS-93-277. [Also available as Aarhus Univ. DAIMI Techn. rep. PB-462.]
25. Hermida, C. (1993), Fibrations, logical predicates and indeterminates, Ph.D. thesis, Univ. of Edinburgh, Techn. rep. LFCS-93-277. [Also available as Aarhus Univ. DAIMI Techn. rep. PB-462.]
26. Hermida, C., Some properties of Fib as a fibred 2-category, J. Pure Appl. Algebra, to appear.
27. Hermida, C., and Jacobs, B. (1995), An algebraic view of structural induction, in "Computer Science Logic 1994" (L. Pacholski and J. Tiuryn, Eds.), Springer LNCS 933, pp. 412-426, Springer-Verlag, Berlin.
28. Hermida, C., and Jacobs, B. (1995), Fibrations with indeterminates: Contextual and functional completeness for polymorphic lambda calculi, Math. Struct. Comp. Sci. 5, 501-531.
29. Jacobs, B. (1991), "Categorical Type Theory," Ph.D. thesis, Univ. Nijmegen.
30. Jacobs, B. (1993), Comprehension categories and the semantics of type dependency, Theor. Comp. Sci. 107, 169-207.
31. Jacobs, B. (1994), Semantics of weakening and contraction, Ann. Pure Appl. Logic 69, No. 1, 73-106.
32. Jacobs, B. (1994), Quotients in simple type theory, manuscript, Univ. of Utrecht.
33. Jacobs, B. (1995), Parameters and parametrization in specification using distributive categories, Fund. Informaticae 24, No. 3, 209-250.
34. Jacobs, B. (1997), Invariants, bisimulations and the correctness of coalgebraic refinements, in "Algebraic Methodology and Software Technology" (M. Johnson, Ed.), Springer LNCS 1349, pp. 276-291, Springer-Verlag, Berlin.
35. Joyal, A., and Moerdijk, I. (1995), "Algebraic Set Theory," Cambridge Univ. Press, Cambridge, UK.
36. Kelly, G. M. (1989), Elementary observations on 2-categorical limits, Bull. Austr. Math. Soc. 39, 301-317.
37. Lambek, J., and Scott, P. J. (1986), "Introduction to Higher-Order Categorical Logic," Studies in Adv. Math. 7, Cambridge Univ. Press, Cambridge, UK.
38. Lawvere, F. W. (1970), Equality in hyperdoctrines and comprehension scheme as an adjoint functor, in "Applications of Categorical Algebra" (A. Heller, Ed.), pp. 1-14, AMS, Providence.
39. Lehmann, D., and Smyth, M. (1981), Algebraic specification of datatypes: A synthetic approach, Math. Systems Theory 14, 97-139.
40. Makkai, M. (1993), The fibrational formulation of intuitionistic predicate logic I: Completeness according to Gödel, Kripke, and Läuchli. Part 1, Notre Dame J. Formal Logic 34, No. 3, 334-377.
41. Makkai, M. (1993), The fibrational formulation of intuitionistic predicate logic I: Completeness according to Gödel, Kripke, and Läuchli. Part 2, Notre Dame J. Formal Logic 34, No. 4, 471-499.
42. Manes, E. G., and Arbib, M. A. (1986), "Algebraic Approaches to Program Semantics" Springer/AKM Theor. Comp. Sci., Berlin.
43. Markowsky, G. (1977), Categories of chain-complete posets, Theor. Comp. Sci. 4, 125-135.
44. Pavlović, D. (1990), ́Predicates and Fibrations,́ Ph.D. thesis, Univ. Utrecht.
45. Pavlović, D. (1995), Maps I: Relative to a factorization system, J. Pure Appl. Algebra 60, No. 2 (1995), 9-34.
46. Pavlović, D. (1996), Maps II: Chasing diagrams in categorical proof theory, J. IGPL 4, No. 2, 1-36. [Available from URL http://www.mpi-sb.mpg.de/igpl/Journal]
47. Pitts, A. M. (1994), A co-induction principle for recursively defined domains, Theor. Comp. Sci. 124, No. 2, 195-219.
48. Pitts, A. M. (1996), Relational properties of domains, Inform. Comput. 127, No. 2, 66-90.
49. Plotkin, G., and Abadi, M. (1993), A logic for parametric polymorphism, in ́Typed Lambda Calculi and Applicationś (M. Bezem and J. F. Groote, Eds.), Springer LNCS 664, pp. 361-375, Springer-Verlag, Berlin.
50. Reichel, H. (1995), An approach to object semantics based on terminal co-algebras, Math. Struct. Comp. Sci. 5, 129-152.
51. Rutten, J., and Turi, D. (1993), On the foundations of final semantics: non-standard sets, metric spaces and partial orders, in ́Semantics: Foundations and Applicationś (J. W. de Bakker, W. P. de Roever, and G. Rozenberg, Eds.), Springer LNCS 666, pp. 477-530, Springer-Verlag.
52. Rutten, J., and Turi, D. (1994), Initial algebra and final coalgebra semantics for concurrency, in "A Decade of Concurrency" (J. W. de Bakker, W. P. de Roever, and G. Rozenberg, Eds.), Springer LNCS 803, pp. 530-582, Springer-Verlag, Berlin.
53. Smyth, M. B. (1992), Topology, in "Handbook of Logic in Computer Science, Vol. 1, Background: Mathematical Structures" (S. Abramsky, Dov M. Gabbai, and T. S. E. Maibaum, Eds.), pp. 641-761, Oxford Univ. Press, London.
54. Smyth, M. B., and Plotkin, G. D. (1982), The category theoretic solution of recursive domain equations, SIAM J. Comput. 11, 761-783.
55. Street, R. (1972), The formal theory of monads, J. Pure Appl. Algebra 2, 149-168.
56. Street, R. (1994), Fibrations and Yoneda's Lemma in a 2-category, "Proc. Sydney Category Theory Seminar 1972/1973" (G. M. Kelly, Ed.), Springer LNM 420, pp. 104-133, Springer-Verlag, Berlin.
57. Street, R., and Walters (1978), Yoneda structures on 2-Categories, J. Algebra 50, 350-379.
58. Wirsing, M. (1990), Algebraic specification, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Volume B, pp. 673-788, Elsevier/MIT Press, Amsterdam/Cambridge, MA.