You are not logged in. Your edit will be placed in a queue until it is peer reviewed.
We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.
-
$\begingroup$ In the recursive case, can't you get essentially the same induction principle you would get from the inductive definition by just doing induction on the indices? In particular, in Agda you could just split directly on the indices rather than going to the pain of explicitly calling an induction function. $\endgroup$– Mike ShulmanCommented Feb 5 at 19:27
-
$\begingroup$ I think this is true only if your inductive type has the same structure as your indexing type (thinking about ornaments here). But if you have a more complicated relation, this might not be as simple. For instance, if you have a "catch-all" constructor that can be used to construct a value for any index (think conversion rule for inductively defined typing), then you'll have a corresponding case for each index, and you'll end up repeating that case. $\endgroup$– Meven Lennon-Bertrand ♦Commented Feb 6 at 9:41
-
$\begingroup$ I feel like this might be similar to the use of functional induction, ie an induction principle that follows the structure of a recursive functions, which might be more complicated than the one corresponding to the induction principle for the inductive type. Here too you want an induction principle "of the right shape", which is not the same as that of the underlying datastructure. But maybe all this is easier to do with Agda's pattern-matching. $\endgroup$– Meven Lennon-Bertrand ♦Commented Feb 6 at 9:44
-
1$\begingroup$ I didn't mean to include an inductive family with a "catch-all" constructor among the "situations where both definitions are possible" that I said in the question I wanted to restrict to. I suppose in that case you could get something like a recursive version by duplicating the catch-all constructor at each index, as you suggest, but it wouldn't be as strongly equivalent since, for instance, you wouldn't be able to apply the catch-all constructor without first destructing the index. $\endgroup$– Mike ShulmanCommented Feb 6 at 21:11
Add a comment
|
How to Edit
- Correct minor typos or mistakes
- Clarify meaning without changing it
- Add related resources or links
- Always respect the author’s intent
- Don’t use edits to reply to the author
How to Format
-
create code fences with backticks ` or tildes ~
```
like so
``` -
add language identifier to highlight code
```python
def function(foo):
print(foo)
``` - put returns between paragraphs
- for linebreak add 2 spaces at end
- _italic_ or **bold**
- indent code by 4 spaces
- backtick escapes
`like _so_`
- quote by placing > at start of line
- to make links (use https whenever possible)
<https://example.com>
[example](https://example.com)
<a href="https://example.com">example</a> - MathJax equations
$\sin^2 \theta$
How to Tag
A tag is a keyword or label that categorizes your question with other, similar questions. Choose one or more (up to 5) tags that will help answerers to find and interpret your question.
- complete the sentence: my question is about...
- use tags that describe things or concepts that are essential, not incidental to your question
- favor using existing popular tags
- read the descriptions that appear below the tag
If your question is primarily about a topic for which you can't find a tag:
- combine multiple words into single-words with hyphens (e.g. type-theory), up to a maximum of 35 characters
- creating new tags is a privilege; if you can't yet create a tag you need, then post this question without it, then ask the community to create it for you