‹ BackHN Continuity

Thread

Bend 2 and the Vibe-Coding Trap

327 points · 235 comments · LiamPowell

  1. wg0 · · focus · HN ↗
    Some noteworthy lines from the README.md[0]:

    > - The compiler (not kernel) is 99% AI-written and has not been fully audited yet.

    > - Strings are linked lists of characters, so text processing is slow.

    [0]. <a href="https:&#x2F;&#x2F;github.com&#x2F;bendlang&#x2F;bend&#x2F;tree&#x2F;main" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;bendlang&#x2F;bend&#x2F;tree&#x2F;main

    1. LightMachine · · focus · HN ↗
      So are Haskell&#x27;s, since 20 years ago, with no options for years?

      We will introducing binary buffers eventually. The project is new...

      1. mrkeen · · focus · HN ↗
        To clarify, It looks like Haskell got better string types around 20 years ago.
Open on Hacker News to reply ↗

Unofficial Hacker News client; not affiliated with Y Combinator.