Proof principles for datatypes with iterated recursion

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

Volumn 1290, Issue , 1997, Pages 220-241

  Hensel, Ulrich ^a   Jacobs, Bart ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORESTRY;

CATEGORICAL LOGIC; DATAFUNCTORS; FIBRATIONS; INITIAL ALGEBRAS; ITERATED RECURSION; PROOF TOOLS; TECHNICAL CONTRIBUTION; TERMINAL COALGEBRAS;

TREES (MATHEMATICS);

EID: 84949196162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026991     Document Type: Conference Paper

References (30)

1. P. Aczel. Non-well-founded sets. CSLI Lecture Notes 14, Stanford, 1988.
2. R.C. Backhouse, P. Chisholm, G. Malcolm, and E. Saaman. Do-it-yourself type theory. Formal Aspects of Comp., 1:19-84, 1989.
3. F. Borceux. Handbook of Categorical Algebra, volume 50, 51 and 52 of Encyclopedia of Mathematics. Cambridge Univ. Press, 1994.
4. J.R.B. Cockett and T. Fukushima. About charity. Technical Report 92/480/18, Dep. Comp. Sei., Univ. Calgary, 1992.
5. J.R.B. Cockett and D. Spencer. Strong categorical datatypes II: A term logic for categorical programming. Theor. Comp. Sci., 139:69-113, 1995.
6. Th. Coquand and Ch. Paulin. Inductively defined types. In P. Martin-LSf and G. Mints, editors, COLOG 88 International conference on computer logic, number 417 in Leet. Notes Comp. Sci., pages 50-66. Springer, Berlin, 1988.
7. P. Dybjer. Inductive families. Formal Aspects of Comp., 6:440-465, 1994.
8. M.P. Fiore. A coinduction principle for recursive data types based on bisimulation. Inf & Comp., 127(2):186-198, 1996.
9. E. Giménez. Implementation of co-inductive types in Coq: an experiment with the Alternating Bit Protocol. In S. Berardi and M. Coppo, editors, Types for Proofs and Programs, number 1158 in Leet. Notes Comp. Sei., pages 135-152. Springer, Berlin, 1996.
10. J.A. Goguen, J. Thatcher, and E. Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In R. Yeh, editor, Current Trends in Programming Methodology, pages 80-149. Prentice Hall, 1978.
11. U. Hensel and B. Jacobs. Coalgebraic theories of sequences in pvs. Techn. Rep. CSI-R9708, Comput. Sci. Inst., Univ. of Nijmegen, 1997.
12. U. Hensel and D. Spooner. A view on implementing processes: Categories of circuits. In M. Haveraaen, O. Owe, and O.-J. Daht, editors, Recent Trends in Data Type Specification, number 1130 in Lect. Notes Comp. Sei., pages 237-254. Springer, Berlin, 1996.
13. C. Hermida. Some properties of Fib as a fibred 2-category. Journ. Pure &J Appl. Algebra, 1997, to appear.
14. C. Hermida and B. Jacobs. An algebraic view of structural induction. In L. Paeholski and J. Tiuryn, editors, Computer Science Logic 1994, number 933 in Lect. Notes Comp. Sci., pages 412-426. Springer, Berlin, 1995.
15. C. Hermida and B. Jacobs. Structural induction and coinduction in a fibrational setting. Full version of [14], 1996.
16. B. Jacobs. Parameters and parametrization in specification using distributive categories. Fund. Informaticae, 24(3):209-250, 1995.
17. B. Jacobs. Invariants, bisimulations and the correctness of coalgebraic refinements. Techn. Rep. CSLR9704, Comput. Sei. Inst., Univ. of Nijmegen, 1997.
18. B. Jacobs. Categorical Logic and Type Theory. 1998, to appear
19. B. Jay. Data categories. In M.E. Houle and P.Eades, editors, Computing: The Australasian Theory Symposium Proceedings, number 18 in Australian Comp. Sci. Comm., pages 21-28, 1996.
20. M. Makkai. The fibrational formulation of intuitionistic predicate logic I: completeness according to Godel, Kripke, and Lauchli. Part 1. Notre Dame Journ. Formal Log., 34(3):334-377, 1993.
21. M. Makkai. The fibrational formulation of intuitionistic predicate logic I: completeness according to Godel, Kripke, and Lauchli. Part 2. Notre Dame Journ. Formal Log., 34(4).-471-499, 1993.
22. N.P. Mendler. Inductive types and type constraints in second-order lambda calculus. Ann. Pure & Appl. Logic, 51(1/2):159-172,1991.
23. E. Moggi. Notions of computation and monads. Inf. & Comp., 93(l):55-92, 1991.
24. S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M. Srivas. PVS: Combining specification, proof checking, and model checking. In R. Alur and T.A. Henzinger, editors, Computer Aided Verification, number 1102 in Lect. Notes Comp. Sci., pages 411-414. Springer, Berlin, 1996.
25. S. Owre, J.M. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Trans, on Softw. Eng., 21(2):107-125, 1995.
26. Ch. Paulin-Mohring. Inductive definitions in the system Coq. Rules and properties. In M. Bezem and J.F. Groote, editors, Typed Lambda Calculi and Applications, number 664 in Lect. Notes Comp. Sci., pages 328-345. Springer, Berlin, 1993.
27. L.C. Paulson. Mechanizing coinduction and corecursion in higher-order logic. Journ. of Logic and Computation, 7:175-204, 1997.
28. A.M. Pitts. A co-induction principle for recursively defined domains. Theor. Comp. Sci., 124(2): 195-219, 1994.
29. J. Rutten and D. Turi. Initial algebra and final coalgebra semantics for concurrency. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency, number 803 in Lect. Notes Comp. Sci., pages 530-582. Springer, Berlin, 1994.
30. J.J.M.M. Rutten. Universal coalgebra: a theory of systems. CWI Report CS-R9652, 1996.