‹ BackHN Continuity

Thread

Bend – a language that blocks AI mistakes via proof and runs on GPUs

616 points · 327 comments · nicolas-siplis

  1. mccoyb · · focus · HN ↗
    My read on this, after ingesting a good amount of content on the history, is:

    - this Bend is not really related to the old Bend (only in name)

    - this Bend doesn't really have anything to do with interaction combinators

    - this Bend is a QTT, with a change to affinity which enforces a good performance property for GPUs

    - the "higher order at comptime" is neat, reminds me of Andras Kovacs' work on 2ltt and staging in dependently typed languages.

    - this Bend is likely to be good at "balanced recursive computations on ADT", and can parallelize them ... but won't be as good as CUDA or e.g. Futhark on dense rectangular array computations

    - performance needs improvement in the scheduler, to possibly help with balanced work (looking at the n queens and symbolic regression numbers)?

    How are you going to handle search or synthesis over irregular structures (SupaGen)?

    1. snthpy · · focus · HN ↗
      What?

      Thanks for pointing this out. I'm only reading these comments because i liked the interaction combinator Bend language.

      Pivots are cool but why reuse the name and cause confusion? What is the old Bend called now?

      1. [deleted] · · focus · HN ↗

        [deleted]

Open on Hacker News to reply ↗

Unofficial Hacker News client; not affiliated with Y Combinator.