Fibrational induction rules for initial algebras

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

Volumn 6247 LNCS, Issue , 2010, Pages 336-350

  Ghani, Neil ^a   Johann, Patricia ^a   Fumex, Clément ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TYPE; FUNCTORS; HYPERFUNCTIONS; INDUCTIVE-TYPE; INITIAL ALGEBRAS; POLYNOMIAL DATA; ROSE TREE;

COMPUTER SCIENCE; DATA STRUCTURES; POLYNOMIALS; TECHNICAL PRESENTATIONS;

TREES (MATHEMATICS);

EID: 77956600231     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15205-4_27     Document Type: Conference Paper

References (14)

1. Bird, R.S., De Moor, O.: Algebra of Programming. International Series in Computing Science, vol.100. Prentice-Hall, Englewood Cliffs (1997)
2. Bird, R., Meertens, L.: Nested Datatypes. In: Jeuring, J. (ed.) MPC 1998. LNCS, vol.1422, pp. 52-67. Springer, Heidelberg (1998)
3. Coquand, T., Huet, G.: The Calculus of Constructions. Information and Computation 76(2-3), 95-120 (1988)
4. The Coq Proof Assistant, coq.inria.fr
5. Ghani, N., Johann, P.: Foundations for Structured Programming with GADTs. In: Proceedings, Principles of Programming Languages, pp. 297-308 (2008)
6. Hermida, C., Jacobs, B.: Structural Induction and Coinduction in a Fibrational Setting. Information and Computation 145(2), 107-152 (1998)
7. Jacobs, B.: Comprehension Categories and the Semantics of Type Dependency. Theoretical Computer Science 107, 169-207 (1993)
8. Jacobs, B.: Categorical Logic and Type Theory. North Holland, Amsterdam (1999)
9. Johann, P., Ghani, N.: Initial Algebra Semantics is Enough! Proceedings, Typed Lambda Calculus and Applications, pp. 207-222 (2007)
10. Lawvere, F.W.: Equality in Hyperdoctrines and Comprehension Scheme as an Adjoint Functor. Applications of Categorical Algebra, 1-14 (1970)
11. Matthes, R.: An Induction Principle for Nested Datatypes in Intensional Type Theory. Journal of Functional Programming 19(3&4), 439-468 (2009)
12. Morris, P.: Constructing Universes for Generic Programming. Dissertation, University of Nottingham (2007)
13. Moggi, E.: Notations of Computation and Monads. Information and Computation 93(1), 55-92 (1991)
14. Pavlovic, D.: Predicates and Fibrations. Dissertation, University of Utrecht (1990)