@dallaylaen/ski-interpreter 2.4.0 → 2.4.1

package/CHANGELOG.md

@@ -5,6 +5,18 @@ All notable changes to this project will be documented in this file.
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.1.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
+## [2.4.1] - 2026-03-06
+
+### Added
+
+- expr.run({maxSize: number ?? 1_000_000}) to prevent runaway reductions (fixes #14).
+- `ski.js infer <expression>` command to infer properties of an expression.
+
+### Fixed
+
+- quests use shorter Y combinator form internally (#13)
+- history in the playground is scrolled to the bottom.
+
 ## [2.4.0] - 2026-03-06
 
 ### BREAKING CHANGES

package/README.md

@@ -99,12 +99,14 @@ npm install @dallaylaen/ski-interpreter
   * `--verbose` - Show all evaluation steps
   * Example: `ski file script.ski`
 
+* **`infer <expression>`** - try to find equivalent lambda expression and display its properties if found. 
+
 * **`extract <expression> <known term> ...`** - 
   Replace parts of the expression that are equivalent to the known terms with the respective terms. Known terms must be normalizable.
 
 * **`search <expression> <known term> ...`** - 
   Attempt to brute force an equivalent of the _expression_ using only the _known terms_.  
-  Only normalizing terms are currently supported. 
+  Only normalizable terms are currently supported. 
 
 * **`quest-lint <files...>`** - Validate quest definition files
   * `--solution <file>` - Load solutions from a JSON file for verification
@@ -150,7 +152,7 @@ const final = expr.run({max: 1000}); // { steps: 42, expr: '...' }
 const iterator = expr.walk();
 
 // applying expressions
-const result = expr.run({max: 1000}, arg1, arg2 ...);
+const result = expr.run({max: 1000}, arg1, arg2, ...);
 // same sa
 expr.apply(arg1).apply(arg2).run();
 // or simply

package/bin/ski.js

@@ -41,12 +41,12 @@ program
     evaluateFile(filepath, options.verbose);
   });
 
-// Search subcommand
+// Infer subcommand
 program
-  .command('search <target> <terms...>')
-  .description('Search for an expression equivalent to target using known terms')
-  .action((target, terms) => {
-    searchExpression(target, terms);
+  .command('infer <expression>')
+  .description('Find a canonical form of the expression and its properties')
+  .action((expression) => {
+    inferExpression(expression);
   });
 
 // Extract subcommand
@@ -57,6 +57,14 @@ program
     extractExpression(target, terms);
   });
 
+// Search subcommand
+program
+  .command('search <target> <terms...>')
+  .description('Search for an expression equivalent to target using known terms')
+  .action((target, terms) => {
+    searchExpression(target, terms);
+  });
+
 // Quest-check subcommand
 program
   .command('quest-lint <files...>')
@@ -156,6 +164,41 @@ function processLine (source, ski, verbose, onErr) {
   }
 }
 
+function inferExpression (expression) {
+  const ski = new SKI();
+
+  const expr = ski.parse(expression);
+  const guess = expr.infer();
+
+  if (guess.normal) {
+    displayInfer(guess);
+    return;
+  }
+  // hard case...
+  let steps = guess.steps;
+  const canon = expr.traverse(e => {
+    const g = e.infer();
+    steps += g.steps;
+    return g.expr;
+  });
+
+  displayInfer({ expr: canon, steps, normal: false, proper: false });
+}
+
+/**
+ *
+ * @param {TermInfo} guess
+ */
+function displayInfer (guess) {
+  if (guess.expr)
+    console.log(guess.expr.format());
+
+  for (const key of ['normal', 'proper', 'arity', 'discard', 'duplicate', 'steps']) {
+    if (guess[key] !== undefined)
+      console.log(`// ${key}: ${guess[key]}`);
+  }
+}
+
 async function questCheck (files, solutionFile) {
   try {
     // Load solutions if provided

package/lib/ski-interpreter.cjs.js

@@ -93,7 +93,8 @@ function prepareWrapper(label) {
 // src/expr.ts
 var DEFAULTS = {
   max: 1e3,
-  maxArgs: 32
+  maxArgs: 32,
+  maxSize: 1e6
 };
 var ORDER = {
   "leftmost-outermost": "LO",
@@ -115,6 +116,7 @@ var Expr = class _Expr {
   static {
     this.native = native;
   }
+  // rough estimate of the number of nodes in the tree
   /**
    *
    * @desc Define properties of the term based on user supplied options and/or inference results.
@@ -314,9 +316,12 @@ var Expr = class _Expr {
    */
   infer(options = {}) {
     const skipNames = {};
+    const skipSkip = /* @__PURE__ */ new Set();
     this.traverse((e) => {
-      if (e instanceof Named)
+      if (e instanceof Named && !skipSkip.has(e))
         skipNames[e.name] = true;
+      if (e instanceof Lambda)
+        skipSkip.add(e.arg);
       return void 0;
     });
     return this._infer({
@@ -539,6 +544,8 @@ var Expr = class _Expr {
         final = true;
         break;
       }
+      if ((next.expr.size ?? 1) > (opt.maxSize ?? DEFAULTS.maxSize))
+        break;
       steps += next.steps;
       expr = next.expr;
     }
@@ -557,7 +564,7 @@ var Expr = class _Expr {
     let steps = 0;
     let expr = this;
     let final = false;
-    while (steps < max) {
+    while (steps < max && (expr.size ?? 1) < (options.maxSize ?? DEFAULTS.maxSize)) {
       const next = expr.step();
       if (!next.changed)
         final = true;
@@ -778,6 +785,7 @@ var App = class _App extends Expr {
     super();
     this.arg = arg;
     this.fun = fun;
+    this.size = (fun.size ?? 1) + (arg.size ?? 1);
   }
   /** @property {boolean} [final] */
   _traverse_descend(options, change) {
@@ -950,6 +958,7 @@ var Lambda = class _Lambda extends Expr {
     this.arg = local;
     this.impl = impl.subst(arg, local) ?? impl;
     this.arity = 1;
+    this.size = (impl.size ?? 1) + 1;
   }
   invoke(arg) {
     return this.impl.subst(this.arg, arg) ?? this.impl;
@@ -1036,6 +1045,7 @@ var Alias = class extends Named {
     this._setup(options);
     this.terminal = options.terminal ?? this.props?.proper;
     this.invoke = waitn(impl, this.arity ?? 0);
+    this.size = impl.size;
   }
   /**
    * @property {boolean} [outdated] - whether the alias is outdated