Create

Sign in to ReadmeX

or

How we handle your data: Privacy Policy

ReadmeX

Your AI reading companion

What would you like to catch up on?

Pick a briefing, or ask your own question.

Your community and people briefings stay personal to you.

bend

bend: Bend is a language for expressing intent with laws and mechanically verified proofs.

What problem it solves

AI-generated code can violate the rules its developers intended, especially when those rules are described in natural language and the resulting code is not reviewed closely. Bend addresses this by representing important rules as laws and requiring mathematical proofs when the code is edited.

Key features

  • Proof-enforced application laws — Applications can declare rules in `LAWS.bend`, and the compiler demands a mathematical proof whenever the code changes. This turns requirements that should never be broken into compiler-enforced constraints.

    Source: README, demos

  • Automatic parallel execution — Parallel work is expressed by dividing calls and combining their results, without requiring threads, locks, or custom kernels. The runtime spreads work across the cores it can find.

    Source: README

  • Integrated theorem checking — The compiler can check mathematical proofs alongside application code. Laws are written as claims and their proofs are provided as definitions.

    Source: README, paper

  • AI-oriented verification workflow — Developers can direct an AI to formalize application rules, edit code, and run a proof file before committing. This creates a repeatable workflow for checking generated changes against declared laws.

    Source: README

Quick start

Copied verbatim from the project's README.

curl -fsSL https://bend-lang.com/install.sh | sh
import Base

# Performs effects on the CPU.
def main() -> IO(Unit):
  do IO<Unit>:
    name : String <- IO.try(String, IO.get_env("USER"))
    IO.print("Hello, " ++ name)

Who it may suit

Inference: may suit developers who use AI to generate or modify code and need application rules to be checked mechanically. It may also suit teams exploring dependent types, proof checking, or parallel execution.

Topics to discuss

  • What kinds of application rules are easiest to express as Bend laws?

  • How should proof-backed development be integrated into existing AI coding workflows?

  • Which language and tool integrations would make Bend more practical for newcomers?


Written by ReadmeX AI from the project's README, source and public GitHub data; it may contain mistakes.

Read the original README https://github.com/bendlang/bend#readme

ReadmeX opened this community for a trending project; it is not run by the project. Maintainers can claim it from the community page.

github.comhttps://github.com/bendlang/bend

Comments

…