@@ -15,7 +15,7 @@ or through https://www.irif.fr/users/letouzey/edu/proglmfi

...

@@ -15,7 +15,7 @@ or through https://www.irif.fr/users/letouzey/edu/proglmfi

## Day 1 : Kickstart

## Day 1 : Kickstart

For today, a simplistic OCaml programming environment will be good enough : http://try.ocamlpro.com . No local installation required, directly try there an OCaml phrase such as `let x = 1+2`. Also experiment with the "Editor" tab and its bottom buttons.

For today, a simplistic OCaml programming environment will be good enough : http://try.ocamlpro.com . No local installation required, directly try there an OCaml phrase suchandroid-studio-2020.3.1.24 as `let x = 1+2`. Also experiment with the "Editor" tab and its bottom buttons.

Of course, there are other OCaml environments that you could try later :

Of course, there are other OCaml environments that you could try later :

...

@@ -324,7 +324,7 @@ The head of a list (its leftmost element) can be accessed in constant time, just

...

@@ -324,7 +324,7 @@ The head of a list (its leftmost element) can be accessed in constant time, just

- Recode the concatenation of two lists that reverses the first one on the fly (cf `List.rev_append`). For instance `rev_append [1;2] [3;4] = [2;1;3;4]`.

- Recode the concatenation of two lists that reverses the first one on the fly (cf `List.rev_append`). For instance `rev_append [1;2] [3;4] = [2;1;3;4]`.

- Recode a reverse function on lists (a.k.a. mirror), cf. `List.rev`. If your solution as a quadratic complexity, try to find a linear solution.

- Recode a reverse function on lists (a.k.a. mirror), cf. `List.rev`. If your solution has a quadratic complexity, try to find a linear solution.

- Recode the filter function `List.filter`. From a boolean test function `f` and a list `l`, `List.filter f l` keeps only the elements `x` of `l` such that `f x`.

- Recode the filter function `List.filter`. From a boolean test function `f` and a list `l`, `List.filter f l` keeps only the elements `x` of `l` such that `f x`.