You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
||9 months ago|
|src||10 months ago|
|tests||10 months ago|
|.gitignore||1 year ago|
|README.md||9 months ago|
|makefile||10 months ago|
|pi.ipkg||10 months ago|
A dependently typed system
A Basic dependent lambda calculus
- lambda abstractions
- pi types
- type of types
let … in …
Martin-Löf Identity types
Here are some things which are not present but could be.
This project has served me well by teaching me about typechecking dependently typed systems. It’s likely that the features listed below will not be implemented as I’ll move onto other projects and learn more about elaboration.
- a la tarksi
- W types
- Indexed inductives
- Implicit arguments
- Universe family application
- Syntax level russel universes
- Universe of all other universes? (universe polymorphism)
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