From 25d524a73288d18ab23ec3e796c59e3acda2ef9b Mon Sep 17 00:00:00 2001
From: Lukas Pietzschmann <lukas.pietzschmann@outlook.de>
Date: Tue, 15 Oct 2024 21:50:30 +0200
Subject: [PATCH] Confluence properties slides

---
 talk.tex | 33 +++++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)

diff --git a/talk.tex b/talk.tex
index 0af3b88..07011b1 100644
--- a/talk.tex
+++ b/talk.tex
@@ -432,6 +432,39 @@ \section{Some interesting examples}
 	\end{itemize}
 \end{frame}
 
+\begin{frame}
+	\frametitle[Why we need it]{Confluence}
+	\begin{wide}
+	\begin{itemize}
+		\item If a program terminates, we can check if it's confluent
+		\item If it is, we get more cool properties for free:
+	\end{itemize}
+	\begin{columns}[b]
+		\begin{column}{0.49\textwidth}
+			\begin{block}[Incrementality]
+				\begin{itemize}
+					\item We can add constraints during the program's execution
+					\item They will eventually participate in the computation
+					\item The result will be the same as if was there from the beginning
+				\end{itemize}
+			\end{block}
+		\end{column}
+		\begin{column}{0.49\textwidth}
+			\begin{block}[Parallelism]
+				\begin{itemize}
+					\item The algorithm can be executed in parallel
+					\item Without any modifications
+				\end{itemize}
+			\end{block}
+		\end{column}
+	\end{columns}
+	\end{wide}
+\end{frame}
+
+\begin{frame}
+	\frametitle[Map-Reduce in CHR]{Declarative Concurrency}
+\end{frame}
+
 \section{References}
 \defbibheading{bibliography}[\bibname]{}