Projects per year
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our results are semantic in nature and are inspired by Hermida and Jacobs’ elegant algebraic formulation of induction for polynomial data types. Our contribution is to derive, under slightly different assumptions, an induction rule that is generic over all inductive types, polynomial or not. Our induction rule is generic over the kinds of properties to be proved as well: like Hermida and Jacobs, we work in a general fibrational setting and so can accommodate very general notions of properties on inductive types rather than just those of particular syntactic forms. We establish the correctness of our generic induction rule by reducing induction to iteration. We show how our rule can be instantiated to give induction rules for the data types of rose trees, finite hereditary sets, and hyperfunctions. The former lies outside the scope of Hermida and Jacobs’ work because it is not polynomial; as far as we are aware, no induction rules have been known to exist for the latter two in a general fibrational framework. Our instantiation for hyperfunctions underscores the value of working in the general fibrational setting since this data type cannot be interpreted as a set.
|Title of host publication||Computer Science Logic|
|Subtitle of host publication||24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings|
|Editors||Anuj Dawar , Helmut Veith|
|Number of pages||15|
|Publication status||Published - 2010|
|Name||Lecture Notes In Computer Science|
- fibrational Induction Rules
- initial algebras
- computer science
FingerprintDive into the research topics of 'Fibrational induction rules for initial algebras'. Together they form a unique fingerprint.
- 1 Finished
Johann, P. & Ghani, N.
1/07/09 → 31/12/12