kumi 0.0.22 → 0.0.24

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3004f316c60f0f3d2e7dd9c1e0ee3c56a9f473d7ec970871f7ef1fe54e4dcf22
-  data.tar.gz: 7c6506a65d6fbf20b489627d898c4bca09d32d70f0914c7ad3641b1638f65d5f
+  metadata.gz: c54cad2db678a526d6441efd2b8c84ed68b023573a4eea0bdee49abb038932bf
+  data.tar.gz: 9ad65c4c21e99d780ac228f171d875bf42d08600254a1f336c2f903955b4b94e
 SHA512:
-  metadata.gz: 355587e7cc9c31ffca0460a538e75dece116229164331939166551b2436c08b7904f0bccd7016215e9bbfef5d225a21a94e1b10057403c309dc98f4ebb3117d5
-  data.tar.gz: 99136efb58ba49ac8381cf369271debc4f6f202cc9df50cdee2c0f366b892fe05e346526d7e5950c9819e1fc76edeb6fbf0602d5718faa797132d8e2c774add0
+  metadata.gz: 486203f6da8806d00d372053f1484398350b2e9b07d19fb682ebe97e913479abf7e3481d014c0d455f2c86722cd837a924939d2a65a38655712a5eec588d0ec9
+  data.tar.gz: 80d7653af56665416a660e75fe9687003b9575bfe0bb087e02e8fd38ee0597cdfaf6ae16558275ded11ef0e3d5ad2bc2d3fd7c451b32b5740fe8030a2b561c13

data/CHANGELOG.md

@@ -1,4 +1,11 @@
 ## [Unreleased]
+## [0.0.24] – 2025-10-16
+### Fixed
+- Bug when inlining of declarations with multiple axis reductions.
+
+## [0.0.23] – 2025-10-13
+### Fixed
+- OutputSchemaPass now excludes inline `:let` declarations from output_schema metadata, matching JS/Ruby codegen behavior
 
 ## [0.0.22] – 2025-10-13
 ### Removed

data/README.md

@@ -3,6 +3,7 @@
 [![CI](https://github.com/amuta/kumi/workflows/CI/badge.svg)](https://github.com/amuta/kumi/actions)
 [![Gem Version](https://badge.fury.io/rb/kumi.svg)](https://badge.fury.io/rb/kumi)
 
+**[Try the interactive demo →](https://kumi-play-web.fly.dev/)**
 
 ---
 
@@ -13,23 +14,15 @@
 ---
 
 
-Kumi is a **declarative calculation DSL for Ruby**. You write business rules once; Kumi:
+**Declarative calculation DSL for Ruby.** Write business rules once, run them anywhere.
 
-- Builds a **typed dependency graph** with vector semantics.
-- Performs **static validation** at definition time.
-- Lowers to a **portable Low-level IR (LIR)**.
-- Code-generates standalone **Ruby** and **JavaScript**.
+Kumi compiles high-level schemas into standalone Ruby and JavaScript with no runtime dependencies.
 
-Targets: finance, tax, pricing, insurance, payroll, analytics—domains where **correctness, transparency, and reproducibility** matter.
+**Built for:** finance, tax, pricing, insurance, payroll, analytics—domains where correctness and transparency matter.
 
 ---
 
-## Codegen: Currently Ruby and JavaScript
-
-*Note: this is not available on the last published gem version (0.0.18), but if you clone this repository you can just copy a ./golden/$schema_name and modify schema.kumi as you and run bin/kumi golden test $schema_name*
-
-
-Kumi emits the kernel for your schema with no runtime in the target language. You can use it within your ruby application backend and/or export to the client.
+## Example: Conway's Game of Life
 
 
 <details>
@@ -78,114 +71,39 @@ end
 
 </details>
 
-<details>
-<summary><strong>Optimized LIR (lowered IR)</strong></summary>
-
-```bash
-# ...
-  (Declaration next_state
-    %t285 = load_input "rows" :: array
-    %t1539 = Length %t285 :: integer
-    %t1540 = const -1 :: integer
-    %t1542 = const 0 :: integer
-    %t1546 = const 1 :: integer
-    %t1334 = const 3 :: integer
-    %t1339 = const 2 :: integer
-    %t1547 = call core.sub(%t1539, %t1546) :: integer
-    loop rows id=L31 in %t285 as el=%rows_el_286, idx=%rows_i_287
-      %t1541 = call core.sub(%rows_i_287, %t1540) :: integer
-      %t1561 = call core.sub(%rows_i_287, %t1546) :: integer
-      %t1580 = call core.mod(%rows_i_287, %t1539) :: integer
-      # ...
-```
-
-</details>
-
-<details>
-<summary><strong>Generated Ruby (excerpt)</strong></summary>
-
-```ruby
-# Autogenerated by Kumi Codegen
-module Kumi::Compiled::KUMI_bd17a3ebee1bec4e58b72118d43e8c1c93bf773f257fc93d9c32a783d212ea4f
-  def self.from(input_data = nil)
-    instance = Object.new
-    instance.extend(self)
-    instance.instance_variable_set(:@input, input_data)
-    instance
-  end
-
-  def self.__kumi_executable__
-    instance = Object.new
-    instance.extend(self)
-    instance
-  end
-
-  def update(input_data)
-    @input = @input.merge(input_data)
-    self
-  end
-
-  def [](name)
-    case name
-    when :next_state then _next_state
-    else raise KeyError, "Unknown declaration"
-    end
-  end
-
-  def _next_state(input = @input)
-    out = []
-    t285 = input["rows"] || input[:rows]
-    t1539 = t285.length
-    t1540 = -1
-    t1542 = 0
-    t1546 = 1
-    t1334 = 3
-    t1339 = 2
-    t1547 = t1539 - t1546
-    t285.each_with_index do |rows_el_286, rows_i_287|
-      out_1 = []
-      t1541 = rows_i_287 - t1540
-      t1561 = rows_i_287 - t1546
-      t1580 = rows_i_287 % t1539
-      t1543 = t1541 >= t1542
-      t1544 = t1541 < t1539
-      t1549 = [[ t1541, t1542 ].max, t1547 ].min
-      t1563 = t1561 >= t1542
-# ...
-```
-
-</details>
 
 <details>
 <summary><strong>Generated JavaScript (excerpt)</strong></summary>
 
 ```js
-export class KumiCompiledModule {
-  _next_state(input) {
-    let out = [];
-    let t285 = input["rows"];
-    let t1539 = t285.length
-    const t1540 = -1;
-    const t1542 = 0;
-    const t1546 = 1;
-    const t1334 = 3;
-    const t1339 = 2;
-    let t1547 = t1539 - t1546;
-    t285.forEach((rows_el_286, rows_i_287) => {
-      let out_1 = [];
-      let t1541 = rows_i_287 - t1540;
-      let t1561 = rows_i_287 - t1546;
-      let t1580 = ((rows_i_287 % t1539) + t1539) % t1539;
-      let t1543 = t1541 >= t1542;
-      let t1544 = t1541 < t1539;
-      let t1549 = Math.min(Math.max(t1541, t1542), t1547);
-      let t1563 = t1561 >= t1542;
-      let t1564 = t1561 < t1539;
-      let t1569 = Math.min(Math.max(t1561, t1542), t1547);
-      let t1581 = t1580 + t1539;
-      let t1545 = t1543 && t1544;
-      let t1550 = t285[t1549]
-      // ...
+export function _next_state(input) {
+  let out = [];
+  let t285 = input["rows"];
+  let t1539 = t285.length;
+  const t1540 = -1;
+  const t1542 = 0;
+  const t1546 = 1;
+  const t1334 = 3;
+  const t1339 = 2;
+  let t1547 = t1539 - t1546;
+  t285.forEach((rows_el_286, rows_i_287) => {
+    let out_1 = [];
+    let t1541 = rows_i_287 - t1540;
+    let t1561 = rows_i_287 - t1546;
+    let t1580 = ((rows_i_287 % t1539) + t1539) % t1539;
+    // ... neighbor calculations, Conway's rules
+    let t1332 = [t1557, t1577, t1597, t1617, t1645, t1673, t1701, t1729];
+    let t1333 = t1332.reduce((a, b) => a + b, 0);
+    let t1335 = t1333 == t1334;
+    let t1340 = t1333 == t1339;
+    let t1344 = col_el_288 > t1542;
+    let t1345 = t1340 && t1344;
+    let t528 = t1335 || t1345;
+    let t293 = t528 ? t1546 : t1542;
+    out_1.push(t293);
+  });
+  return out;
+}
 ```
 
 </details>
@@ -200,8 +118,34 @@ gem install kumi
 
 Requires Ruby 3.1+. No external dependencies.
 
+## Quick Start
+
+```ruby
+require 'kumi'
+
+Kumi.configure do |config|
+  config.compilation_mode = :jit
+end
+
+module Double
+  extend Kumi::Schema
+
+  schema do
+    input { integer :x }
+    value :doubled, input.x * 2
+  end
+end
+
+# Execute in Ruby
+result = Double.from(x: 5)
+result[:doubled]  # => 10
+
+# Export to JavaScript
+Double.write_source("output.mjs", platform: :javascript)
+```
+
 ---
 
 ## License
 
-MIT License. See [LICENSE](LICENSE).
+MIT License. See [LICENSE](LICENSE).

data/golden/array_element/expected/schema_ruby.rb

@@ -1,5 +1,5 @@
 # Autogenerated by Kumi Codegen
-module Kumi::Compiled::KUMI_1412b74cf62d9ac249af9fd939b136c4f77dc87035a46bf635f2e5274454e431
+module Kumi::Compiled::KUMI_1c8ed5675ebbb47c48988ebc1e7a688bdfe46a08c8c7fa3343ae03cb81feb8d2
   def self.from(input_data = nil)
     instance = Object.new
     instance.extend(self)

data/golden/array_index/expected/schema_ruby.rb

@@ -1,5 +1,5 @@
 # Autogenerated by Kumi Codegen
-module Kumi::Compiled::KUMI_6638f46fadb918fd0d9801db1cc74a8644071d3e15e8db0cebb4c1b7699ed811
+module Kumi::Compiled::KUMI_045c4888923226ccaa83f46e8cbb54fb076042110dd637c5df35f0717b18886d
   def self.from(input_data = nil)
     instance = Object.new
     instance.extend(self)

data/golden/array_operations/expected/schema_ruby.rb

@@ -1,5 +1,5 @@
 # Autogenerated by Kumi Codegen
-module Kumi::Compiled::KUMI_d1c9f17db78e51ee1d92553426415c98ea436e202c29221735f0456eb9d070ac
+module Kumi::Compiled::KUMI_ad5e88ef777b7ff03fc054fb2532e158fd95f50237e7a7431485f2433e7b8998
   def self.from(input_data = nil)
     instance = Object.new
     instance.extend(self)

data/golden/cascade_logic/expected/schema_ruby.rb

@@ -1,5 +1,5 @@
 # Autogenerated by Kumi Codegen
-module Kumi::Compiled::KUMI_224cfbaaefdfa09e4554f97c92feefff11d3f31eb69c5be7d4e017cf7895cf77
+module Kumi::Compiled::KUMI_c60fd677ad0c8a7b4023f22e28bd9ff4c05455c34a57687b7e6d186c59eb360c
   def self.from(input_data = nil)
     instance = Object.new
     instance.extend(self)

data/golden/chained_fusion/expected/schema_ruby.rb

@@ -1,5 +1,5 @@
 # Autogenerated by Kumi Codegen
-module Kumi::Compiled::KUMI_509c7b2dc9bbeff658a7cc53b4102928b79f1ea86c21bf5f477bd596a2b47bb4
+module Kumi::Compiled::KUMI_b02df7846ba29e94c8a665ca8d8aa1e248aea9154904c851bc619ecc87526657
   def self.from(input_data = nil)
     instance = Object.new
     instance.extend(self)

data/golden/element_arrays/expected/schema_ruby.rb

@@ -1,5 +1,5 @@
 # Autogenerated by Kumi Codegen
-module Kumi::Compiled::KUMI_95ba78dae41111df66252b8589633cd101a5db4a581ac86815334d8152861f2f
+module Kumi::Compiled::KUMI_cd218374a442352129564ba66fdc114d3f395c40c049f8f0253da3c7bd20c5ef
   def self.from(input_data = nil)
     instance = Object.new
     instance.extend(self)

data/golden/empty_and_null_inputs/expected/schema_ruby.rb

@@ -1,5 +1,5 @@
 # Autogenerated by Kumi Codegen
-module Kumi::Compiled::KUMI_2f139c40109ccdc970680bb2c1efae5be3b7f2c8b75f0c1062e497a9535c20f6
+module Kumi::Compiled::KUMI_f5ff83c5472452825724e8d6146d84050de84e9c1f3ece855cde1d1599126d71
   def self.from(input_data = nil)
     instance = Object.new
     instance.extend(self)

data/golden/game_of_life/expected/lir_00_unoptimized.txt

@@ -11,7 +11,7 @@
     %t6 = load_input "rows" :: array
     loop rows id=L3 in %t6 as el=%rows_el_7, idx=%rows_i_8
       loop col id=L4 in %rows_el_7 as el=%col_el_9, idx=%col_i_10
-        %t11 = Length %t6 :: integer
+        %t11 = length %t6 :: integer
         %t12 = const -1 :: integer
         %t13 = call core.sub(%rows_i_8, %t12) :: integer
         %t14 = const 0 :: integer
@@ -22,12 +22,12 @@
         %t19 = call core.sub(%t11, %t18) :: integer
         %t20 = const 0 :: integer
         %t21 = call core.clamp(%t13, %t20, %t19) :: integer
-        %t22 = Gather %t6, %t21 :: any
-        %t23 = Length %t22 :: integer
+        %t22 = gather %t6, %t21 :: any
+        %t23 = length %t22 :: integer
         %t24 = call core.mod(%col_i_10, %t23) :: integer
         %t25 = call core.add(%t24, %t23) :: integer
         %t26 = call core.mod(%t25, %t23) :: integer
-        %t27 = Gather %t22, %t26 :: integer
+        %t27 = gather %t22, %t26 :: integer
         %t28 = const 0 :: integer
         %t29 = select %t17, %t27, %t28 :: integer
         yield %t29
@@ -38,7 +38,7 @@
     %t30 = load_input "rows" :: array
     loop rows id=L5 in %t30 as el=%rows_el_31, idx=%rows_i_32
       loop col id=L6 in %rows_el_31 as el=%col_el_33, idx=%col_i_34
-        %t35 = Length %t30 :: integer
+        %t35 = length %t30 :: integer
         %t36 = const 1 :: integer
         %t37 = call core.sub(%rows_i_32, %t36) :: integer
         %t38 = const 0 :: integer
@@ -49,12 +49,12 @@
         %t43 = call core.sub(%t35, %t42) :: integer
         %t44 = const 0 :: integer
         %t45 = call core.clamp(%t37, %t44, %t43) :: integer
-        %t46 = Gather %t30, %t45 :: any
-        %t47 = Length %t46 :: integer
+        %t46 = gather %t30, %t45 :: any
+        %t47 = length %t46 :: integer
         %t48 = call core.mod(%col_i_34, %t47) :: integer
         %t49 = call core.add(%t48, %t47) :: integer
         %t50 = call core.mod(%t49, %t47) :: integer
-        %t51 = Gather %t46, %t50 :: integer
+        %t51 = gather %t46, %t50 :: integer
         %t52 = const 0 :: integer
         %t53 = select %t41, %t51, %t52 :: integer
         yield %t53
@@ -65,12 +65,12 @@
     %t54 = load_input "rows" :: array
     loop rows id=L7 in %t54 as el=%rows_el_55, idx=%rows_i_56
       loop col id=L8 in %rows_el_55 as el=%col_el_57, idx=%col_i_58
-        %t59 = Length %t54 :: integer
+        %t59 = length %t54 :: integer
         %t60 = call core.mod(%rows_i_56, %t59) :: integer
         %t61 = call core.add(%t60, %t59) :: integer
         %t62 = call core.mod(%t61, %t59) :: integer
-        %t63 = Gather %t54, %t62 :: any
-        %t64 = Length %t63 :: integer
+        %t63 = gather %t54, %t62 :: any
+        %t64 = length %t63 :: integer
         %t65 = const -1 :: integer
         %t66 = call core.sub(%col_i_58, %t65) :: integer
         %t67 = const 0 :: integer
@@ -81,7 +81,7 @@
         %t72 = call core.sub(%t64, %t71) :: integer
         %t73 = const 0 :: integer
         %t74 = call core.clamp(%t66, %t73, %t72) :: integer
-        %t75 = Gather %t63, %t74 :: integer
+        %t75 = gather %t63, %t74 :: integer
         %t76 = const 0 :: integer
         %t77 = select %t70, %t75, %t76 :: integer
         yield %t77
@@ -92,12 +92,12 @@
     %t78 = load_input "rows" :: array
     loop rows id=L9 in %t78 as el=%rows_el_79, idx=%rows_i_80
       loop col id=L10 in %rows_el_79 as el=%col_el_81, idx=%col_i_82
-        %t83 = Length %t78 :: integer
+        %t83 = length %t78 :: integer
         %t84 = call core.mod(%rows_i_80, %t83) :: integer
         %t85 = call core.add(%t84, %t83) :: integer
         %t86 = call core.mod(%t85, %t83) :: integer
-        %t87 = Gather %t78, %t86 :: any
-        %t88 = Length %t87 :: integer
+        %t87 = gather %t78, %t86 :: any
+        %t88 = length %t87 :: integer
         %t89 = const 1 :: integer
         %t90 = call core.sub(%col_i_82, %t89) :: integer
         %t91 = const 0 :: integer
@@ -108,7 +108,7 @@
         %t96 = call core.sub(%t88, %t95) :: integer
         %t97 = const 0 :: integer
         %t98 = call core.clamp(%t90, %t97, %t96) :: integer
-        %t99 = Gather %t87, %t98 :: integer
+        %t99 = gather %t87, %t98 :: integer
         %t100 = const 0 :: integer
         %t101 = select %t94, %t99, %t100 :: integer
         yield %t101
@@ -119,7 +119,7 @@
     %t102 = load_input "rows" :: array
     loop rows id=L11 in %t102 as el=%rows_el_103, idx=%rows_i_104
       loop col id=L12 in %rows_el_103 as el=%col_el_105, idx=%col_i_106
-        %t107 = Length %t102 :: integer
+        %t107 = length %t102 :: integer
         %t108 = const -1 :: integer
         %t109 = call core.sub(%rows_i_104, %t108) :: integer
         %t110 = const 0 :: integer
@@ -130,8 +130,8 @@
         %t115 = call core.sub(%t107, %t114) :: integer
         %t116 = const 0 :: integer
         %t117 = call core.clamp(%t109, %t116, %t115) :: integer
-        %t118 = Gather %t102, %t117 :: any
-        %t119 = Length %t118 :: integer
+        %t118 = gather %t102, %t117 :: any
+        %t119 = length %t118 :: integer
         %t120 = const -1 :: integer
         %t121 = call core.sub(%col_i_106, %t120) :: integer
         %t122 = const 0 :: integer
@@ -143,7 +143,7 @@
         %t128 = call core.sub(%t119, %t127) :: integer
         %t129 = const 0 :: integer
         %t130 = call core.clamp(%t121, %t129, %t128) :: integer
-        %t131 = Gather %t118, %t130 :: integer
+        %t131 = gather %t118, %t130 :: integer
         %t132 = const 0 :: integer
         %t133 = select %t126, %t131, %t132 :: integer
         yield %t133
@@ -154,7 +154,7 @@
     %t134 = load_input "rows" :: array
     loop rows id=L13 in %t134 as el=%rows_el_135, idx=%rows_i_136
       loop col id=L14 in %rows_el_135 as el=%col_el_137, idx=%col_i_138
-        %t139 = Length %t134 :: integer
+        %t139 = length %t134 :: integer
         %t140 = const -1 :: integer
         %t141 = call core.sub(%rows_i_136, %t140) :: integer
         %t142 = const 0 :: integer
@@ -165,8 +165,8 @@
         %t147 = call core.sub(%t139, %t146) :: integer
         %t148 = const 0 :: integer
         %t149 = call core.clamp(%t141, %t148, %t147) :: integer
-        %t150 = Gather %t134, %t149 :: any
-        %t151 = Length %t150 :: integer
+        %t150 = gather %t134, %t149 :: any
+        %t151 = length %t150 :: integer
         %t152 = const 1 :: integer
         %t153 = call core.sub(%col_i_138, %t152) :: integer
         %t154 = const 0 :: integer
@@ -178,7 +178,7 @@
         %t160 = call core.sub(%t151, %t159) :: integer
         %t161 = const 0 :: integer
         %t162 = call core.clamp(%t153, %t161, %t160) :: integer
-        %t163 = Gather %t150, %t162 :: integer
+        %t163 = gather %t150, %t162 :: integer
         %t164 = const 0 :: integer
         %t165 = select %t158, %t163, %t164 :: integer
         yield %t165
@@ -189,7 +189,7 @@
     %t166 = load_input "rows" :: array
     loop rows id=L15 in %t166 as el=%rows_el_167, idx=%rows_i_168
       loop col id=L16 in %rows_el_167 as el=%col_el_169, idx=%col_i_170
-        %t171 = Length %t166 :: integer
+        %t171 = length %t166 :: integer
         %t172 = const 1 :: integer
         %t173 = call core.sub(%rows_i_168, %t172) :: integer
         %t174 = const 0 :: integer
@@ -200,8 +200,8 @@
         %t179 = call core.sub(%t171, %t178) :: integer
         %t180 = const 0 :: integer
         %t181 = call core.clamp(%t173, %t180, %t179) :: integer
-        %t182 = Gather %t166, %t181 :: any
-        %t183 = Length %t182 :: integer
+        %t182 = gather %t166, %t181 :: any
+        %t183 = length %t182 :: integer
         %t184 = const -1 :: integer
         %t185 = call core.sub(%col_i_170, %t184) :: integer
         %t186 = const 0 :: integer
@@ -213,7 +213,7 @@
         %t192 = call core.sub(%t183, %t191) :: integer
         %t193 = const 0 :: integer
         %t194 = call core.clamp(%t185, %t193, %t192) :: integer
-        %t195 = Gather %t182, %t194 :: integer
+        %t195 = gather %t182, %t194 :: integer
         %t196 = const 0 :: integer
         %t197 = select %t190, %t195, %t196 :: integer
         yield %t197
@@ -224,7 +224,7 @@
     %t198 = load_input "rows" :: array
     loop rows id=L17 in %t198 as el=%rows_el_199, idx=%rows_i_200
       loop col id=L18 in %rows_el_199 as el=%col_el_201, idx=%col_i_202
-        %t203 = Length %t198 :: integer
+        %t203 = length %t198 :: integer
         %t204 = const 1 :: integer
         %t205 = call core.sub(%rows_i_200, %t204) :: integer
         %t206 = const 0 :: integer
@@ -235,8 +235,8 @@
         %t211 = call core.sub(%t203, %t210) :: integer
         %t212 = const 0 :: integer
         %t213 = call core.clamp(%t205, %t212, %t211) :: integer
-        %t214 = Gather %t198, %t213 :: any
-        %t215 = Length %t214 :: integer
+        %t214 = gather %t198, %t213 :: any
+        %t215 = length %t214 :: integer
         %t216 = const 1 :: integer
         %t217 = call core.sub(%col_i_202, %t216) :: integer
         %t218 = const 0 :: integer
@@ -248,7 +248,7 @@
         %t224 = call core.sub(%t215, %t223) :: integer
         %t225 = const 0 :: integer
         %t226 = call core.clamp(%t217, %t225, %t224) :: integer
-        %t227 = Gather %t214, %t226 :: integer
+        %t227 = gather %t214, %t226 :: integer
         %t228 = const 0 :: integer
         %t229 = select %t222, %t227, %t228 :: integer
         yield %t229
@@ -268,7 +268,7 @@
         %t241 = load_decl sw axes=[rows, col] :: integer
         %t242 = load_decl se axes=[rows, col] :: integer
         %t243 = make_tuple(%t235, %t236, %t237, %t238, %t239, %t240, %t241, %t242) :: tuple<integer>
-        %t244 = Fold %t243 fn="agg.sum" :: 
+        %t244 = fold %t243 fn="agg.sum" :: 
         yield %t244
       end_loop
     end_loop