Issues

• [complexity, flattening] O(2^n) — Loading writes shared arguments as exponentially large trees

  bendlang/bend#2034 · Filter by author pjcavalcanti opened on Nov 3, 2026

• Explicit exports and module re-exports

  enhancement
  bendlang/bend#2032 · Filter by author o1lo01ol1o opened on Nov 3, 2026

• [complexity, parser] O(n^2) — Each do-block call repeats the shared arguments

  bendlang/bend#2026 · Filter by author pjcavalcanti opened on Nov 3, 2026

• [complexity, parser] O(n^2) — Each use expands all omitted quantity arguments

  bendlang/bend#2025 · Filter by author pjcavalcanti opened on Nov 3, 2026

• [complexity, parser] O(n^2) — Each constructor repeats the datatype's parameters

  bendlang/bend#2024 · Filter by author pjcavalcanti opened on Nov 3, 2026

• A def filling a law with a typed signature reports an unrelated character

  bendlang/bend#2023 · Filter by author raramos9 opened on Nov 3, 2026

• [complexity, parser] O(n^2) — Groups rescan call arguments to find array updates

  bendlang/bend#2022 · Filter by author pjcavalcanti opened on Nov 3, 2026

• [complexity, parser] O(n^2) — Outer groups revisit settled operator names

  bendlang/bend#2011 · Filter by author pjcavalcanti opened on Nov 2, 2026

• Conversion evaluates a def before comparing its arguments

  bendlang/bend#2009 · Filter by author LeeeeT opened on Nov 2, 2026

• [complexity, parser] O(n^2) — Each field name is compared with every earlier name

  bendlang/bend#2005 · Filter by author pjcavalcanti opened on Nov 2, 2026

• [complexity, parser] O(n^2) — Nested lambdas repeat line and whitespace searches

  bendlang/bend#2003 · Filter by author pjcavalcanti opened on Nov 2, 2026

• [complexity, parser] O(n * 2^n) — Nested annotation types are read twice

  bendlang/bend#2001 · Filter by author pjcavalcanti opened on Nov 2, 2026

• [complexity, checker] O(n log n) — Unused parameters still copy paths through variable maps

  bendlang/bend#1999 · Filter by author pjcavalcanti opened on Nov 2, 2026

• a match binder that shadows a parameter is reported with the name printed twice and no scope

  bendlang/bend#1998 · Filter by author adeerkhan opened on Nov 2, 2026

• [complexity, checker] O(n^2) parameter substitutions — Every constructor value repeats the same substitutions

  bendlang/bend#1997 · Filter by author pjcavalcanti opened on Nov 2, 2026
  1

• Quantity-parametric List.map

  enhancement
  bendlang/bend#1994 · Filter by author nicolas-abril opened on Nov 1, 2026

• CUDA: about 0.6 ms of every ! goes to page faults on the pages the host wrote since the last bang

  bendlang/bend#1992 · Filter by author nuxyel opened on Nov 1, 2026
  2

• C backend: Base's Array.to_list copies both halves at every level, ~190 instructions a cell (a loop of Array.get takes ~35)

  bendlang/bend#1991 · Filter by author nuxyel opened on Nov 1, 2026
  

• bend PROOF.bend fails on four unedited demos: their main.bend holds @unsafe defs that no law uses

  bendlang/bend#1989 · Filter by author lee-eojin opened on Nov 1, 2026

• Question: using LAWS.bend with a TypeScript / React Native app

  enhancement
  bendlang/bend#1988 · Filter by author oferRounds opened on Nov 1, 2026

• 16 bytes per character: String and the byte APIs are cons lists, no packed byte/string type

  bendlang/bend#1987 · Filter by author lukaszsamson opened on Nov 1, 2026

• Native heap: freed memory is reused only within its size class (peak = sum of per-class high-water marks)

  bendlang/bend#1986 · Filter by author lukaszsamson opened on Nov 1, 2026
  1

• --verdict / -o .bendtt: stack overflow since 2.0.38 on a named Σ type over two computed equations (16-line Base repro; 2.0.37 passes)

  bendlang/bend#1984 · Filter by author lukaszsamson opened on Oct 31, 2026
  1

• Array<T> accepts a mixed-depth ANode that the compiled runtime cannot represent

  bendlang/bend#1980 · Filter by author adeerkhan opened on Oct 31, 2026

• Metal: large continuation dispatcher crashes MTLCompilerService in LLVM allocation

  bendlang/bend#1979 · Filter by author azide0x37 opened on Oct 31, 2026