1
0
mirror of https://github.com/dhil/phd-dissertation synced 2026-03-13 02:58:26 +00:00

Rewording

This commit is contained in:
2020-10-21 01:53:27 +01:00
parent efcdcd49a2
commit a0ed7d2dfd

View File

@@ -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