edict-lang 1.2.0 → 1.5.0

package/dist/codegen/compile-scalars.js

@@ -0,0 +1,210 @@
+// =============================================================================
+// Scalar expression compilers — literal, ident, binop, unop, if, let, block
+// =============================================================================
+import binaryen from "binaryen";
+import { wasmValidationError } from "../errors/structured-errors.js";
+import { edictTypeToWasm, } from "./types.js";
+import { allocClosurePair } from "./closures.js";
+import { compileExpr, inferExprWasmType } from "./codegen.js";
+export function compileLiteral(expr, cc) {
+    const { mod, strings } = cc;
+    const val = expr.value;
+    if (typeof val === "boolean") {
+        return mod.i32.const(val ? 1 : 0);
+    }
+    // Int64 literal — value may be string (for >2^53 precision) or number
+    if (expr.type?.kind === "basic" && expr.type.name === "Int64") {
+        try {
+            const big = BigInt(val);
+            const low = Number(big & 0xffffffffn);
+            const high = Number((big >> 32n) & 0xffffffffn);
+            return mod.i64.const(low, high);
+        }
+        catch {
+            cc.errors.push(wasmValidationError(`invalid Int64 literal value: ${JSON.stringify(val)}`));
+            return mod.unreachable();
+        }
+    }
+    if (typeof val === "number") {
+        // Check type annotation first — 0.0 is integer in JS but Float in Edict
+        if (expr.type && expr.type.kind === "basic" && expr.type.name === "Float") {
+            return mod.f64.const(val);
+        }
+        if (Number.isInteger(val)) {
+            return mod.i32.const(val);
+        }
+        return mod.f64.const(val);
+    }
+    if (typeof val === "string") {
+        const interned = strings.intern(val);
+        // Return the pointer (offset). The caller/callee will also need
+        // the length — for builtin calls we handle this specially in compileCall.
+        return mod.i32.const(interned.offset);
+    }
+    return mod.unreachable();
+}
+export function compileIdent(expr, cc, ctx) {
+    const { mod } = cc;
+    const local = ctx.getLocal(expr.name);
+    if (local) {
+        return mod.local.get(local.index, local.type);
+    }
+    // Check module-level const globals
+    const globalType = cc.constGlobals.get(expr.name);
+    if (globalType !== undefined) {
+        return mod.global.get(expr.name, globalType);
+    }
+    // Check function table — return a closure pair (table_index, env_ptr=0)
+    // This enables `let f = myFunc` to store a function reference as a closure
+    const tableIndex = cc.fnTableIndices.get(expr.name);
+    if (tableIndex !== undefined) {
+        return allocClosurePair(mod, ctx, mod.i32.const(tableIndex), mod.i32.const(0), `ident_${expr.name}`);
+    }
+    return mod.unreachable();
+}
+export function compileBinop(expr, cc, ctx) {
+    const { mod, errors } = cc;
+    const left = compileExpr(expr.left, cc, ctx);
+    const right = compileExpr(expr.right, cc, ctx);
+    // Determine the WASM type from the left operand.
+    // Type checker guarantees matching types for both operands.
+    const opType = inferExprWasmType(expr.left, cc, ctx);
+    const isFloat = opType === binaryen.f64;
+    const isInt64 = opType === binaryen.i64;
+    switch (expr.op) {
+        case "+":
+            return isFloat ? mod.f64.add(left, right) : isInt64 ? mod.i64.add(left, right) : mod.i32.add(left, right);
+        case "-":
+            return isFloat ? mod.f64.sub(left, right) : isInt64 ? mod.i64.sub(left, right) : mod.i32.sub(left, right);
+        case "*":
+            return isFloat ? mod.f64.mul(left, right) : isInt64 ? mod.i64.mul(left, right) : mod.i32.mul(left, right);
+        case "/":
+            return isFloat ? mod.f64.div(left, right) : isInt64 ? mod.i64.div_s(left, right) : mod.i32.div_s(left, right);
+        case "%":
+            if (isFloat) {
+                errors.push(wasmValidationError(`modulo (%) not supported for Float`));
+                return mod.unreachable();
+            }
+            return isInt64 ? mod.i64.rem_s(left, right) : mod.i32.rem_s(left, right);
+        case "==":
+            return isFloat ? mod.f64.eq(left, right) : isInt64 ? mod.i64.eq(left, right) : mod.i32.eq(left, right);
+        case "!=":
+            return isFloat ? mod.f64.ne(left, right) : isInt64 ? mod.i64.ne(left, right) : mod.i32.ne(left, right);
+        case "<":
+            return isFloat ? mod.f64.lt(left, right) : isInt64 ? mod.i64.lt_s(left, right) : mod.i32.lt_s(left, right);
+        case ">":
+            return isFloat ? mod.f64.gt(left, right) : isInt64 ? mod.i64.gt_s(left, right) : mod.i32.gt_s(left, right);
+        case "<=":
+            return isFloat ? mod.f64.le(left, right) : isInt64 ? mod.i64.le_s(left, right) : mod.i32.le_s(left, right);
+        case ">=":
+            return isFloat ? mod.f64.ge(left, right) : isInt64 ? mod.i64.ge_s(left, right) : mod.i32.ge_s(left, right);
+        case "and":
+            return mod.i32.and(left, right);
+        case "or":
+            return mod.i32.or(left, right);
+        case "implies":
+            // A implies B ≡ (not A) or B
+            return mod.i32.or(mod.i32.eqz(left), right);
+        default:
+            errors.push(wasmValidationError(`unsupported binop: ${expr.op}`));
+            return mod.unreachable();
+    }
+}
+export function compileUnop(expr, cc, ctx) {
+    const { mod, errors } = cc;
+    const operand = compileExpr(expr.operand, cc, ctx);
+    const opType = inferExprWasmType(expr.operand, cc, ctx);
+    const isFloat = opType === binaryen.f64;
+    const isInt64 = opType === binaryen.i64;
+    switch (expr.op) {
+        case "-":
+            return isFloat
+                ? mod.f64.neg(operand)
+                : isInt64
+                    ? mod.i64.sub(mod.i64.const(0, 0), operand)
+                    : mod.i32.sub(mod.i32.const(0), operand);
+        case "not":
+            return mod.i32.eqz(operand);
+        default:
+            errors.push(wasmValidationError(`unsupported unop: ${expr.op}`));
+            return mod.unreachable();
+    }
+}
+export function compileIf(expr, cc, ctx) {
+    const { mod } = cc;
+    const cond = compileExpr(expr.condition, cc, ctx);
+    // Infer the result type from the then-branch's last expression
+    const resultType = expr.then.length > 0
+        ? inferExprWasmType(expr.then[expr.then.length - 1], cc, ctx)
+        : binaryen.i32;
+    const thenExprs = expr.then.map((e) => compileExpr(e, cc, ctx));
+    const thenBody = thenExprs.length === 1
+        ? thenExprs[0]
+        : mod.block(null, thenExprs, resultType);
+    if (expr.else) {
+        const elseExprs = expr.else.map((e) => compileExpr(e, cc, ctx));
+        const elseBody = elseExprs.length === 1
+            ? elseExprs[0]
+            : mod.block(null, elseExprs, resultType);
+        return mod.if(cond, thenBody, elseBody);
+    }
+    return mod.if(cond, thenBody);
+}
+export function compileLet(expr, cc, ctx) {
+    const { mod, strings } = cc;
+    const wasmType = expr.type
+        ? edictTypeToWasm(expr.type)
+        : inferExprWasmType(expr.value, cc, ctx);
+    let edictTypeName;
+    if (expr.type && expr.type.kind === "named") {
+        edictTypeName = expr.type.name;
+    }
+    else if (expr.type && expr.type.kind === "option") {
+        edictTypeName = "Option";
+    }
+    else if (expr.type && expr.type.kind === "result") {
+        edictTypeName = "Result";
+    }
+    else if (expr.value.kind === "record_expr") {
+        edictTypeName = expr.value.name;
+    }
+    else if (expr.value.kind === "enum_constructor") {
+        edictTypeName = expr.value.enumName;
+    }
+    const index = ctx.addLocal(expr.name, wasmType, edictTypeName);
+    const value = compileExpr(expr.value, cc, ctx);
+    const localSet = mod.local.set(index, value);
+    // For String-type let bindings, save __str_ret_len into a companion local
+    // so the correct length is available when the variable is later used as an argument.
+    const isStringType = expr.type?.kind === "basic" && expr.type.name === "String";
+    if (isStringType) {
+        const lenIndex = ctx.addLocal(`__str_len_${expr.name}`, binaryen.i32);
+        if (expr.value.kind === "literal" && typeof expr.value.value === "string") {
+            // String literal — length known at compile time
+            const interned = strings.intern(expr.value.value);
+            return mod.block(null, [
+                localSet,
+                mod.local.set(lenIndex, mod.i32.const(interned.length)),
+            ], binaryen.none);
+        }
+        else {
+            // Non-literal (host call result, etc.) — capture __str_ret_len
+            return mod.block(null, [
+                localSet,
+                mod.local.set(lenIndex, mod.global.get("__str_ret_len", binaryen.i32)),
+            ], binaryen.none);
+        }
+    }
+    return localSet;
+}
+export function compileBlock(expr, cc, ctx) {
+    const { mod } = cc;
+    const bodyExprs = expr.body.map((e) => compileExpr(e, cc, ctx));
+    if (bodyExprs.length === 0)
+        return mod.nop();
+    if (bodyExprs.length === 1)
+        return bodyExprs[0];
+    const blockType = inferExprWasmType(expr.body[expr.body.length - 1], cc, ctx);
+    return mod.block(null, bodyExprs, blockType);
+}
+//# sourceMappingURL=compile-scalars.js.map

package/dist/codegen/compile-scalars.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compile-scalars.js","sourceRoot":"","sources":["../../src/codegen/compile-scalars.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,4EAA4E;AAC5E,gFAAgF;AAEhF,OAAO,QAAQ,MAAM,UAAU,CAAC;AAEhC,OAAO,EAAE,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AACrE,OAAO,EAGH,eAAe,GAClB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,eAAe,CAAC;AACjD,OAAO,EAAE,WAAW,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAE9D,MAAM,UAAU,cAAc,CAC1B,IAAsC,EACtC,EAAsB;IAEtB,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;IAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;IAEvB,IAAI,OAAO,GAAG,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,sEAAsE;IACtE,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC5D,IAAI,CAAC;YACD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAsB,CAAC,CAAC;YAC3C,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,GAAG,WAAW,CAAC,CAAC;YACtC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;YAChD,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACpC,CAAC;QAAC,MAAM,CAAC;YACL,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,gCAAgC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3F,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC;QAC7B,CAAC;IACL,CAAC;IACD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC1B,wEAAwE;QACxE,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACxE,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrC,gEAAgE;QAChE,0EAA0E;QAC1E,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,YAAY,CACxB,IAAoC,EACpC,EAAsB,EACtB,GAAoB;IAEpB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,KAAK,EAAE,CAAC;QACR,OAAO,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,mCAAmC;IACnC,MAAM,UAAU,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACjD,CAAC;IACD,wEAAwE;IACxE,2EAA2E;IAC3E,MAAM,UAAU,GAAG,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,gBAAgB,CACnB,GAAG,EAAE,GAAG,EACR,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,EACzB,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAChB,SAAS,IAAI,CAAC,IAAI,EAAE,CACvB,CAAC;IACN,CAAC;IACD,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,YAAY,CACxB,IAAoC,EACpC,EAAsB,EACtB,GAAoB;IAEpB,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAE/C,iDAAiD;IACjD,4DAA4D;IAC5D,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,MAAM,KAAK,QAAQ,CAAC,GAAG,CAAC;IACxC,MAAM,OAAO,GAAG,MAAM,KAAK,QAAQ,CAAC,GAAG,CAAC;IAExC,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,GAAG;YACJ,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9G,KAAK,GAAG;YACJ,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9G,KAAK,GAAG;YACJ,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9G,KAAK,GAAG;YACJ,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAClH,KAAK,GAAG;YACJ,IAAI,OAAO,EAAE,CAAC;gBACV,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,oCAAoC,CAAC,CAAC,CAAC;gBACvE,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC;YAC7B,CAAC;YACD,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7E,KAAK,IAAI;YACL,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3G,KAAK,IAAI;YACL,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC3G,KAAK,GAAG;YACJ,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/G,KAAK,GAAG;YACJ,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/G,KAAK,IAAI;YACL,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/G,KAAK,IAAI;YACL,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC/G,KAAK,KAAK;YACN,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACpC,KAAK,IAAI;YACL,OAAO,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACnC,KAAK,SAAS;YACV,6BAA6B;YAC7B,OAAO,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;QAChD;YACI,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,sBAAsB,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAClE,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC;IACjC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,WAAW,CACvB,IAAmC,EACnC,EAAsB,EACtB,GAAoB;IAEpB,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,MAAM,KAAK,QAAQ,CAAC,GAAG,CAAC;IAExC,MAAM,OAAO,GAAG,MAAM,KAAK,QAAQ,CAAC,GAAG,CAAC;IAExC,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,GAAG;YACJ,OAAO,OAAO;gBACV,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC;gBACtB,CAAC,CAAC,OAAO;oBACL,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC;oBAC3C,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACrD,KAAK,KAAK;YACN,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAChC;YACI,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,qBAAqB,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACjE,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC;IACjC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,SAAS,CACrB,IAAiC,EACjC,EAAsB,EACtB,GAAoB;IAEpB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAElD,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;QACnC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,EAAE,EAAE,EAAE,GAAG,CAAC;QAC9D,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;IAEnB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAC1B,CAAC;IACF,MAAM,QAAQ,GACV,SAAS,CAAC,MAAM,KAAK,CAAC;QAClB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE;QACf,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAEjD,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAC1B,CAAC;QACF,MAAM,QAAQ,GACV,SAAS,CAAC,MAAM,KAAK,CAAC;YAClB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE;YACf,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QACjD,OAAO,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,UAAU,CACtB,IAAkC,EAClC,EAAsB,EACtB,GAAoB;IAEpB,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI;QACtB,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;QAC5B,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAE7C,IAAI,aAAiC,CAAC;IACtC,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC1C,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACnC,CAAC;SAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAClD,aAAa,GAAG,QAAQ,CAAC;IAC7B,CAAC;SAAM,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAClD,aAAa,GAAG,QAAQ,CAAC;IAC7B,CAAC;SAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;QAC3C,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACpC,CAAC;SAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,kBAAkB,EAAE,CAAC;QAChD,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;IACxC,CAAC;IAED,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;IAC/D,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAE7C,0EAA0E;IAC1E,qFAAqF;IACrF,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC;IAChF,IAAI,YAAY,EAAE,CAAC;QACf,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,aAAa,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YACxE,gDAAgD;YAChD,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAClD,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE;gBACnB,QAAQ;gBACR,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;aAC1D,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;aAAM,CAAC;YACJ,+DAA+D;YAC/D,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE;gBACnB,QAAQ;gBACR,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,eAAe,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;aACzE,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AACpB,CAAC;AAED,MAAM,UAAU,YAAY,CACxB,IAAoC,EACpC,EAAsB,EACtB,GAAoB;IAEpB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClC,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAC1B,CAAC;IACF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,GAAG,EAAE,CAAC;IAC7C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC,CAAC,CAAE,CAAC;IACjD,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAC/E,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AACjD,CAAC"}

package/dist/codegen/hof-generators.d.ts

@@ -0,0 +1,39 @@
+import binaryen from "binaryen";
+/**
+ * Generate array_map(arrPtr: i32, closurePtr: i32) → i32
+ *
+ * Allocates a new array, maps each element through the closure, returns result ptr.
+ */
+export declare function generateArrayMap(mod: binaryen.Module): void;
+/**
+ * Generate array_filter(arrPtr: i32, closurePtr: i32) → i32
+ *
+ * Single-pass overalloc: allocates max-length result, filters in one pass,
+ * then writes actual count. Tail waste is acceptable (arena allocator).
+ */
+export declare function generateArrayFilter(mod: binaryen.Module): void;
+/**
+ * Generate array_reduce(arrPtr: i32, init: i32, closurePtr: i32) → i32
+ *
+ * Folds array elements into an accumulator via the closure.
+ */
+export declare function generateArrayReduce(mod: binaryen.Module): void;
+/**
+ * Generate array_find(arrPtr: i32, closurePtr: i32) → i32
+ *
+ * Scans array, calls predicate on each element. Returns Option<Int>:
+ *   - Some(elem): heap-allocated [tag=1][pad(4)][value][pad(4)]
+ *   - None:       heap-allocated [tag=0][pad(4)]
+ *
+ * Option layout matches the built-in enum: None=tag0/8 bytes, Some=tag1/16 bytes.
+ */
+export declare function generateArrayFind(mod: binaryen.Module): void;
+/**
+ * Generate array_sort(arrPtr: i32, closurePtr: i32) → i32
+ *
+ * Copies the input array to a new heap allocation, then sorts in-place
+ * using insertion sort. The comparator closure returns:
+ *   negative if a < b, 0 if a == b, positive if a > b (C qsort convention).
+ */
+export declare function generateArraySort(mod: binaryen.Module): void;
+//# sourceMappingURL=hof-generators.d.ts.map

package/dist/codegen/hof-generators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hof-generators.d.ts","sourceRoot":"","sources":["../../src/codegen/hof-generators.ts"],"names":[],"mappings":"AAUA,OAAO,QAAQ,MAAM,UAAU,CAAC;AAEhC;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,QAAQ,CAAC,MAAM,GAAG,IAAI,CAqE3D;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,QAAQ,CAAC,MAAM,GAAG,IAAI,CAgF9D;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,QAAQ,CAAC,MAAM,GAAG,IAAI,CA0D9D;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,MAAM,GAAG,IAAI,CA8F5D;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,MAAM,GAAG,IAAI,CA+I5D"}

package/dist/codegen/hof-generators.js

@@ -0,0 +1,336 @@
+// =============================================================================
+// HOF Array Builtin WASM Generation
+// =============================================================================
+// These builtins need call_indirect to invoke closure arguments, so they
+// are generated as internal WASM functions rather than host imports.
+//
+// Array layout: [length:i32][elem0:i32][elem1:i32]...
+// Closure pair: [table_index:i32][env_ptr:i32]
+// Closure calling convention: call_indirect(table, idx, [env_ptr, ...args])
+import binaryen from "binaryen";
+/**
+ * Generate array_map(arrPtr: i32, closurePtr: i32) → i32
+ *
+ * Allocates a new array, maps each element through the closure, returns result ptr.
+ */
+export function generateArrayMap(mod) {
+    // Params: arrPtr=0, closurePtr=1
+    // Locals: length=2, tableIdx=3, envPtr=4, resultPtr=5, i=6
+    const paramType = binaryen.createType([binaryen.i32, binaryen.i32]);
+    const vars = [
+        binaryen.i32, // length
+        binaryen.i32, // tableIdx
+        binaryen.i32, // envPtr
+        binaryen.i32, // resultPtr
+        binaryen.i32, // i
+    ];
+    const arrPtr = 0, closurePtr = 1, length = 2, tableIdx = 3, envPtr = 4, resultPtr = 5, idx = 6;
+    // callbackType: (env:i32, elem:i32) → i32
+    const callbackParamType = binaryen.createType([binaryen.i32, binaryen.i32]);
+    const body = mod.block(null, [
+        // length = i32.load(arrPtr, 0)
+        mod.local.set(length, mod.i32.load(0, 0, mod.local.get(arrPtr, binaryen.i32))),
+        // tableIdx = i32.load(closurePtr, 0)
+        mod.local.set(tableIdx, mod.i32.load(0, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // envPtr = i32.load(closurePtr, 4)
+        mod.local.set(envPtr, mod.i32.load(4, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // resultPtr = __heap_ptr
+        mod.local.set(resultPtr, mod.global.get("__heap_ptr", binaryen.i32)),
+        // __heap_ptr += 4 + length * 4
+        mod.global.set("__heap_ptr", mod.i32.add(mod.global.get("__heap_ptr", binaryen.i32), mod.i32.add(mod.i32.const(4), mod.i32.mul(mod.local.get(length, binaryen.i32), mod.i32.const(4))))),
+        // i32.store(resultPtr, 0, length)
+        mod.i32.store(0, 0, mod.local.get(resultPtr, binaryen.i32), mod.local.get(length, binaryen.i32)),
+        // i = 0
+        mod.local.set(idx, mod.i32.const(0)),
+        // loop
+        mod.if(mod.i32.gt_s(mod.local.get(length, binaryen.i32), mod.i32.const(0)), mod.loop("map_loop", mod.block(null, [
+            // result[i] = call_indirect(tableIdx, [envPtr, arr[i]])
+            mod.i32.store(4, 0, // offset 4 + i*4 from resultPtr
+            mod.i32.add(mod.local.get(resultPtr, binaryen.i32), mod.i32.mul(mod.local.get(idx, binaryen.i32), mod.i32.const(4))), mod.call_indirect("__fn_table", mod.local.get(tableIdx, binaryen.i32), [
+                mod.local.get(envPtr, binaryen.i32),
+                // arr[i] = i32.load(arrPtr + 4 + i*4)
+                mod.i32.load(4, 0, mod.i32.add(mod.local.get(arrPtr, binaryen.i32), mod.i32.mul(mod.local.get(idx, binaryen.i32), mod.i32.const(4)))),
+            ], callbackParamType, binaryen.i32)),
+            // i++
+            mod.local.set(idx, mod.i32.add(mod.local.get(idx, binaryen.i32), mod.i32.const(1))),
+            // br_if map_loop (i < length)
+            mod.br("map_loop", mod.i32.lt_s(mod.local.get(idx, binaryen.i32), mod.local.get(length, binaryen.i32))),
+        ], binaryen.none))),
+        // return resultPtr
+        mod.local.get(resultPtr, binaryen.i32),
+    ], binaryen.i32);
+    mod.addFunction("array_map", paramType, binaryen.i32, vars, body);
+}
+/**
+ * Generate array_filter(arrPtr: i32, closurePtr: i32) → i32
+ *
+ * Single-pass overalloc: allocates max-length result, filters in one pass,
+ * then writes actual count. Tail waste is acceptable (arena allocator).
+ */
+export function generateArrayFilter(mod) {
+    // Params: arrPtr=0, closurePtr=1
+    // Locals: length=2, tableIdx=3, envPtr=4, resultPtr=5, i=6, count=7, elem=8
+    const paramType = binaryen.createType([binaryen.i32, binaryen.i32]);
+    const vars = [
+        binaryen.i32, // length
+        binaryen.i32, // tableIdx
+        binaryen.i32, // envPtr
+        binaryen.i32, // resultPtr
+        binaryen.i32, // i
+        binaryen.i32, // count
+        binaryen.i32, // elem
+    ];
+    const arrPtr = 0, closurePtr = 1, length = 2, tableIdx = 3, envPtr = 4, resultPtr = 5, idx = 6, count = 7, elem = 8;
+    // callbackType: (env:i32, elem:i32) → i32 (bool)
+    const callbackParamType = binaryen.createType([binaryen.i32, binaryen.i32]);
+    const body = mod.block(null, [
+        // length = i32.load(arrPtr, 0)
+        mod.local.set(length, mod.i32.load(0, 0, mod.local.get(arrPtr, binaryen.i32))),
+        // tableIdx = i32.load(closurePtr, 0)
+        mod.local.set(tableIdx, mod.i32.load(0, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // envPtr = i32.load(closurePtr, 4)
+        mod.local.set(envPtr, mod.i32.load(4, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // resultPtr = __heap_ptr (overalloc: 4 + length*4)
+        mod.local.set(resultPtr, mod.global.get("__heap_ptr", binaryen.i32)),
+        mod.global.set("__heap_ptr", mod.i32.add(mod.global.get("__heap_ptr", binaryen.i32), mod.i32.add(mod.i32.const(4), mod.i32.mul(mod.local.get(length, binaryen.i32), mod.i32.const(4))))),
+        // count = 0, i = 0
+        mod.local.set(count, mod.i32.const(0)),
+        mod.local.set(idx, mod.i32.const(0)),
+        // loop
+        mod.if(mod.i32.gt_s(mod.local.get(length, binaryen.i32), mod.i32.const(0)), mod.loop("filter_loop", mod.block(null, [
+            // elem = arr[i]
+            mod.local.set(elem, mod.i32.load(4, 0, mod.i32.add(mod.local.get(arrPtr, binaryen.i32), mod.i32.mul(mod.local.get(idx, binaryen.i32), mod.i32.const(4))))),
+            // if call_indirect(tableIdx, [envPtr, elem]) != 0
+            mod.if(mod.call_indirect("__fn_table", mod.local.get(tableIdx, binaryen.i32), [
+                mod.local.get(envPtr, binaryen.i32),
+                mod.local.get(elem, binaryen.i32),
+            ], callbackParamType, binaryen.i32), mod.block(null, [
+                // result[count] = elem
+                mod.i32.store(4, 0, mod.i32.add(mod.local.get(resultPtr, binaryen.i32), mod.i32.mul(mod.local.get(count, binaryen.i32), mod.i32.const(4))), mod.local.get(elem, binaryen.i32)),
+                // count++
+                mod.local.set(count, mod.i32.add(mod.local.get(count, binaryen.i32), mod.i32.const(1))),
+            ], binaryen.none)),
+            // i++
+            mod.local.set(idx, mod.i32.add(mod.local.get(idx, binaryen.i32), mod.i32.const(1))),
+            // br_if filter_loop (i < length)
+            mod.br("filter_loop", mod.i32.lt_s(mod.local.get(idx, binaryen.i32), mod.local.get(length, binaryen.i32))),
+        ], binaryen.none))),
+        // Write actual count as result length
+        mod.i32.store(0, 0, mod.local.get(resultPtr, binaryen.i32), mod.local.get(count, binaryen.i32)),
+        // return resultPtr
+        mod.local.get(resultPtr, binaryen.i32),
+    ], binaryen.i32);
+    mod.addFunction("array_filter", paramType, binaryen.i32, vars, body);
+}
+/**
+ * Generate array_reduce(arrPtr: i32, init: i32, closurePtr: i32) → i32
+ *
+ * Folds array elements into an accumulator via the closure.
+ */
+export function generateArrayReduce(mod) {
+    // Params: arrPtr=0, init=1, closurePtr=2
+    // Locals: length=3, tableIdx=4, envPtr=5, acc=6, i=7
+    const paramType = binaryen.createType([binaryen.i32, binaryen.i32, binaryen.i32]);
+    const vars = [
+        binaryen.i32, // length
+        binaryen.i32, // tableIdx
+        binaryen.i32, // envPtr
+        binaryen.i32, // acc
+        binaryen.i32, // i
+    ];
+    const arrPtr = 0, init = 1, closurePtr = 2, length = 3, tableIdx = 4, envPtr = 5, acc = 6, idx = 7;
+    // callbackType: (env:i32, acc:i32, elem:i32) → i32
+    const callbackParamType = binaryen.createType([binaryen.i32, binaryen.i32, binaryen.i32]);
+    const body = mod.block(null, [
+        // length = i32.load(arrPtr, 0)
+        mod.local.set(length, mod.i32.load(0, 0, mod.local.get(arrPtr, binaryen.i32))),
+        // tableIdx = i32.load(closurePtr, 0)
+        mod.local.set(tableIdx, mod.i32.load(0, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // envPtr = i32.load(closurePtr, 4)
+        mod.local.set(envPtr, mod.i32.load(4, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // acc = init
+        mod.local.set(acc, mod.local.get(init, binaryen.i32)),
+        // i = 0
+        mod.local.set(idx, mod.i32.const(0)),
+        // loop
+        mod.if(mod.i32.gt_s(mod.local.get(length, binaryen.i32), mod.i32.const(0)), mod.loop("reduce_loop", mod.block(null, [
+            // acc = call_indirect(tableIdx, [envPtr, acc, arr[i]])
+            mod.local.set(acc, mod.call_indirect("__fn_table", mod.local.get(tableIdx, binaryen.i32), [
+                mod.local.get(envPtr, binaryen.i32),
+                mod.local.get(acc, binaryen.i32),
+                mod.i32.load(4, 0, mod.i32.add(mod.local.get(arrPtr, binaryen.i32), mod.i32.mul(mod.local.get(idx, binaryen.i32), mod.i32.const(4)))),
+            ], callbackParamType, binaryen.i32)),
+            // i++
+            mod.local.set(idx, mod.i32.add(mod.local.get(idx, binaryen.i32), mod.i32.const(1))),
+            // br_if reduce_loop (i < length)
+            mod.br("reduce_loop", mod.i32.lt_s(mod.local.get(idx, binaryen.i32), mod.local.get(length, binaryen.i32))),
+        ], binaryen.none))),
+        // return acc
+        mod.local.get(acc, binaryen.i32),
+    ], binaryen.i32);
+    mod.addFunction("array_reduce", paramType, binaryen.i32, vars, body);
+}
+/**
+ * Generate array_find(arrPtr: i32, closurePtr: i32) → i32
+ *
+ * Scans array, calls predicate on each element. Returns Option<Int>:
+ *   - Some(elem): heap-allocated [tag=1][pad(4)][value][pad(4)]
+ *   - None:       heap-allocated [tag=0][pad(4)]
+ *
+ * Option layout matches the built-in enum: None=tag0/8 bytes, Some=tag1/16 bytes.
+ */
+export function generateArrayFind(mod) {
+    // Params: arrPtr=0, closurePtr=1
+    // Locals: length=2, tableIdx=3, envPtr=4, i=5, elem=6, resultPtr=7
+    const paramType = binaryen.createType([binaryen.i32, binaryen.i32]);
+    const vars = [
+        binaryen.i32, // length
+        binaryen.i32, // tableIdx
+        binaryen.i32, // envPtr
+        binaryen.i32, // i
+        binaryen.i32, // elem
+        binaryen.i32, // resultPtr
+    ];
+    const arrPtr = 0, closurePtr = 1, length = 2, tableIdx = 3, envPtr = 4, idx = 5, elem = 6, resultPtr = 7;
+    // callbackType: (env:i32, elem:i32) → i32 (bool)
+    const callbackParamType = binaryen.createType([binaryen.i32, binaryen.i32]);
+    // Inner loop block label — we use "find_block" so we can br out on match
+    const body = mod.block(null, [
+        // length = i32.load(arrPtr, 0)
+        mod.local.set(length, mod.i32.load(0, 0, mod.local.get(arrPtr, binaryen.i32))),
+        // tableIdx = i32.load(closurePtr, 0)
+        mod.local.set(tableIdx, mod.i32.load(0, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // envPtr = i32.load(closurePtr, 4)
+        mod.local.set(envPtr, mod.i32.load(4, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // i = 0
+        mod.local.set(idx, mod.i32.const(0)),
+        // Search loop — break out when found
+        mod.if(mod.i32.gt_s(mod.local.get(length, binaryen.i32), mod.i32.const(0)), mod.block("find_block", [
+            mod.loop("find_loop", mod.block(null, [
+                // elem = arr[i]
+                mod.local.set(elem, mod.i32.load(4, 0, mod.i32.add(mod.local.get(arrPtr, binaryen.i32), mod.i32.mul(mod.local.get(idx, binaryen.i32), mod.i32.const(4))))),
+                // if predicate(elem) → return Some(elem)
+                mod.if(mod.call_indirect("__fn_table", mod.local.get(tableIdx, binaryen.i32), [
+                    mod.local.get(envPtr, binaryen.i32),
+                    mod.local.get(elem, binaryen.i32),
+                ], callbackParamType, binaryen.i32), mod.block(null, [
+                    // Allocate Some(elem): [tag=1][pad][value][pad] = 16 bytes
+                    mod.local.set(resultPtr, mod.global.get("__heap_ptr", binaryen.i32)),
+                    mod.global.set("__heap_ptr", mod.i32.add(mod.global.get("__heap_ptr", binaryen.i32), mod.i32.const(16))),
+                    // Write tag = 1 (Some)
+                    mod.i32.store(0, 0, mod.local.get(resultPtr, binaryen.i32), mod.i32.const(1)),
+                    // Write value at offset 8
+                    mod.i32.store(8, 0, mod.local.get(resultPtr, binaryen.i32), mod.local.get(elem, binaryen.i32)),
+                    // Break out of search block
+                    mod.br("find_block"),
+                ], binaryen.none)),
+                // i++
+                mod.local.set(idx, mod.i32.add(mod.local.get(idx, binaryen.i32), mod.i32.const(1))),
+                // br_if find_loop (i < length)
+                mod.br("find_loop", mod.i32.lt_s(mod.local.get(idx, binaryen.i32), mod.local.get(length, binaryen.i32))),
+            ], binaryen.none)),
+            // If we reach here, no match found → allocate None
+            mod.local.set(resultPtr, mod.global.get("__heap_ptr", binaryen.i32)),
+            mod.global.set("__heap_ptr", mod.i32.add(mod.global.get("__heap_ptr", binaryen.i32), mod.i32.const(8))),
+            // Write tag = 0 (None)
+            mod.i32.store(0, 0, mod.local.get(resultPtr, binaryen.i32), mod.i32.const(0)),
+        ], binaryen.none), 
+        // Empty array → allocate None
+        mod.block(null, [
+            mod.local.set(resultPtr, mod.global.get("__heap_ptr", binaryen.i32)),
+            mod.global.set("__heap_ptr", mod.i32.add(mod.global.get("__heap_ptr", binaryen.i32), mod.i32.const(8))),
+            mod.i32.store(0, 0, mod.local.get(resultPtr, binaryen.i32), mod.i32.const(0)),
+        ], binaryen.none)),
+        // return resultPtr
+        mod.local.get(resultPtr, binaryen.i32),
+    ], binaryen.i32);
+    mod.addFunction("array_find", paramType, binaryen.i32, vars, body);
+}
+/**
+ * Generate array_sort(arrPtr: i32, closurePtr: i32) → i32
+ *
+ * Copies the input array to a new heap allocation, then sorts in-place
+ * using insertion sort. The comparator closure returns:
+ *   negative if a < b, 0 if a == b, positive if a > b (C qsort convention).
+ */
+export function generateArraySort(mod) {
+    // Params: arrPtr=0, closurePtr=1
+    // Locals: length=2, tableIdx=3, envPtr=4, resultPtr=5,
+    //         i=6, j=7, key=8, cmpResult=9
+    const paramType = binaryen.createType([binaryen.i32, binaryen.i32]);
+    const vars = [
+        binaryen.i32, // length
+        binaryen.i32, // tableIdx
+        binaryen.i32, // envPtr
+        binaryen.i32, // resultPtr
+        binaryen.i32, // i (outer loop)
+        binaryen.i32, // j (inner loop)
+        binaryen.i32, // key
+        binaryen.i32, // cmpResult
+    ];
+    const arrPtr = 0, closurePtr = 1, length = 2, tableIdx = 3, envPtr = 4, resultPtr = 5, i = 6, j = 7, key = 8;
+    // callbackType: (env:i32, a:i32, b:i32) → i32
+    const callbackParamType = binaryen.createType([binaryen.i32, binaryen.i32, binaryen.i32]);
+    // Helper: result[idx] = i32.load(resultPtr + 4 + idx*4)
+    const loadResult = (idxLocal) => mod.i32.load(4, 0, mod.i32.add(mod.local.get(resultPtr, binaryen.i32), mod.i32.mul(mod.local.get(idxLocal, binaryen.i32), mod.i32.const(4))));
+    const storeResult = (idxLocal, value) => mod.i32.store(4, 0, mod.i32.add(mod.local.get(resultPtr, binaryen.i32), mod.i32.mul(mod.local.get(idxLocal, binaryen.i32), mod.i32.const(4))), value);
+    const body = mod.block(null, [
+        // length = i32.load(arrPtr, 0)
+        mod.local.set(length, mod.i32.load(0, 0, mod.local.get(arrPtr, binaryen.i32))),
+        // tableIdx = i32.load(closurePtr, 0)
+        mod.local.set(tableIdx, mod.i32.load(0, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // envPtr = i32.load(closurePtr, 4)
+        mod.local.set(envPtr, mod.i32.load(4, 0, mod.local.get(closurePtr, binaryen.i32))),
+        // Allocate result array: [length][elem0]...[elemN-1]
+        mod.local.set(resultPtr, mod.global.get("__heap_ptr", binaryen.i32)),
+        mod.global.set("__heap_ptr", mod.i32.add(mod.global.get("__heap_ptr", binaryen.i32), mod.i32.add(mod.i32.const(4), mod.i32.mul(mod.local.get(length, binaryen.i32), mod.i32.const(4))))),
+        // Write length header
+        mod.i32.store(0, 0, mod.local.get(resultPtr, binaryen.i32), mod.local.get(length, binaryen.i32)),
+        // Copy elements from input to result
+        mod.local.set(i, mod.i32.const(0)),
+        mod.if(mod.i32.gt_s(mod.local.get(length, binaryen.i32), mod.i32.const(0)), mod.loop("copy_loop", mod.block(null, [
+            storeResult(i, mod.i32.load(4, 0, mod.i32.add(mod.local.get(arrPtr, binaryen.i32), mod.i32.mul(mod.local.get(i, binaryen.i32), mod.i32.const(4))))),
+            mod.local.set(i, mod.i32.add(mod.local.get(i, binaryen.i32), mod.i32.const(1))),
+            mod.br("copy_loop", mod.i32.lt_s(mod.local.get(i, binaryen.i32), mod.local.get(length, binaryen.i32))),
+        ], binaryen.none))),
+        // Insertion sort: for i = 1 to length-1
+        mod.if(mod.i32.gt_s(mod.local.get(length, binaryen.i32), mod.i32.const(1)), mod.block(null, [
+            mod.local.set(i, mod.i32.const(1)),
+            mod.loop("sort_outer", mod.block(null, [
+                // key = result[i]
+                mod.local.set(key, loadResult(i)),
+                // j = i - 1
+                mod.local.set(j, mod.i32.sub(mod.local.get(i, binaryen.i32), mod.i32.const(1))),
+                // Inner loop: while j >= 0 && compare(result[j], key) > 0
+                mod.block("shift_break", [
+                    mod.loop("shift_loop", mod.block(null, [
+                        // if j < 0, break
+                        mod.br("shift_break", mod.i32.lt_s(mod.local.get(j, binaryen.i32), mod.i32.const(0))),
+                        // cmp = compare(result[j], key)
+                        // if cmp <= 0, break
+                        mod.br("shift_break", mod.i32.le_s(mod.call_indirect("__fn_table", mod.local.get(tableIdx, binaryen.i32), [
+                            mod.local.get(envPtr, binaryen.i32),
+                            loadResult(j),
+                            mod.local.get(key, binaryen.i32),
+                        ], callbackParamType, binaryen.i32), mod.i32.const(0))),
+                        // result[j+1] = result[j]
+                        mod.i32.store(4, 0, mod.i32.add(mod.local.get(resultPtr, binaryen.i32), mod.i32.mul(mod.i32.add(mod.local.get(j, binaryen.i32), mod.i32.const(1)), mod.i32.const(4))), loadResult(j)),
+                        // j--
+                        mod.local.set(j, mod.i32.sub(mod.local.get(j, binaryen.i32), mod.i32.const(1))),
+                        mod.br("shift_loop"),
+                    ], binaryen.none)),
+                ], binaryen.none),
+                // result[j+1] = key
+                mod.i32.store(4, 0, mod.i32.add(mod.local.get(resultPtr, binaryen.i32), mod.i32.mul(mod.i32.add(mod.local.get(j, binaryen.i32), mod.i32.const(1)), mod.i32.const(4))), mod.local.get(key, binaryen.i32)),
+                // i++
+                mod.local.set(i, mod.i32.add(mod.local.get(i, binaryen.i32), mod.i32.const(1))),
+                // br_if sort_outer (i < length)
+                mod.br("sort_outer", mod.i32.lt_s(mod.local.get(i, binaryen.i32), mod.local.get(length, binaryen.i32))),
+            ], binaryen.none)),
+        ], binaryen.none)),
+        // return resultPtr
+        mod.local.get(resultPtr, binaryen.i32),
+    ], binaryen.i32);
+    mod.addFunction("array_sort", paramType, binaryen.i32, vars, body);
+}
+//# sourceMappingURL=hof-generators.js.map