Functional Programming & Proofs
Sample Applications
Sets' logic
How to ...
- Find if an element is in a list ?
- Compute the common elements of 2 lists (i.e. set's intersection) ?
- Remove elements from a list (i.e. set's difference) ?
- Get the "union" of two sets ?
- Remove duplicate elements from a list (i.e. transform into a "set") ?
- Explain how to define
map
, filter
or @
with reduce/fold
?
- Give some properties of
reduce/fold
.
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide
docteur dr laurent thiry uha mulhouse france functional programming fsharp proof theory coq coqide