rachel
/
pi
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
A typechecker for intensional MLTT without elaboration.
25 Commits
1 Branch
0 Tags
912 KiB
Idris 99.4%
Makefile 0.6%
 
 
Go to file
Rachel Lambda Samuelsson c7fb1d5cd3 definition system, repl 2022-07-26 23:07:13 +02:00
src definition system, repl 2022-07-26 23:07:13 +02:00
tests definition system, repl 2022-07-26 23:07:13 +02:00
.gitignore initial commit 2022-04-23 15:18:06 +02:00
README.md definition system, repl 2022-07-26 23:07:13 +02:00
makefile definition system, repl 2022-07-26 23:07:13 +02:00
pi.ipkg definition system, repl 2022-07-26 23:07:13 +02:00

README.md

pi

A dependently typed system

Implemented

  • A Basic dependent lambda calculus

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

  • let … in …

  • Unit type

  • Empty type

  • Natural numbers

  • Σ Types

TODO

  • Performence optimisation

    • Parsing !!! (this is like 90% of the time currently lmao)
    • Memoize normalisation and conversion somehow?

  • Repl

  • Universes

  • Implicit arguments

  • (indexed) inductive datatypes

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

  • Compile to scheme

References

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