Chapitre 1. Introduction Bases de la programmation en Caml I
•
•
n! = 1n= 0
n×(n−1)!
g: (x, y)−> x +y
f(x) = g(1, x)f
f
f g
g
[−262,262 −1] 263
[−230,230 −1] 231
6
7
8
9
10
11
12
13
14
1
/
14
100%
6
7
8
9
10
11
12
13
14
