thtuerk/ITP-Course
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

initial version

Browse Source 
cleaned-up the sources of the ITP course
- remove internal notes
- remove exercise solutions
- remove KTH logo
- add Creative Commons license
This commit is contained in:
Thomas Türk
2019-11-11 10:22:43 +01:00
commit 3c35cc25c3
71 changed files with 35906 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
questionnaire/Makefile Executable file
View File

@ -0,0 +1,9 @@
all:
pdflatex questionnaire.tex
pdflatex questionnaire.tex
pdflatex questionnaire-simple.tex
pdflatex questionnaire-simple.tex
clean:
rm -f *.toc *.aux *.ps *.log *.lof *.bbl *.blg *.hix *.tid *.tde *.out *~

145
questionnaire/questionnaire-simple.tex Normal file
View File

@ -0,0 +1,145 @@
\documentclass[a4paper,10pt,oneside]{scrartcl}
\usepackage[utf8]{inputenc}
\usepackage[a4paper]{geometry}
\usepackage{hyperref}
\usepackage{url}
\usepackage{color}
\usepackage{amsfonts}
\title{Background Questionaire}
\begin{document}
\begin{center}
\usekomafont{sectioning}\usekomafont{part} Background Questionaire
\end{center}
\bigskip
Please try to answer the following questions alone and without using
any external aids. If you have trouble, just skip a question instead
of guessing and thinking very hard. Try not to write lengthy answers,
often bullet-points are enough. This is no exam, please hand in the
results \emph{anonymously}. The results are used only to adapt the
\emph{Interactive Theorem Proving} course to the background and
interests of the audience.
\section{Functional Programming}
\begin{enumerate}
\item Consider the following functional program on lists.
\begin{verbatim}
fun SNOC x [] = [x]
| SNOC x (y::ys) = y::(SNOC x ys)
\end{verbatim}
Please answer the following questions:
\begin{itemize}
\item What is the result of \texttt{SNOC 5 [7,3,2]}?
\item Describe informally (and very briefly) what the function \texttt{SNOC} does.
\end{itemize}
\item Write a functional program \texttt{APPEND} that appends two lists.
Try to use SML notation.
\texttt{APPEND} should satisfy the following example behaviours
\begin{itemize}
\item \texttt{APPEND [1,2,3] [4,5] = [1,2,3,4,5]}
\item \texttt{APPEND [] [1] = [1]}
\end{itemize}
\item What is \emph{tail-recursion} and why is it important for functional programming?
\item Write a tail-recursive version of \texttt{APPEND}.
\end{enumerate}
\section{Induction Proofs}
\begin{enumerate}
\item Prove that the following method to calculate the sum of the first $n$ natural numbers is correct (notice $0 \notin \mathbb{N}$, i.\,e.\ $\mathbb{N} = \{1, 2, 3, \ldots\}$):
\[\forall n \in \mathbb{N}.\ \sum_{1 \leq i \leq n} i = \frac{n * (n+1)}{2}\]
\item Prove that \texttt{$\forall$x l.\ LENGTH (SNOC x l) = LENGTH l + 1} holds for the function \texttt{SNOC} given above. You can use arithmetic facts and the
following properties of \texttt{LENGTH}:
\begin{itemize}
\item \texttt{LENGTH [] = 0}
\item \texttt{$\forall$x xs.\ LENGTH (x ::\ xs) = LENGTH xs + 1}
\end{itemize}
\item Prove that \texttt{APPEND} is associative (hint: via induction). You can use the following
properties of \texttt{APPEND}. Use the notation \texttt{l1 ++ l2} for \texttt{APPEND l1 l2}.
\begin{itemize}
\item \texttt{$\forall$l.\ [] ++ l = l}
\item \texttt{$\forall$l x xs.\ (x ::\ xs) ++ l = x ::\ (xs ++ l)}
\end{itemize}
\item Which induction principles do you know? Which ones did you use above?
\end{enumerate}
\section{Logic}
\begin{enumerate}
\item Explain briefly what's wrong with the following reasoning:
``No cat has two tails. A cat has one more tail than no cat. Therefore, a cat has three tails.''
\item It is well known that in ancient times (a) all \emph{Spartans} were \emph{brave} and (b) all \emph{Athenians} were \emph{wise}.
Spartans and Athenians always fought with each other. So there was (c) no dual citizenship.
Once upon a time, 3 Greek philosophers met: Diogenes, Platon and Euklid. In contrast to their
famous namesakes, not much is known about them. We know however, that
(d) they all came from Sparta or Athens.
During their meeting, the 3 philosophers started to argue and finally insulted each other.
Being philosophers they were very careful not to tell a lie, though.
A few fragments of what they said have come to us through the centuries:
\begin{enumerate}
\item[(e)] Euklid: ``If Platon is from Sparta, then Diogenes is a coward.''
\item[(f)] Platon: ``Diogenes is a coward, provided Euklid is from Sparta.''
\item[(g)] Platon: ``If Diogenes is from Athens, then Euklid is a coward.''
\item[(h)] Diogenes: ``If Platon is from Athens, then Euklid is a moron.''
\end{enumerate}
Can you reconstruct from which town each of these philosophers came?
\begin{enumerate}
\item Formalise the relevant parts of the text above in first order logic. Model \emph{is coward} as \emph{is not brave} and \emph{is moron} as \emph{is not wise}.
\item Using the proof method of \emph{resolution} show that Platon is from Sparta. If you
don't know the resolution method, try to show it using some other method.
\item Which town did Euklid come from?
\end{enumerate}
\item Let the function \textit{myst} for all \textit{R} of type $\alpha \to \alpha \to \textit{bool}$ be given by
\[
\textit{myst}(\textit{R}) = \lambda a\, b.\ \forall Q. \left(
\begin{array}{cr}
\forall x.\ Q\, x\, x\ & \wedge \\
\forall x\,y.\ R\,x\,y\ \Longrightarrow\ Q\, x\, y\ & \wedge \\
\forall x\,y\,z.\ (Q\,x\,y\ \wedge\ Q\,y\,z)\ \Longrightarrow\ Q\,x\,z
\end{array}
\right) \Longrightarrow Q\,a\,b
\]
\begin{enumerate}
\item Which type does \textit{myst} have?
\item What concept does the type $\alpha \to \alpha \to \textit{bool}$ represent?
\item Translate the formula in English using as high level concepts as possible.
\item What concept does the function \textit{myst} define?
\end{enumerate}
\end{enumerate}
\section{General}
Do you have any comments or suggestions? Is there something that you
believe is relevant for selecting and prioritising topics of the
Interactive Theorem Proving course. I'm happy if you don't write
anything here.
\end{document}
%%% Local Variables:
%%% mode: latex
%%% TeX-master: t
%%% End:

121
questionnaire/questionnaire.tex Normal file
View File

@ -0,0 +1,121 @@
\documentclass[a4paper,11pt,oneside]{scrartcl}
\usepackage[utf8]{inputenc}
\usepackage[a4paper]{geometry}
\usepackage{hyperref}
\usepackage{url}
\usepackage{color}
\title{Background Questionaire}
\begin{document}
\begin{center}
\usekomafont{sectioning}\usekomafont{part} Background Questionaire
\end{center}
\bigskip
Please try to answer the following questions alone and without using any external aids and hand in the results \emph{anonymously}.
This is no exam.
Instead, the results are used to adapt the \emph{Interactive Theorem Proving} course to the background and interests of the audience.
\section{Functional Programming}
\begin{enumerate}
\item Write a functional program \texttt{APPEND} that appends two lists.
Try to use SML notation.
\texttt{APPEND} should satisfy the following example behaviours
\begin{itemize}
\item \texttt{APPEND [1,2,3] [4,5] = [1,2,3,4,5]}
\item \texttt{APPEND [] [1] = [1]}
\end{itemize}
\item What does \emph{tail-recursion} mean and why is it important for functional programming?
\item Write a tail-recursive version of \texttt{APPEND}.
\end{enumerate}
\section{Induction Proofs}
\begin{enumerate}
\item Prove that \texttt{APPEND} is associative (hint: via induction). You can use the following
properties of \texttt{APPEND} and \texttt{CONS}. For convenience use the notation \texttt{l1 ++ l2} for \texttt{APPEND l1 l2} and the notation \texttt{x::xs} for \texttt{CONS x xs}. Be very detailed and formal.
\begin{itemize}
\item \texttt{$\forall$ l.\ [] ++ xs = l}
\item \texttt{$\forall$ l x xs.\ (x ::\ xs) ++ l = x ::\ (xs ++ l)}
\end{itemize}
\item Which induction principles do you know? Which one did you use for proving the associativity of \texttt{APPEND}?
\end{enumerate}
\section{Logic}
\begin{enumerate}
\item Explain briefly what's wrong with the following reasoning:
``No cat has two tails. A cat has one more tail than no cat. Therefore, a cat has three tails.''
\item What's wrong with the following classical example of a false chain syllogism?
``Qui bene bibit, bene dormit; qui bene dormit, non peccat; qui non peccat, salvatur; ergo qui bene bibit, salvatur. (Ergo, bibamus!)'' (``Who drinks well, sleeps well. Who sleeps, does not sin. Who does not sin, will go to heaven. Therefore, who drinks well, will go to heaven. (So, let's drink!)'')
\item Formalise the following riddle\footnote{found in the German Wikipedia entry for resolution} using first order logic.
It is well known that in ancient times (a) all \emph{Spartans} were \emph{brave} and (b) all \emph{Athenians} were \emph{wise}.
Spartans and Athenians always fought with each other. So there was (c) no dual citizenship.
Once upon a time, 3 Greek philosophers met: Diogenes, Platon and Euklid. In contrast to their
famous namesakes, not much is known about them. We know however, that
(d) they all came from Sparta or Athens and did not like each other much.
Being philosophers they however never told a lie; even while insulting each other.
A few fragments of their squabbles have come to us through the centuries:
\begin{enumerate}
\item[(e)] Euklid: ``If Platon is from Sparta, then Diogenes is a coward.''
\item[(f)] Platon: ``Diogenes is a coward, provided Euklid is from Sparta.''
\item[(g)] Platon: ``If Diogenes is from Athens, then Euklid is a coward.''
\item[(h)] Diogenes: ``If Platon is from Athens, then Euklid is a moron.''
\end{enumerate}
Can you reconstruct where each of them came from?
Prove that Plato is from Sparta using \emph{resolution}.
\item Explain very briefly what \emph{Skolemisation} is?
\item Let the function \textit{myst} for all \textit{R} of type $\alpha \to \alpha \to \textit{bool}$ be given by
\[
\textit{myst}(\textit{R}) = \lambda a\, b.\ \forall Q. \left(
\begin{array}{cr}
\forall x.\ Q\, x\, x\ & \wedge \\
\forall x\,y.\ R\,x\,y\ \Longrightarrow\ Q\, x\, y\ & \wedge \\
\forall x\,y\,z.\ (Q\,x\,y\ \wedge\ Q\,y\,z)\ \Longrightarrow\ Q\,x\,z
\end{array}
\right) \Longrightarrow Q\,a\,b
\]
Which concept does the function \textit{myst} define? If you don't see it, describe as much
as possible. Which type does it have? What is represented by this type? Explain the formula in English using as high level concepts as possible.
\end{enumerate}
\section{General}
Please write down anything else that you believe is relevant for
selecting and prioritising topics of the Interactive Theorem Proving
course. Do you have any comments or suggestions? Why are you
attending the course? Do you have a concrete application in mind?
Have you used interactive theorem provers before? Which ones? Do you
have experience with other formal method tools like model checkers,
SAT solvers, SMT solvers, first order provers \ldots? Which ones?
\end{document}
%%% Local Variables:
%%% mode: latex
%%% TeX-master: t
%%% End: