In this project, we have introduced a general datatype which lets you define any simply typed, strictly positive inductive type as an instance of it. A primitive recursion for that type can then be automatically constructed, allowing you to define simple types and operations over them in a minimal system.
-
Notifications
You must be signed in to change notification settings - Fork 0
General datatype for simply typed induction in Agda
License
mr-ohman/general-induction
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
General datatype for simply typed induction in Agda
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published