summaryrefslogtreecommitdiff
path: root/presentation.tex
diff options
context:
space:
mode:
Diffstat (limited to 'presentation.tex')
-rw-r--r--presentation.tex9
1 files changed, 6 insertions, 3 deletions
diff --git a/presentation.tex b/presentation.tex
index a1b2419..a2cf6ab 100644
--- a/presentation.tex
+++ b/presentation.tex
@@ -228,11 +228,14 @@
\begin{frame}
\frametitle{\mykant?}
- \mykant\ is an \emph{interactive theorem prover}, implemented in
- Haskell.
+ \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}.
+
+ We have figured out theory of \mykant, and have a near-complete
+ implementation.
\end{frame}
\begin{frame}
@@ -532,7 +535,7 @@ Without the $\myb{l}$ we cannot compute, so we are stuck with
\[
\cancel{\mytyp : \mytyp}\ \ \ \text{\textbf{inconsistent}}
\]
- Much like na{\"i}ve set theory is (Girard's paradox).
+ Similar to Russel's paradox in na{\"i}ve set theory.
Instead, we have a hierarchy:
\[