mcard-js 2.1.1 → 2.1.2

package/dist/ptr/lambda/FreeVariables.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Free Variables Analysis
+ *
+ * Computes the set of free variables in a Lambda term.
+ * Free variables are those not bound by any enclosing λ.
+ *
+ * FV(x) = {x}
+ * FV(λx.M) = FV(M) \ {x}
+ * FV(M N) = FV(M) ∪ FV(N)
+ *
+ * @module mcard-js/ptr/lambda/FreeVariables
+ */
+import { CardCollection } from '../../model/CardCollection';
+import { IO } from '../../monads/IO';
+import { Maybe } from '../../monads/Maybe';
+/**
+ * Compute free variables of a term (by hash)
+ * Returns IO<Maybe<Set<string>>> - Nothing if term not found
+ */
+export declare function freeVariables(collection: CardCollection, termHash: string): IO<Maybe<Set<string>>>;
+/**
+ * Compute bound variables of a term (by hash)
+ * Bound variables are those occurring in binding positions (λx)
+ */
+export declare function boundVariables(collection: CardCollection, termHash: string): IO<Maybe<Set<string>>>;
+/**
+ * Check if a variable is free in a term
+ */
+export declare function isFreeIn(collection: CardCollection, variable: string, termHash: string): IO<boolean>;
+/**
+ * Check if a term is closed (has no free variables)
+ */
+export declare function isClosed(collection: CardCollection, termHash: string): IO<boolean>;
+/**
+ * Generate a fresh variable name that is not in the given set
+ */
+export declare function generateFresh(base: string, avoid: Set<string>): string;
+/**
+ * Generate a fresh variable avoiding all variables in a term
+ */
+export declare function generateFreshFor(collection: CardCollection, base: string, termHash: string): Promise<string>;
+export declare function difference<T>(a: Set<T>, b: Set<T>): Set<T>;
+export declare function intersection<T>(a: Set<T>, b: Set<T>): Set<T>;
+//# sourceMappingURL=FreeVariables.d.ts.map

package/dist/ptr/lambda/FreeVariables.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FreeVariables.d.ts","sourceRoot":"","sources":["../../../src/ptr/lambda/FreeVariables.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAE5D,OAAO,EAAE,EAAE,EAAE,MAAM,iBAAiB,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAM3C;;;GAGG;AACH,wBAAgB,aAAa,CACzB,UAAU,EAAE,cAAc,EAC1B,QAAQ,EAAE,MAAM,GACjB,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAKxB;AAqED;;;GAGG;AACH,wBAAgB,cAAc,CAC1B,UAAU,EAAE,cAAc,EAC1B,QAAQ,EAAE,MAAM,GACjB,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAIxB;AAkDD;;GAEG;AACH,wBAAgB,QAAQ,CACpB,UAAU,EAAE,cAAc,EAC1B,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,GACjB,EAAE,CAAC,OAAO,CAAC,CAKb;AAED;;GAEG;AACH,wBAAgB,QAAQ,CACpB,UAAU,EAAE,cAAc,EAC1B,QAAQ,EAAE,MAAM,GACjB,EAAE,CAAC,OAAO,CAAC,CAKb;AAMD;;GAEG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CActE;AAED;;GAEG;AACH,wBAAsB,gBAAgB,CAClC,UAAU,EAAE,cAAc,EAC1B,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,MAAM,GACjB,OAAO,CAAC,MAAM,CAAC,CAcjB;AAcD,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAQ1D;AAED,wBAAgB,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAQ5D"}

package/dist/ptr/lambda/FreeVariables.js

@@ -0,0 +1,207 @@
+/**
+ * Free Variables Analysis
+ *
+ * Computes the set of free variables in a Lambda term.
+ * Free variables are those not bound by any enclosing λ.
+ *
+ * FV(x) = {x}
+ * FV(λx.M) = FV(M) \ {x}
+ * FV(M N) = FV(M) ∪ FV(N)
+ *
+ * @module mcard-js/ptr/lambda/FreeVariables
+ */
+import { loadTerm } from './LambdaTerm';
+import { IO } from '../../monads/IO';
+import { Maybe } from '../../monads/Maybe';
+// ─────────────────────────────────────────────────────────────────────────────
+// Free Variable Computation
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Compute free variables of a term (by hash)
+ * Returns IO<Maybe<Set<string>>> - Nothing if term not found
+ */
+export function freeVariables(collection, termHash) {
+    return IO.of(async () => {
+        const result = await computeFreeVars(collection, termHash, new Set());
+        return result;
+    });
+}
+/**
+ * Internal recursive implementation with memoization via visited set
+ */
+async function computeFreeVars(collection, termHash, visited) {
+    // Cycle detection
+    if (visited.has(termHash)) {
+        return Maybe.just(new Set());
+    }
+    visited.add(termHash);
+    const term = await loadTerm(collection, termHash);
+    if (!term) {
+        return Maybe.nothing();
+    }
+    return Maybe.just(await freeVarsOfTerm(collection, term, visited));
+}
+/**
+ * Compute free variables of a term structure
+ */
+async function freeVarsOfTerm(collection, term, visited) {
+    switch (term.tag) {
+        case 'Var':
+            // FV(x) = {x}
+            return new Set([term.name]);
+        case 'Abs': {
+            // FV(λx.M) = FV(M) \ {x}
+            const bodyFV = await computeFreeVars(collection, term.body, visited);
+            if (bodyFV.isNothing) {
+                throw new Error(`Body term not found: ${term.body}`);
+            }
+            const result = new Set(bodyFV.value);
+            result.delete(term.param);
+            return result;
+        }
+        case 'App': {
+            // FV(M N) = FV(M) ∪ FV(N)
+            const funcFV = await computeFreeVars(collection, term.func, visited);
+            const argFV = await computeFreeVars(collection, term.arg, visited);
+            if (funcFV.isNothing) {
+                throw new Error(`Function term not found: ${term.func}`);
+            }
+            if (argFV.isNothing) {
+                throw new Error(`Argument term not found: ${term.arg}`);
+            }
+            return union(funcFV.value, argFV.value);
+        }
+    }
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Bound Variables
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Compute bound variables of a term (by hash)
+ * Bound variables are those occurring in binding positions (λx)
+ */
+export function boundVariables(collection, termHash) {
+    return IO.of(async () => {
+        return computeBoundVars(collection, termHash, new Set());
+    });
+}
+async function computeBoundVars(collection, termHash, visited) {
+    if (visited.has(termHash)) {
+        return Maybe.just(new Set());
+    }
+    visited.add(termHash);
+    const term = await loadTerm(collection, termHash);
+    if (!term) {
+        return Maybe.nothing();
+    }
+    switch (term.tag) {
+        case 'Var':
+            // No bound variables in a variable
+            return Maybe.just(new Set());
+        case 'Abs': {
+            // BV(λx.M) = {x} ∪ BV(M)
+            const bodyBV = await computeBoundVars(collection, term.body, visited);
+            if (bodyBV.isNothing)
+                return bodyBV;
+            const result = new Set(bodyBV.value);
+            result.add(term.param);
+            return Maybe.just(result);
+        }
+        case 'App': {
+            // BV(M N) = BV(M) ∪ BV(N)
+            const funcBV = await computeBoundVars(collection, term.func, visited);
+            const argBV = await computeBoundVars(collection, term.arg, visited);
+            if (funcBV.isNothing || argBV.isNothing) {
+                return Maybe.nothing();
+            }
+            return Maybe.just(union(funcBV.value, argBV.value));
+        }
+    }
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Utility: Check if variable is free in term
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Check if a variable is free in a term
+ */
+export function isFreeIn(collection, variable, termHash) {
+    return freeVariables(collection, termHash).map(maybeFV => {
+        if (maybeFV.isNothing)
+            return false;
+        return maybeFV.value.has(variable);
+    });
+}
+/**
+ * Check if a term is closed (has no free variables)
+ */
+export function isClosed(collection, termHash) {
+    return freeVariables(collection, termHash).map(maybeFV => {
+        if (maybeFV.isNothing)
+            return false;
+        return maybeFV.value.size === 0;
+    });
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Fresh Variable Generation
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Generate a fresh variable name that is not in the given set
+ */
+export function generateFresh(base, avoid) {
+    if (!avoid.has(base)) {
+        return base;
+    }
+    let counter = 1;
+    let candidate = `${base}${counter}`;
+    while (avoid.has(candidate)) {
+        counter++;
+        candidate = `${base}${counter}`;
+    }
+    return candidate;
+}
+/**
+ * Generate a fresh variable avoiding all variables in a term
+ */
+export async function generateFreshFor(collection, base, termHash) {
+    const fvResult = await freeVariables(collection, termHash).run();
+    const bvResult = await boundVariables(collection, termHash).run();
+    const avoid = new Set();
+    if (fvResult.isJust) {
+        for (const v of fvResult.value)
+            avoid.add(v);
+    }
+    if (bvResult.isJust) {
+        for (const v of bvResult.value)
+            avoid.add(v);
+    }
+    return generateFresh(base, avoid);
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Set Utilities
+// ─────────────────────────────────────────────────────────────────────────────
+function union(a, b) {
+    const result = new Set(a);
+    for (const item of b) {
+        result.add(item);
+    }
+    return result;
+}
+export function difference(a, b) {
+    const result = new Set();
+    for (const item of a) {
+        if (!b.has(item)) {
+            result.add(item);
+        }
+    }
+    return result;
+}
+export function intersection(a, b) {
+    const result = new Set();
+    for (const item of a) {
+        if (b.has(item)) {
+            result.add(item);
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=FreeVariables.js.map

package/dist/ptr/lambda/FreeVariables.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FreeVariables.js","sourceRoot":"","sources":["../../../src/ptr/lambda/FreeVariables.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,EAAc,QAAQ,EAAuB,MAAM,cAAc,CAAC;AACzE,OAAO,EAAE,EAAE,EAAE,MAAM,iBAAiB,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAE3C,gFAAgF;AAChF,4BAA4B;AAC5B,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,UAAU,aAAa,CACzB,UAA0B,EAC1B,QAAgB;IAEhB,OAAO,EAAE,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE;QACpB,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACtE,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC,CAAC;AACP,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,eAAe,CAC1B,UAA0B,EAC1B,QAAgB,EAChB,OAAoB;IAEpB,kBAAkB;IAClB,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAEtB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAClD,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO,KAAK,CAAC,OAAO,EAAe,CAAC;IACxC,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;AACvE,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,cAAc,CACzB,UAA0B,EAC1B,IAAgB,EAChB,OAAoB;IAEpB,QAAQ,IAAI,CAAC,GAAG,EAAE,CAAC;QACf,KAAK,KAAK;YACN,cAAc;YACd,OAAO,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAEhC,KAAK,KAAK,CAAC,CAAC,CAAC;YACT,yBAAyB;YACzB,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACrE,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,IAAI,KAAK,CAAC,wBAAwB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACzD,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,OAAO,MAAM,CAAC;QAClB,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACT,0BAA0B;YAC1B,MAAM,MAAM,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACrE,MAAM,KAAK,GAAG,MAAM,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAEnE,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,CAAC;YACD,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;YAC5D,CAAC;YAED,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5C,CAAC;IACL,CAAC;AACL,CAAC;AAED,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC1B,UAA0B,EAC1B,QAAgB;IAEhB,OAAO,EAAE,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE;QACpB,OAAO,gBAAgB,CAAC,UAAU,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACP,CAAC;AAED,KAAK,UAAU,gBAAgB,CAC3B,UAA0B,EAC1B,QAAgB,EAChB,OAAoB;IAEpB,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAEtB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAClD,IAAI,CAAC,IAAI,EAAE,CAAC;QACR,OAAO,KAAK,CAAC,OAAO,EAAe,CAAC;IACxC,CAAC;IAED,QAAQ,IAAI,CAAC,GAAG,EAAE,CAAC;QACf,KAAK,KAAK;YACN,mCAAmC;YACnC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,EAAU,CAAC,CAAC;QAEzC,KAAK,KAAK,CAAC,CAAC,CAAC;YACT,yBAAyB;YACzB,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACtE,IAAI,MAAM,CAAC,SAAS;gBAAE,OAAO,MAAM,CAAC;YAEpC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACT,0BAA0B;YAC1B,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACtE,MAAM,KAAK,GAAG,MAAM,gBAAgB,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YAEpE,IAAI,MAAM,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;gBACtC,OAAO,KAAK,CAAC,OAAO,EAAe,CAAC;YACxC,CAAC;YAED,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACxD,CAAC;IACL,CAAC;AACL,CAAC;AAED,gFAAgF;AAChF,6CAA6C;AAC7C,gFAAgF;AAEhF;;GAEG;AACH,MAAM,UAAU,QAAQ,CACpB,UAA0B,EAC1B,QAAgB,EAChB,QAAgB;IAEhB,OAAO,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;QACrD,IAAI,OAAO,CAAC,SAAS;YAAE,OAAO,KAAK,CAAC;QACpC,OAAO,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACP,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CACpB,UAA0B,EAC1B,QAAgB;IAEhB,OAAO,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;QACrD,IAAI,OAAO,CAAC,SAAS;YAAE,OAAO,KAAK,CAAC;QACpC,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACP,CAAC;AAED,gFAAgF;AAChF,4BAA4B;AAC5B,gFAAgF;AAEhF;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,KAAkB;IAC1D,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,SAAS,GAAG,GAAG,IAAI,GAAG,OAAO,EAAE,CAAC;IAEpC,OAAO,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAC;QACV,SAAS,GAAG,GAAG,IAAI,GAAG,OAAO,EAAE,CAAC;IACpC,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAClC,UAA0B,EAC1B,IAAY,EACZ,QAAgB;IAEhB,MAAM,QAAQ,GAAG,MAAM,aAAa,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC;IACjE,MAAM,QAAQ,GAAG,MAAM,cAAc,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,GAAG,EAAE,CAAC;IAElE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAEhC,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AACtC,CAAC;AAED,gFAAgF;AAChF,gBAAgB;AAChB,gFAAgF;AAEhF,SAAS,KAAK,CAAI,CAAS,EAAE,CAAS;IAClC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1B,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,UAAU,CAAI,CAAS,EAAE,CAAS;IAC9C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACf,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,YAAY,CAAI,CAAS,EAAE,CAAS;IAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/ptr/lambda/LambdaRuntime.d.ts

@@ -0,0 +1,80 @@
+/**
+ * Lambda Runtime - PTR Runtime for Lambda Calculus
+ *
+ * Implements α-β-η conversions as a PTR runtime, treating MCard hashes
+ * as Lambda terms and performing computations that produce new MCards.
+ *
+ * This runtime can be used via CLM specifications to define and verify
+ * Lambda Calculus reductions.
+ *
+ * @module mcard-js/ptr/lambda/LambdaRuntime
+ */
+import { Runtime } from '../node/RuntimeInterface';
+import { CardCollection } from '../../model/CardCollection';
+import { ReductionStrategy } from './BetaReduction';
+export type LambdaOperation = 'alpha' | 'beta' | 'eta-reduce' | 'eta-expand' | 'normalize' | 'step' | 'alpha-equiv' | 'eta-equiv' | 'alpha-norm' | 'eta-norm' | 'free-vars' | 'is-closed' | 'is-normal' | 'parse' | 'pretty' | 'build';
+export interface LambdaConfig {
+    operation: LambdaOperation;
+    strategy?: ReductionStrategy;
+    maxSteps?: number;
+    newName?: string;
+    freshVar?: string;
+    compareWith?: string;
+}
+export interface LambdaRuntimeResult {
+    success: boolean;
+    result?: unknown;
+    error?: string;
+    termHash?: string;
+    prettyPrint?: string;
+}
+/**
+ * Lambda Calculus Runtime for PTR
+ *
+ * Executes Lambda Calculus operations on MCard-stored terms.
+ */
+export declare class LambdaRuntime implements Runtime {
+    private collection;
+    constructor(collection: CardCollection);
+    /**
+     * Execute a Lambda operation
+     *
+     * @param codeOrPath - For Lambda runtime, this is the term hash to operate on
+     * @param context - Additional context (varies by operation)
+     * @param config - Lambda configuration with operation type
+     * @param chapterDir - Chapter directory (used for relative paths if needed)
+     */
+    execute(codeOrPath: string, context: unknown, config: any, chapterDir: string): Promise<LambdaRuntimeResult>;
+    private doAlphaRename;
+    private doBetaReduce;
+    private doEtaReduce;
+    private doEtaExpand;
+    private doNormalize;
+    private doStep;
+    private doAlphaEquiv;
+    private doEtaEquiv;
+    private doAlphaNormalize;
+    private doEtaNormalize;
+    private doFreeVars;
+    private doIsClosed;
+    private doIsNormal;
+    private doParse;
+    private doPretty;
+    private doBuild;
+}
+/**
+ * Parse a simple Lambda expression string into MCards
+ *
+ * Syntax:
+ *   x, y, z        - Variables
+ *   \x.M or λx.M   - Abstraction
+ *   (M N)          - Application
+ *   M N            - Application (left-associative)
+ *
+ * Examples:
+ *   \x.x           - Identity function
+ *   \f.\x.f x      - Application combinator
+ *   (\x.x) y       - Identity applied to y
+ */
+export declare function parseLambdaExpression(collection: CardCollection, expression: string): Promise<string>;
+//# sourceMappingURL=LambdaRuntime.d.ts.map

package/dist/ptr/lambda/LambdaRuntime.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LambdaRuntime.d.ts","sourceRoot":"","sources":["../../../src/ptr/lambda/LambdaRuntime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,0BAA0B,CAAC;AACnD,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAW5D,OAAO,EAMH,iBAAiB,EAEpB,MAAM,iBAAiB,CAAC;AA4BzB,MAAM,MAAM,eAAe,GACrB,OAAO,GACP,MAAM,GACN,YAAY,GACZ,YAAY,GACZ,WAAW,GACX,MAAM,GACN,aAAa,GACb,WAAW,GACX,YAAY,GACZ,UAAU,GACV,WAAW,GACX,WAAW,GACX,WAAW,GACX,OAAO,GACP,QAAQ,GACR,OAAO,CACR;AAEL,MAAM,WAAW,YAAY;IACzB,SAAS,EAAE,eAAe,CAAC;IAC3B,QAAQ,CAAC,EAAE,iBAAiB,CAAC;IAC7B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,mBAAmB;IAChC,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;CACxB;AAMD;;;;GAIG;AACH,qBAAa,aAAc,YAAW,OAAO;IACzC,OAAO,CAAC,UAAU,CAAiB;gBAEvB,UAAU,EAAE,cAAc;IAItC;;;;;;;OAOG;IACG,OAAO,CACT,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,GAAG,EACX,UAAU,EAAE,MAAM,GACnB,OAAO,CAAC,mBAAmB,CAAC;YA2EjB,aAAa;YAyBb,YAAY;YAgBZ,WAAW;YAgBX,WAAW;YAkBX,WAAW;YA4BX,MAAM;YA0BN,YAAY;YAsBZ,UAAU;YAkBV,gBAAgB;YAgBhB,cAAc;YAYd,UAAU;YAaV,UAAU;YASV,UAAU;YASV,OAAO;YAwBP,QAAQ;YAUR,OAAO;CAgBxB;AAMD;;;;;;;;;;;;;GAaG;AACH,wBAAsB,qBAAqB,CACvC,UAAU,EAAE,cAAc,EAC1B,UAAU,EAAE,MAAM,GACnB,OAAO,CAAC,MAAM,CAAC,CAiFjB"}