diff options
| author | David A. Madore <david+git@madore.org> | 2026-10-01 15:39:42 +0200 |
|---|---|---|
| committer | David A. Madore <david+git@madore.org> | 2026-10-01 15:39:42 +0200 |
| commit | ba309f3d2c416eb056e3bb6a52da783e9bf8744a (patch) | |
| tree | ef4f30c566dd8f7cb477f28adc55eda35fd800fe /transp-inf110-01-calc.tex | |
| parent | c06e51d680ca479f1002461100888e50be827a54 (diff) | |
| download | inf110-lfi-ba309f3d2c416eb056e3bb6a52da783e9bf8744a.tar.gz inf110-lfi-ba309f3d2c416eb056e3bb6a52da783e9bf8744a.tar.bz2 inf110-lfi-ba309f3d2c416eb056e3bb6a52da783e9bf8744a.zip | |
Pointed out by LLMs while converting slides to expanded handout.
Diffstat (limited to 'transp-inf110-01-calc.tex')
| -rw-r--r-- | transp-inf110-01-calc.tex | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/transp-inf110-01-calc.tex b/transp-inf110-01-calc.tex index 8ebfc53..145ed81 100644 --- a/transp-inf110-01-calc.tex +++ b/transp-inf110-01-calc.tex @@ -1239,7 +1239,7 @@ induction suivant la déf\textsuperscript{n} de $\mathbf{R}$ \[ \begin{aligned} \varphi_e^{(k+1)}(\underline{x},0) &= g(\underline{x})\\ -\varphi_e^{(k+1)}(\underline{x},z+1) &= h(\underline{x},f(\underline{x},z),z) +\varphi_e^{(k+1)}(\underline{x},z+1) &= h(\underline{x}, \varphi_e^{(k+1)}(\underline{x},z),z) \end{aligned} \] \item si $e = \dbllangle 5, k, c\dblrangle$ et $g := @@ -3267,7 +3267,7 @@ d'entiers naturels. \bigskip -\itempoint La fonction $T \mapsto 1$ qui à un terme $T$ associe $0$ si +\itempoint La fonction qui à un terme $T$ associe $0$ si $T$ est en forme normale et $1$ si non, \textbf{est p.r.} \medskip @@ -3469,7 +3469,7 @@ $\pi_1,\pi_2$ (projections). est représentée par \[ \lambda x_1\cdots x_k z. -\pi_1(z(\lambda p.\Pi(w x_1\cdots x_k (\pi_1 p)(\pi_2 p))A(\pi_2 p))(\Pi(vx_1\cdots x_k)\overline{0})) +\pi_1(z(\lambda p.\Pi(w x_1\cdots x_k (\pi_1 p)(\pi_2 p))(A(\pi_2 p)))(\Pi(vx_1\cdots x_k)\overline{0})) \] où \[ @@ -3598,8 +3598,8 @@ Cette fois : &= (\lambda f. ((\lambda x.f(\lambda v.x x v)) (\lambda x.f(\lambda v.x x v))))(\lambda h.E)\\ &\rightarrow (\lambda x.(\lambda h.E)(\lambda v.x x v)) (\lambda x.(\lambda h.E)(\lambda v.x x v)) =: h_{\mathrm{fix}}\\ -&\rightarrow (\lambda h.E)(\lambda v.(\lambda x.(\lambda h.E)(x x)) (\lambda x.(\lambda h.E)(x x))v) -= (\lambda h.E)(\lambda v. h_{\mathrm{fix}} v)\\ +&\rightarrow (\lambda h.E)(\lambda v.(\lambda x.(\lambda h.E)(\lambda v.x x v)) (\lambda x.(\lambda h.E)(\lambda v.x x v))v)\\ +&= (\lambda h.E)(\lambda v. h_{\mathrm{fix}} v)\\ &\rightarrow E[h\backslash \lambda v. h_{\mathrm{fix}} v] \text{~(substitution de $\lambda v. h_{\mathrm{fix}} v$ pour $h$ dans $E$)} \end{aligned} |
