@fraczak/k 4.0.3 → 4.0.4

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@fraczak/k",
-    "version": "4.0.3",
+    "version": "4.0.4",
     "description": "k-language for JSON-like data transformation",
     "main": "index.mjs",
     "scripts": {

package/repl.mjs

@@ -180,12 +180,11 @@ function evaluate(line) {
         val = k.run(`+++\n${line}\n()`, val);
         printVal();
       } catch (error) {
-        e = error;
-        console.error("ERROR:");
-        console.error(e);
+        console.error(error.message);
       }
     }
   } catch (e) {
     console.error(e.message);
+    console.error(e);
   }
 }

package/run.mjs

@@ -248,7 +248,9 @@ function run(exp, value) {
       }
       case "caret": {
         const result = run(exp.caret, value);
-        assert(isOpen(result), "CARET (^): Only an 'open' vector can be closed.");
+        // assert(isOpen(result), "CARET (^): Only an 'open' vector can be closed.");
+        if (! isOpen(result))
+          throw new Error(`Type Error (line: ${exp.end?.line}:${exp.end?.column}): CARET (^): Only 'unboxed' values can be 'boxed'.`)
         return [...result];
       }  
       case "filter": {

package/TYPES.md

@@ -1,32 +0,0 @@
-# What if we concider partial functions as filter-to-filter mappings?
-
-## Examples
-
-```k
-.x :: ( X x, ... ) -> X
-{ f1 x1, f2 x2, ..., fn xn } :: X -> { f1(X) x1, f2(X) x2, ..., fn(X) xn }
-{ f x } :: X -> < f(X) x, ... >
-< f1, f2, ..., fn > :: X -> f1(X) // f1 == f2 == ... == fn
-[ f1, f2, ..., fn ] :: X -> [f1(X)] // f1 == f2 == ... == fn
-$code :: 
-```
-
-Let's consider the following example:
-
-```k
-$nat = < {} _, nat s >;
-z = {{} _};   -- X -> <{} _, ...>
-s = {() s};   -- X -> <X s, ...>
-
-add = 
-  <
-    {.x ._ if, .y then} .then,
-    {.x .s x, .y s y } add
-  >
-;
-
-double = {() x, () y} add;
-
-z s s $nat double;
-```
-