Status and roadmap¶
Pia is an experimental language under active development. The compiler works end to end for a small subset, and much of the language is designed but not built. Nothing is stable yet: syntax, flags and the compiled ABI can all change before a 0.1 release.
What works today¶
| Area | Status |
|---|---|
| Parser | The whole grammar in grammar.md, including the parts the later stages do not handle yet |
| Types | Bounded integers, range types int{lo..hi}, bool, fixed arrays [T; n], slices [T], records, type aliases |
| Code | Functions, let rec, let ... in, mutable locals and buffers, if, for, while, parameter modifiers |
| Overflow | @overflow(proof) by default, plus wrap, saturate and trap, and saturating operators |
| Contracts | requires, ensures, assert, assume, old, forall and exists, loop invariant and decreases |
| Verification | Overflow, nonzero divisors, bounds, preconditions at calls, postconditions and assertions, by intervals and Z3, with counterexamples |
| Metaprograms | let meta functions, quotes and splices, hygiene, operators defined in the prelude and by programs, @derive(eq), expansion to a fixed point |
| Codegen | arm64 for Apple Silicon through MLIR and LLVM: object files, assembly and LLVM IR, a C ABI, saturating NEON instructions and vectorised loops |
| Tools | piac, pia-opt, the pia-lsp language server and a VS Code extension |
Known limitations¶
- Loops need invariants. After a loop, only its invariant is known, so a goal after the loop that depends on what it did needs an invariant that says so.
- Termination is checked for loops and direct recursion only. A
whileloop or a recursive call withoutdecreasesis a skipped goal, whichpiacrefuses unless--allow-unprovedaccepts it. Mutual recursion is not checked. - Calls inside contracts are unknown values, so a contract cannot rely on what another function computes.
- Counterexamples do not show array contents yet, only lengths and scalar values.
- Not compiled yet: function values and lambdas outside metaprograms, variants,
match,dyn, floats,vec<T, k>, slicingxs.[a .. b], refinement types andwhere, generics and concepts, modules and interfaces,spreadand the concurrency runtime.piacreports these as "not supported yet" at their source location. - One target. Code generation targets arm64 macOS. The compiler itself builds on Linux and cross-compiles.
Roadmap¶
The plan is a sequence of milestones, each a GitHub issue, building towards the flagship demo: stream delineation and sediment transport over a terrain heightmap, proved correct and running across the CPU and GPU (ADR 0016).
| Milestone | Scope | |
|---|---|---|
| M0 to M7 | Bazel build, grammar, parser, MLIR dialects, IRGen, verifier, arm64 codegen, records and the metaprogram engine | done |
| M8 | Modules, explicit interface imports, proof certificates and a link check | next |
| M9 | Generic types, concepts with laws, adapters and call-site deduction | |
| M10 | Vectorisation driven by proved facts, and vec<T, k> |
|
| M11 | Floats: strict IEEE, and three ways to allow reassociation | |
| M12 | Concurrency: spread, collectives, and compile-time checks that collectives match |
|
| M13 | PNG and GIF decoding and encoding, written in Pia | |
| M14 | The stream delineation demo |
Alongside these, a Presburger stage will decide affine goals such as aliasing and loop-carried dependence (ADR 0020). After a 0.1 release, Pia will be offered to Compiler Explorer.
Following along¶
The Architecture Decision Records record every design decision and why it was made. The compiler architecture describes the pipeline and the milestones in more detail.