forked from ellisk42/ec
-
Notifications
You must be signed in to change notification settings - Fork 0
/
type.py
275 lines (204 loc) · 7.49 KB
/
type.py
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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
class UnificationFailure(Exception):
pass
class Occurs(UnificationFailure):
pass
class Type(object):
def __str__(self): return self.show(True)
def __repr__(self): return str(self)
class TypeConstructor(Type):
def __init__(self, name, arguments):
self.name = name
self.arguments = arguments
self.isPolymorphic = any(a.isPolymorphic for a in arguments)
def __eq__(self, other):
return isinstance(other, TypeConstructor) and \
self.name == other.name and \
all(x == y for x, y in zip(self.arguments, other.arguments))
def __hash__(self): return hash((self.name,) + tuple(self.arguments))
def __ne__(self, other):
return not (self == other)
def show(self, isReturn):
if self.name == ARROW:
if isReturn:
return "%s %s %s" % (self.arguments[0].show(
False), ARROW, self.arguments[1].show(True))
else:
return "(%s %s %s)" % (self.arguments[0].show(
False), ARROW, self.arguments[1].show(True))
elif self.arguments == []:
return self.name
else:
return "%s(%s)" % (self.name, ", ".join(x.show(True)
for x in self.arguments))
def isArrow(self): return self.name == ARROW
def functionArguments(self):
if self.name == ARROW:
xs = self.arguments[1].functionArguments()
return [self.arguments[0]] + xs
return []
def returns(self):
if self.name == ARROW:
return self.arguments[1].returns()
else:
return self
def apply(self, context):
if not self.isPolymorphic:
return self
return TypeConstructor(self.name,
[x.apply(context) for x in self.arguments])
def occurs(self, v):
if not self.isPolymorphic:
return False
return any(x.occurs(v) for x in self.arguments)
def negateVariables(self):
return TypeConstructor(self.name,
[a.negateVariables() for a in self.arguments])
def instantiate(self, context, bindings=None):
if not self.isPolymorphic:
return context, self
if bindings is None:
bindings = {}
newArguments = []
for x in self.arguments:
(context, x) = x.instantiate(context, bindings)
newArguments.append(x)
return (context, TypeConstructor(self.name, newArguments))
def canonical(self, bindings=None):
if not self.isPolymorphic:
return self
if bindings is None:
bindings = {}
return TypeConstructor(self.name,
[x.canonical(bindings) for x in self.arguments])
class TypeVariable(Type):
def __init__(self, j):
assert isinstance(j, int)
self.v = j
self.isPolymorphic = True
def __eq__(self, other):
return isinstance(other, TypeVariable) and self.v == other.v
def __ne__(self, other): return not (self.v == other.v)
def __hash__(self): return self.v
def show(self, _): return "t%d" % self.v
def returns(self): return self
def isArrow(self): return False
def functionArguments(self): return []
def apply(self, context):
for v, t in context.substitution:
if v == self.v:
return t.apply(context)
return self
def occurs(self, v): return v == self.v
def instantiate(self, context, bindings=None):
if bindings is None:
bindings = {}
if self.v in bindings:
return (context, bindings[self.v])
new = TypeVariable(context.nextVariable)
bindings[self.v] = new
context = Context(context.nextVariable + 1, context.substitution)
return (context, new)
def canonical(self, bindings=None):
if bindings is None:
bindings = {}
if self.v in bindings:
return bindings[self.v]
new = TypeVariable(len(bindings))
bindings[self.v] = new
return new
def negateVariables(self):
return TypeVariable(-1 - self.v)
class Context(object):
def __init__(self, nextVariable=0, substitution=[]):
self.nextVariable = nextVariable
self.substitution = substitution
def extend(self, j, t):
return Context(self.nextVariable, [(j, t)] + self.substitution)
def makeVariable(self):
return (Context(self.nextVariable + 1, self.substitution),
TypeVariable(self.nextVariable))
def unify(self, t1, t2):
t1 = t1.apply(self)
t2 = t2.apply(self)
if t1 == t2:
return self
# t1&t2 are not equal
if not t1.isPolymorphic and not t2.isPolymorphic:
raise UnificationFailure(t1, t2)
if isinstance(t1, TypeVariable):
if t2.occurs(t1.v):
raise Occurs()
return self.extend(t1.v, t2)
if isinstance(t2, TypeVariable):
if t1.occurs(t2.v):
raise Occurs()
return self.extend(t2.v, t1)
if t1.name != t2.name:
raise UnificationFailure(t1, t2)
k = self
for x, y in zip(t2.arguments, t1.arguments):
k = k.unify(x, y)
return k
def __str__(self):
return "Context(next = %d, {%s})" % (self.nextVariable, ", ".join(
"t%d ||> %s" % (k, v.apply(self)) for k, v in self.substitution))
def __repr__(self): return str(self)
Context.EMPTY = Context(0, [])
def canonicalTypes(ts):
bindings = {}
return [t.canonical(bindings) for t in ts]
def instantiateTypes(context, ts):
bindings = {}
newTypes = []
for t in ts:
context, t = t.instantiate(context, bindings)
newTypes.append(t)
return context, newTypes
def baseType(n): return TypeConstructor(n, [])
tint = baseType("int")
treal = baseType("real")
tbool = baseType("bool")
tboolean = tbool # alias
tcharacter = baseType("char")
def tlist(t): return TypeConstructor("list", [t])
def tpair(a, b): return TypeConstructor("pair", [a, b])
def tmaybe(t): return TypeConstructor("maybe", [t])
tstr = tlist(tcharacter)
t0 = TypeVariable(0)
t1 = TypeVariable(1)
t2 = TypeVariable(2)
# regex types
tpregex = baseType("pregex")
ARROW = "->"
def arrow(*arguments):
if len(arguments) == 1:
return arguments[0]
return TypeConstructor(ARROW, [arguments[0], arrow(*arguments[1:])])
def inferArg(tp, tcaller):
ctx, tp = tp.instantiate(Context.EMPTY)
ctx, tcaller = tcaller.instantiate(ctx)
ctx, targ = ctx.makeVariable()
ctx = ctx.unify(tcaller, arrow(targ, tp))
return targ.apply(ctx)
def guess_type(xs):
"""
Return a TypeConstructor corresponding to x's python type.
Raises an exception if the type cannot be guessed.
"""
if all(isinstance(x, bool) for x in xs):
return tbool
elif all(isinstance(x, int) for x in xs):
return tint
elif all(isinstance(x, str) for x in xs):
return tstr
elif all(isinstance(x, list) for x in xs):
return tlist(guess_type([y for ys in xs for y in ys]))
else:
raise ValueError("cannot guess type from {}".format(xs))
def guess_arrow_type(examples):
a = len(examples[0][0])
input_types = []
for n in range(a):
input_types.append(guess_type([xs[n] for xs, _ in examples]))
output_type = guess_type([y for _, y in examples])
return arrow(*(input_types + [output_type]))