-
Notifications
You must be signed in to change notification settings - Fork 28
/
examples
55 lines (37 loc) · 849 Bytes
/
examples
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
-----------------------------------------------------
Closures, Currying, and Partial Application
-----------------------------------------------------
1.
let x = 2;;
let f y = x + y;;
let x = 4;;
f 3;;
2.
int -> string -> bool
3. Write a function 'add_n n lst' that adds 'n' to every element of the list without using recursion
--------------------------------------------------------
Imperative OCaml and Mutability
--------------------------------------------------------
1.
let z = 3;;
let x = ref z;;
2. !x
3. x := 4
4.
let y = x;;
x := 4;;
!y;;
5.
let print_both (s, t) =
print_string s;
print_string t;
0
;;
let number = print_both ("Hello", "World") in
number + 1
;;
6.
type point = { x : int; y : int; mutable color : string };;
let p = { x = 0; y = 0; color = "red" };;
p.color <- "white";;
p.x <- 1;;