Start a tutorial about simple inductive types #91
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Still a draft, but comments welcome, here is the plan: - enumerated types - inductive types with non inductive constructors - nat (first example of an inductive inductive) - positive (first example with two inductive constructors) - lists (parameterized inductive) - binary trees (first example with a constructor with 2 arguments of the inductive type) Maybe that's too much. Tactics are: - discriminate - destruct - injection - induction and we define functions with (simple) match Maybe lists and binary trees could go in a separate tutorial?
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Still a draft, but comments welcome, here is the plan:
Maybe that's too much.
Tactics are:
Maybe lists and binary trees could go in a separate tutorial?