/
haskell.primitives.js
336 lines (293 loc) · 10.6 KB
/
haskell.primitives.js
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
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
(function(primitives, ast, interpreter){
primitives.prim = function(env) {
// data Char#
// gtChar# :: Char# -> Char# -> Bool
env.bind("gtChar#", createPrimitive(env, 2, gtPrim));
// geChar# :: Char# -> Char# -> Bool
env.bind("geChar#", createPrimitive(env, 2, gePrim));
// eqChar# :: Char# -> Char# -> Bool
env.bind("eqChar#", createPrimitive(env, 2, eqPrim));
// neChar# :: Char# -> Char# -> Bool
env.bind("neChar#", createPrimitive(env, 2, nePrim));
// ltChar# :: Char# -> Char# -> Bool
env.bind("ltChar#", createPrimitive(env, 2, ltPrim));
// leChar# :: Char# -> Char# -> Bool
env.bind("leChar#", createPrimitive(env, 2, lePrim));
// ord# :: Char# -> Int#
env.bind("ord#", createPrimitive(env, 1,
function(env, args) {
return args[0].charCodeAt(0);
}));
// data Int#
var intSize = 32;
var maxInt = (1 << (intSize-1));
var minInt = (-1 >>> 1);
// (+#) :: Int# -> Int# -> Int#
env.bind("+#", createPrimitive(env, 2, primAdd(intSize, true)));
// (-#) :: Int# -> Int# -> Int#
env.bind("-#", createPrimitive(env, 2, primSub(intSize, true)));
// (*#) :: Int# -> Int# -> Int#
env.bind("*#", createPrimitive(env, 2, primMul(intSize, true)));
// mulIntMayOflo# :: Int# -> Int# -> Int#
env.bind("mulIntMayOflo#", createPrimitive(env, 2,
function(env, args) {
var filter = 0xFFFF << 16;
return (args[0] & filter) | (args[1] & filter);
}));
// quotInt# :: Int# -> Int# -> Int#
env.bind("quotInt#", createPrimitive(env, 2, primQuot(intSize, true)));
// remInt# :: Int# -> Int# -> Int#
env.bind("remInt#", createPrimitive(env, 2, primRem(intSize, true)));
// negateInt# :: Int# -> Int#
env.bind("negateInt#", createPrimitive(env, 1, primNegate(intSize, true)));
// addIntC# :: Int# -> Int# -> (#Int#, Int##)
env.bind("addIntC#", createPrimitive(env, 2,
function(env, args) {
var result = args[0] + args[1];
var carry = (result > maxInt) || (result < minInt)
return [doPrimtOverflow(intSize, true, result), 0+carry];
}));
// subIntC# :: Int# -> Int# -> (#Int#, Int##)
env.bind("subIntC#", createPrimitive(env, 2,
function(env, args) {
var result = args[0] - args[1];
var carry = (result > maxInt) || (result < minInt)
return [doPrimtOverflow(intSize, true, result), 0+carry];
}));
// (>#) :: Int# -> Int# -> Bool
env.bind(">#", createPrimitive(env, 2, gtPrim));
// (>=#) :: Int# -> Int# -> Bool
env.bind(">=#", createPrimitive(env, 2, gePrim));
// (==#) :: Int# -> Int# -> Bool
env.bind("==#", createPrimitive(env, 2, eqPrim));
// (/=#) :: Int# -> Int# -> Bool
env.bind("/=#", createPrimitive(env, 2, nePrim));
// (<#) :: Int# -> Int# -> Bool
env.bind("<#", createPrimitive(env, 2, ltPrim));
// (<=#) :: Int# -> Int# -> Bool
env.bind("<=#", createPrimitive(env, 2, lePrim));
// chr# :: Int# -> Char#
env.bind("chr#", createPrimitive(env, 1,
function(env, args) {
return String.fromCharCode(args[0]);
}));
// int2Word# :: Int# -> Word#
env.bind("int2Word#", createPrimitive(env, 1, primNarrow(32, true)));
// int2Float# :: Int# -> Float#
env.bind("int2Float#", createPrimitive(env, 1, primNarrow(32, true)));
// int2Double# :: Int# -> Double#
env.bind("int2Double#", createPrimitive(env, 1, primNarrow(64, true)));
// uncheckedIShiftL# :: Int# -> Int# -> Int#
env.bind("uncheckedIShiftL#", createPrimitive(env, 2, uncheckedIShiftL));
// uncheckedIShiftRA# :: Int# -> Int# -> Int#
env.bind("uncheckedIShiftRA#", createPrimitive(env, 2, uncheckedIShiftRA));
// uncheckedIShiftRL# :: Int# -> Int# -> Int#
env.bind("uncheckedIShiftRL#", createPrimitive(env, 2, uncheckedIShiftRL));
// plusWord# :: Word# -> Word# -> Word#
// minusWord# :: Word# -> Word# -> Word#
// timesWord# :: Word# -> Word# -> Word#
// quotWord# :: Word# -> Word# -> Word#
// remWord# :: Word# -> Word# -> Word#
// and# :: Word# -> Word# -> Word#
// or# :: Word# -> Word# -> Word#
// xor# :: Word# -> Word# -> Word#
// not# :: Word# -> Word#
// uncheckedShiftL# :: Word# -> Int# -> Word#
// Shift left logical. Result undefined if shift amount is not in the range 0 to word size - 1 inclusive.
// uncheckedShiftRL# :: Word# -> Int# -> Word#
// Shift right logical. Result undefined if shift amount is not in the range 0 to word size - 1 inclusive.
// word2Int# :: Word# -> Int#
// word2Integer# :: Word# -> (#Int#, ByteArr##)
// gtWord# :: Word# -> Word# -> Bool
// geWord# :: Word# -> Word# -> Bool
// eqWord# :: Word# -> Word# -> Bool
// neWord# :: Word# -> Word# -> Bool
// ltWord# :: Word# -> Word# -> Bool
// leWord# :: Word# -> Word# -> Bool
// Some extras:
// intToString# :: Int# -> String#
env.bind("intToString#", createPrimitive(env, 1, function(env, args) {
return "" + args[0];
}));
// alert# -> String# -> () -- This should be IO ()
env.bind("alert#", createPrimitive(env, 1, function(env, args) {
// TODO: Are we sure that primitives are evaluated?
alert(args[0]);
return new interpreter.Data("()", []);
}));
// debug# :: a -> () -- This should be IO (), outputs an unforced expression. "as is"
env.bind("debug#", createPrimitive(env, 1, function(env, args) {
console.log("debug#: %o", args[0]);
return new interpreter.Data("()", []);
}));
env.bind("stepDebug#", parameterCollector(env, 1, function(env, args) {
var step = args[0];
var pending = [step];
var stepN = 0;
while (pending.length>0) {
console.log("step %i: %o", ++stepN, step.stringify());
var newPending = [];
for (var i in pending) {
var v = pending[i].dereference();
if (v instanceof interpreter.Data)
{
newPending = newPending.concat(v.getPtrs());
}
}
pending = newPending;
}
console.log("done: ", step.stringify());
return new interpreter.Data("()", []);
}));
};
primitives.init = function(env) {
primitives.prim(env);
// seq :: a -> b -> b
env.bind("seq", createPrimitive(env, 2,
function(env, args) {
args[0].force();
return args[1];
}));
// Can print all different haskell types (including functions...)
// Should be hidden away and only used for the deriving Show implementation.
// defaultShow :: a -> String#
env.bind("defaultShow", createPrimitive(env, 1,
function(env) {
alert("undefined");
}));
env.bind(":", createDataConstructor(env, ":", 2));
env.bind("[]", createDataConstructor(env, "[]", 0));
};
function parameterCollector(env, numArgs, func) {
var args = [];
for (var i = 0; i<numArgs; i++) {
args[i] = "__p" + i;
};
var primitive = function(env) {
var givenArgs=[];
for (var i in args) {
givenArgs[i] = env.lookup(args[i]);
};
return func(env, givenArgs);
};
var expr = new ast.Primitive(primitive);
var argsR = [].concat(args).reverse();
for (var i in argsR) {
expr = new ast.Lambda(new ast.VariableBinding(argsR[i]), expr);
};
return new interpreter.HeapPtr(new interpreter.Closure(env, expr));
};
var createPrimitive = function(env, numArgs, func) {
if (numArgs.length != undefined) {
numArgs = numArgs.length; // KLUDGE: createPrimitive should take a number instead of an argument list
}
var prim = function(env, args) {
var dereferencedArgs = []
for (var i in args) {
dereferencedArgs[i] = args[i].dereference();
}
return func(env, dereferencedArgs);
};
return parameterCollector(env, numArgs, prim);
};
primitives.createPrimitive = createPrimitive;
function createDataConstructor(env, ident, num) {
var prim = function(env, args) {
return new interpreter.Data(ident, args);
};
return parameterCollector(env, num, prim);
};
primitives.createDataConstructorKludge = createDataConstructor;
function forceHead(thunk) {
while(thunk.type!="ConstantThunk" && thunk.type!="Data") {
thunk=thunk.force();
};
return thunk;
};
function boxBool(env, b) {
if (b) {
return env.lookup("True").dereference();
};
return env.lookup("False").dereference();
};
function gtPrim(env, args) {
return boxBool(env, args[0] > args[1]);
};
function gePrim(env, args) {
return boxBool(env, args[0] >= args[1]);
};
function eqPrim(env, args) {
return boxBool(env, args[0] == args[1]);
};
function nePrim(env, args) {
return boxBool(env, args[0] != args[1]);
};
function ltPrim(env, args) {
return boxBool(env, args[0] < args[1]);
};
function lePrim(env, args) {
return boxBool(env, args[0] <= args[1]);
};
function primAdd(bits, twoComplement) {
return function(env, args) {
var result = args[0] + args[1];
return doPrimOverflow(bits, twoComplement, result);
};
};
function primSub(bits, twoComplement) {
return function(env, args) {
var result = args[0] - args[1];
return doPrimOverflow(bits, twoComplement, result);
};
};
function primMul(bits, twoComplement) {
return function(env, args) {
var result = args[0] * args[1];
return doPrimOverflow(bits, twoComplement, result);
};
};
function primQuot(bits, twoComplement) {
return function(env, args) {
var result = parseInt(args[0] / args[1]);
return doPrimOverflow(bits, twoComplement, result);
};
};
function primRem(bits, twoComplement) {
return function(env, args) {
var result = args[0] % args[1];
return doPrimOverflow(bits, twoComplement, result);
};
};
function primNegate(bits, twoComplement) {
return function(env, args) {
var result = -args[0];
return doPrimOverflow(bits, twoComplement, result);
};
};
function primNarrow(bits, twoComplement) {
return function(env, args) {
return doPrimNarrow(bits, twoComplement, args[0]);
};
};
// Narrows a number by chopping of the higher bits
function doPrimNarrow(bits, twoComplement, num) {
num = num & (Math.pow(2, bits+1) - 1);
if (twoComplement && (num & Math.pow(2, bits))) {
return num - Math.pow(2, bits);
};
return num;
};
// Narrows a number by overflowing it
function doPrimOverflow(bits, twoComplement, num) {
return doPrimNarrow(bits, twoComplement, num);
};
function uncheckedIShiftL(env, args) {
return args[0] << args[1];
};
function uncheckedIShiftRA(env, args) {
return args[0] >> args[1];
};
function uncheckedIShiftRL(env, args) {
return args[0] >>> args[1];
};
})(haskell.primitives, haskell.ast, haskell.interpreter);