The graph is the program.
Typed nodes and edges carry the meaning. A text listing is generated from the structure, never the other way round.
EML-NOVA · N
Structure before text.
EML-NOVA is the family’s structure-first line. To an AI, a program is not a page of text but a typed graph with a stable identity. EML-NOVA builds, changes and verifies programs as that structure; text becomes one projection among several.
Research line · standard library, level L0 · no public release yet
Standard library
It already runs.
33 functions written as NOVA graphs, each one verified against an independent reference in exact arithmetic. This is NOVA’s practice-first corpus.
Principles
Four ideas EML-NOVA is built on
Identity comes from structure.
A canonical form and a semantic hash identify a program by what it is, not by how it happens to be written down.
A change is a patch.
Edits are proposed as patches to the graph and applied as transactions, so every change is explicit and reviewable.
Verification is part of building.
When an AI asks to build or change a program, the request is checked (types, shapes, tests) before anything is committed.
Concept sketch
A program, as an AI sees it
The sum of squares from the family page, drawn as the kind of structure EML-NOVA works with: typed nodes, typed edges, and an identity computed from the structure itself.
In the family
Where EML-NOVA sits
- EML-U
EML-U keeps the meaning.
- EML-P
EML-P runs it today.
- EML-NOVA
EML-NOVA is the structure AIs build with.
This page describes the idea; the standard library shows it running, with every result verified. Releases will be announced here.
Back to the family