-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsource0.ml
More file actions
146 lines (121 loc) · 3.5 KB
/
source0.ml
File metadata and controls
146 lines (121 loc) · 3.5 KB
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
open Position
type program_with_locations =
(binding located * term' located) list
and program =
(binding * term) list
and 't t =
| Var of identifier
| App of 't * 't
| Lam of binding * 't
| Pair of 't * 't
| Fst of 't
| Snd of 't
| Literal of literal
| Primitive of primitive
and term' = term' Position.located t
and term = term t
and binding = identifier * (typ option)
and typ =
| TyConstant of type_constant
| TyArrow of typ * typ
| TyPair of typ * typ
| TyVar of tvar
(** The type variable have a mutable field for their current definition.
It allows us to avoid explicit substitution *)
and tvar =
{ id : int;
mutable def : typ option }
and literal =
| Float of float
and primitive =
| Sin | Cos | Exp | Inv
| Add | Mul | Neg
and type_constant =
| TyFloat
and identifier = Id of string
and type_identifier = TyId of string
let rec map f = function
| App (a, b) -> App (f (map f a), f (map f b))
| Lam (b, t) -> Lam (b, f (map f t))
| Pair (a, b) -> Pair (f a, f b)
| Fst a -> Fst (f a)
| Snd a -> Snd (f a)
| Var x -> Var x
| Literal l -> Literal l
| Primitive p -> Primitive p
let make_lambda_abstraction_with_locations bs t =
let rec aux = function
| [] ->
t
| b :: bs ->
let pos = Position.(join (position b) (position t)) in
Position.with_pos pos (Lam (value b, aux bs))
in
aux bs
let make_lambda_abstraction bs t =
Position.value (make_lambda_abstraction_with_locations bs t)
let make_let b t1 t2 =
App (make_lambda_abstraction_with_locations [b] t2, t1)
let rec remove_locations = function
| App (a, b) -> App (remove_locations' a, remove_locations' b)
| Lam (b, t) -> Lam (b, remove_locations' t)
| Pair (a, b) -> Pair (remove_locations' a, remove_locations' b)
| Fst a -> Fst (remove_locations' a)
| Snd a -> Snd (remove_locations' a)
| Var x -> Var x
| Literal l -> Literal l
| Primitive p -> Primitive p
and remove_locations' t = remove_locations (Position.value t)
let remove_locations_in_program (p : program_with_locations) : program =
List.map (fun (b, t) -> Position.(value b, remove_locations (value t))) p
let string_of_literal = function
| Float f -> "("^(string_of_float f)^")"
let string_of_primitive = function
| Sin -> "sin"
| Cos -> "cos"
| Exp -> "exp"
| Inv -> "inv"
| Add -> "add"
| Mul -> "mul"
| Neg -> "neg"
let string_of_term unbox =
PPrintEngine.(
let rec term = function
| Var (Id x) ->
string x
| Pair (a, b) ->
PPrintCombinators.(
parens (group (term' a ^^ comma) ^^ break 1 ^^ term' b)
)
| Snd a ->
group (string "snd" ^^ break 1 ^^ term' a)
| Fst a ->
group (string "fst" ^^ break 1 ^^ term' a)
| App (a, b) ->
mayparen_term' a ^^ break 1 ^^ term' b
| Lam (bs, t) ->
string "fun " ^^ binding bs
^^ string " ->" ^^ break 1 ^^ term' t
| Literal l ->
string (string_of_literal l)
| Primitive p ->
string (string_of_primitive p)
and term' t = term (unbox t)
and mayparen_term' p =
mayparen_term (unbox p)
and mayparen_term t =
match t with
| Lam _ ->
string "(" ^^ (term t) ^^ string ")"
| _ ->
term t
and binding (Id x, _) =
string x
in
fun t ->
let b = Buffer.create 37 in
PPrintEngine.ToBuffer.pretty 0.7 80 b (term t);
Buffer.contents b
)
let string_of_term' = string_of_term Position.value
let string_of_term = string_of_term (fun x -> x)