rachel
/
pi
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
A typechecker for intensional MLTT without elaboration.
11 Commits
1 Branch
0 Tags
912 KiB
Idris 99.4%
Makefile 0.6%
 
 
Go to file
Rachel Lambda Samuelsson ab7d70d562 implemented types ⊤, ⊥, and ℕ 2022-07-21 00:05:45 +02:00
src implemented types ⊤, ⊥, and ℕ 2022-07-21 00:05:45 +02:00
.gitignore initial commit 2022-04-23 15:18:06 +02:00
README.md implemented types ⊤, ⊥, and ℕ 2022-07-21 00:05:45 +02:00
makefile initial commit 2022-04-23 15:18:06 +02:00
pi.ipkg it works ! a lot has changed 2022-05-13 19:46:05 +02:00

README.md

pi

A dependently typed system

Implemented

  • A Basic dependent lambda calculus

    • lambda abstractions
    • variables
    • pi types
    • type of types

  • Unit type

  • Empty type

  • Natural numbers

TODO

  • Fun types

    • Σ
    • Id

  • Parser

  • Implicit arguments

  • Universes

  • (indexed) inductive datatypes

  • Write down the rules (I’ll not get this far)

References

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