Name
Abstract | ||
|---|---|---|
Bushes are considered as the first example of a truly nested datatype, i. e., a family of datatypes indexed over all types where a constructor argument not only calls this family with a changing index but even with an index that involves the family itself. For the time being, no induction principles for these datatypes are known. However, the author has introduced with Abel and Uustalu (TCS 333(1–2), pp. 3–66, 2005) iteration schemes that guarantee to define only terminating functions on those datatypes. The article uses a generalization of Bushes to n-fold self-application and shows how to define elements of these types that have a number of data entries that is obtained by iterated raising to the power of n. Moreover, the data entries are just all the n-branching trees up to a certain height. The real question is how to extract this list of trees from that complicated data structure and to prove this extraction correct. Here, we use the “refined conventional iteration” from the cited article for the extraction and describe a verification that has been formally verified inside Coq with its predicative notion of set. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11783596_18 | MPC |
Keywords | Field | DocType |
induction principle,n-branching tree,constructor argument,data entry,iterated power,nested datatype,complicated data structure,predicative notion,certain height,refined conventional iteration,iteration scheme,indexation,data structure | Data structure,Discrete mathematics,Computer science,Theoretical computer science,Data type,List processing,Predicative expression,Iterated function,Software development,Formal verification,Branching (version control) | Conference |
Volume | ISSN | ISBN |
4014 | 0302-9743 | 3-540-35631-2 |
Citations | PageRank | References |
1 | 0.38 | 16 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralph Matthes | 1 | 201 | 21.67 |