Articles on the language, its compiler and its runtime.
In Orb, every feature is a state machine. Not a component tree, not a bag of hooks — a state machine with explicit states, guarded transitions, and a closed circuit the compiler enforces before any code is generated.
Read`orb validate` proves structural properties. `orb test` goes further — it walks every edge of every state machine, fires every event from every state, and verifies that guards block and allow correctly. You write zero test code. The graph is the test plan.
Read`orb validate` does not just check syntax. It walks the state machine graph and proves properties that would normally require dozens of hand-written tests. Closed circuits, emission contracts, binding validity, and pattern prop requirements — all checked before any code is generated.
ReadOrb follows atomic design for behavior, not just UI. Standard behaviors are atoms — small state machines that own their topology. Your application composes them into molecules using `uses` imports and an override surface. The atom's states and transitions stay constant. You rebind the data, rename the events, and replace the effects.
ReadImagine a world where you don't need to write thousands of lines of code to make a robot move intelligently. A world where you declare a machine's behavior the same way you describe the motion of planets in their orbits.
ReadA programming language of composable state machines.