Stars
5
stars
written in Agda
Clear filter
Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
Categories parametrized by morphism equality, in Agda
Minimalistic dependent type theory with syntactic metaprogramming
being a bidirectional reformulation of Martin-Löf's 1971 type theory