From a0ed7d2dfd5a177b5aa126bc410c6b1c0f1efeaa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20Hillerstr=C3=B6m?= <daniel.hillerstrom@ed.ac.uk>
Date: Wed, 21 Oct 2020 01:53:27 +0100
Subject: [PATCH] Rewording

---
 thesis.tex | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/thesis.tex b/thesis.tex
index 0cc5fd0..294dfab 100644
--- a/thesis.tex
+++ b/thesis.tex
@@ -332,8 +332,10 @@ $R^n$, is defined inductively.
   R^0 \defas \emptyset, \quad\qquad R^1 \defas R, \quad\qquad R^{1 + n} \defas R \circ R^n.
 \]
 %
-Reflexive and transitive relations and their closures feature
-prominently in the dynamic semantics of programming languages.
+Homogeneous relations play a prominent role in the design and
+operational understanding of programming languages. There are two
+particular properties and associated closure operations of homogeneous
+relations that reoccur throughout this dissertation.
 %
 \begin{definition}
   A homogeneous relation $R \subseteq A \times A$ is said to be