\mykant\ is an \emph{interactive theorem prover}/\emph{functional
programming language}, implemented in Haskell.
- It is similar in scope to Agda or Coq, but with a more powerful notion
- of \emph{equality}.
+ It is in the tradition of Agda and Epigram (and to a lesser extent
+ Coq), but with a more powerful notion of \emph{equality}.
We have figured out theory of \mykant, and have a near-complete
implementation.
Or
\[ \myfun{head} \myappsp (3 \mycons \mynil) : \myunit \myarr \mynat \]
- Yes: to typecheck, we reduce terms fully (to their \emph{normal} form)
+ Yes: to typecheck, we reduce terms fully (to their \emph{normal form})
before comparing:
\[
\begin{array}{@{}r@{\ }c@{\ }c@{\ }c@{\ }c@{\ }c@{\ }l}