A typechecker for intensional MLTT without elaboration.

Go to file

Rachel Lambda Samuelsson b53a575821 began work on inductives (this commit doesn't compile)		2022-06-07 14:53:24 +02:00
src	began work on inductives (this commit doesn't compile)	2022-06-07 14:53:24 +02:00
.gitignore	initial commit	2022-04-23 15:18:06 +02:00
README.md	add some references to useful material in the readme	2022-05-16 17:49:56 +02:00
TODO.md	began work on inductives (this commit doesn't compile)	2022-06-07 14:53:24 +02:00
makefile	initial commit	2022-04-23 15:18:06 +02:00
pi.ipkg	began work on inductives (this commit doesn't compile)	2022-06-07 14:53:24 +02:00

README.md

pi

A dependently typed system

TODO

Inductively defined datatypes
Implicit arguments, Metavariables, and Unification
Universe hierarchy
- Universe Polymorphism
- Cumulative Universes(?)

References

Some of the material I found helpful in groking dependent type checking:

Coquand, Thierry. “An Algorithm for Type-Checking Dependent Types.” Science of Computer Programming 26, no. 1–3 (May 1996): 167–77. https://doi.org/10.1016/0167-6423(95)00021-6.
Brady, Edwin. “SPLV20 course notes”. GitHub. https://github.com/edwinb/SPLV20