Tentative de réponse à la fin de la question 1

(je vois pas ce qu'on peut dire de plus)

dm.tex

@@ -61,6 +61,9 @@ To do so, we define the set of value as:
 	Value_n &= \mathbb{N} \cup (Field \rightharpoonup Value_{n+1}) \\
 \end{align*}
 
+Because the variables are updated by copying, the codomain of the partial application is merely $Value$.
+There is no references system.
+
 \subsection{Denotational Semantic for expressions}
 
 We define $\mathcal{A}$ the denotational semantics of arithmetic expressions as:
@@ -79,8 +82,6 @@ where
 For the undefined cases, for example when we try to add two records, we also note $\mathcal{A}|[e|] \sigma = \bot$.
 In the rest of this homwork, we suppose $\mathcal{B}|[ \bullet |]$ the denotational semantic for booleans expressions already defined.
 
-% TODO fin de la question : explications
-
 \subsection{Structural Operational Semantic for commands}
 
 We define $->$ the structural operational semantics for commands as: