lgallet/epicours
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2023-10-16 13:59:49

Browse Source
This commit is contained in:
Louis Gallet 2023-10-16 13:59:49 +02:00
parent 7e268ea3b7
commit 3c5fd625a5
Signed by: lgallet
SSH Key Fingerprint: SHA256:qnW7pk4EoMRR0UftZLZQKSMUImbEFsiruLC7jbCHJAY
2 changed files with 22 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
.obsidian/workspace.json vendored
View File

@ -31,8 +31,7 @@
}
}
}
],
"currentTab": 1
]
}
],
"direction": "vertical"
@ -98,7 +97,7 @@
"state": {
"type": "backlink",
"state": {
"file": "Algo/Courses/Chapter 6 - Lists.md",
"file": "Algo/Courses/Chapter 6 - Lists (Exercises).md",
"collapseAll": false,
"extraContext": false,
"sortOrder": "alphabetical",
@ -115,7 +114,7 @@
"state": {
"type": "outgoing-link",
"state": {
"file": "Algo/Courses/Chapter 6 - Lists.md",
"file": "Algo/Courses/Chapter 6 - Lists (Exercises).md",
"linksCollapsed": false,
"unlinkedCollapsed": true
}
@ -138,7 +137,7 @@
"state": {
"type": "outline",
"state": {
"file": "Algo/Courses/Chapter 6 - Lists.md"
"file": "Algo/Courses/Chapter 6 - Lists (Exercises).md"
}
}
},
@ -169,10 +168,10 @@
"command-palette:Open command palette": false
}
},
"active": "26919eaeae9a8f38",
"active": "eaf65669cfff2a2c",
"lastOpenFiles": [
"Algo/Courses/Chapter 6 - Lists (Exercises).md",
"Algo/Courses/Chapter 6 - Lists.md",
"Algo/Courses/Chapter 6 - Lists (Exercises).md",
"Algo/Séminaire/Chapter 1 - CAML basics.md",
"Prog/Loops.md",
"Algo/Séminaire/Chapter 5 - Recursivity.md",

16
Algo/Courses/Chapter 6 - Lists (Exercises).md
View File

@ -220,3 +220,19 @@ val reverse : 'a list -> 'a list = <fun>
in rev [] l
val reverse: 'a list -> 'a list = <fun>
```
## Exercise 3.6
```Ocaml
let rec equals l = function
| [] when l = [] -> true
| [] -> false
| e::t -> if l = [] then false else (let e2::l2 = l in e = e2 + equal (l-1))
val equals = 'a list -> 'a list -> bool = <fun>
```
## Exercise 3.7
```Ocaml
let shared l1 l2 = function
| [] -> []
| e::t -> let rec s l2 = function
|e::t ->