|
Note
|
This document provides a high-level summary of proof progress for Haec.
For the authoritative honesty snapshot, see |
Haec: A Turing-complete language whose type discipline is trope-particularity.
A Turing-complete language (it has general recursion) in which every operation over a property-instance — a quality as borne by this entity, in this context, under these conditions — carries a loss-shape grade.
Duck typing asks whether it quacks. A trope language lets you write the program that decides which quack to keep — and the checker tells you, against each consumer’s declared use, whether the quack you kept was enough.
Haec does not decide whether a flow is acceptable. It produces a record of graded effects — the Trope IR — and the (language-independent) tropechecker consumes that IR and returns a verdict against each consumer’s declared use-model.
Turing-completeness lives in Haec’s terms; decidability lives in the checker’s grade algebra. The two never meet: the checker never executes a Haec program, so Rice’s theorem is no obstacle — an unbounded lossy loop simply gets an honest "unknown" (
top) grade, which any demanding use rejects.
From AFFIRMATION.adoc (as of 2026-06-22):
What exists (design pass):
- Surface grammar (design/grammar.ebnf)
- Elaboration table with per-construct lowering-correctness (O2) obligation (design/elaboration.adoc)
- examples/ pairing small programs with their lowered Trope IR
Ground truth: Every examples/*.ir.json is schema-valid against the IR contract
and round-trips through the sibling trope-checker to the verdict the example states.
just check validates this standalone against the vendored schema.
What does NOT exist yet (deferred, named):
- The compiler (parser, type-checker, elaborator, codegen — compiler/STATUS.adoc)
- The LSP (lsp/STATUS.adoc)
- A runtime
- The O2 lowering-correctness proofs are stated as obligations, not yet discharged (HC-5: stated, not asserted-as-done)
Honest scope: Haec is one front-end among many; it defines neither the checker nor the vocabulary. Its sole present claim is that its elaboration targets the IR and its examples lower to IR the checker accepts.
Haec is designed with clear separation of concerns:
| Component | Role | Status |
|---|---|---|
Haec (this repo) |
Front-end language |
Design pass complete |
Trope IR |
Language-independent intermediate representation |
Defined |
trope-checker |
Portable checker |
Separate repo ( |
Compiler |
Parser, type-checker, elaborator, codegen |
Not yet implemented ( |
LSP |
Language server |
Not yet implemented ( |
Runtime |
Execution environment |
Not yet implemented |
No proofs have been completed for Haec yet, but there is a clear proof infrastructure:
The repository contains:
- AFFIRMATION.adoc — Honesty snapshot (dated 2026-06-22, real content)
- design/grammar.ebnf — Surface grammar
- design/elaboration.adoc — Elaboration table with O2 obligations
- examples/*.ir.json — Schema-valid IR examples that round-trip through trope-checker
- compiler/STATUS.adoc — Compiler status
- lsp/STATUS.adoc — LSP status
No proofs/ directory yet, but the design documents establish clear proof obligations.
From AFFIRMATION.adoc and design documents:
| ID | Obligation | Category | Status |
|---|---|---|---|
HC-5 |
O2 lowering-correctness proofs |
Lowering |
Stated, not asserted-as-done |
O2 per-construct |
Per-construct lowering correctness |
Lowering |
Stated in elaboration table |
Compiler correctness |
Parser, type-checker, elaborator, codegen |
Implementation |
Not started (compiler not implemented) |
| Category | Item | Count | Evidence |
|---|---|---|---|
Design |
Surface grammar |
1 |
|
Design |
Elaboration table |
1 |
|
Examples |
IR examples |
Multiple |
|
Schema validation |
All examples valid |
All |
|
Round-trip |
Through trope-checker |
All |
Verified against stated verdicts |
Honesty snapshot |
AFFIRMATION.adoc |
1 |
Dated 2026-06-22, real content |
| Gap | Category | Notes |
|---|---|---|
O2 lowering-correctness proofs |
Lowering |
HC-5 stated, not done |
Per-construct lowering |
Lowering |
Obligations stated in elaboration table |
Compiler implementation |
Implementation |
Not yet started |
LSP implementation |
Tooling |
Not yet started |
Runtime implementation |
Execution |
Not yet started |
No proofs directory |
Infrastructure |
Not yet created |
| Metric | Count | Notes |
|---|---|---|
Design documents |
2+ |
grammar.ebnf, elaboration.adoc |
Example IR files |
Multiple |
All schema-valid and round-trip verified |
Status documents |
2+ |
AFFIRMATION.adoc, compiler/STATUS.adoc, lsp/STATUS.adoc |
Proofs completed |
0 |
No proofs directory yet |
Proof obligations stated |
1+ |
HC-5 + per-construct O2 |
Haec is honest about its gaps:
|
Important
|
|
| Claim | Can We Claim It? | Evidence | Caveat |
|---|---|---|---|
Surface grammar defined |
✅ Yes |
|
Design pass complete |
Elaboration table defined |
✅ Yes |
|
O2 obligations stated |
Examples round-trip |
✅ Yes |
|
Schema-valid, correct verdicts |
|
✅ Yes |
Standalone validation |
Ground truth |
O2 lowering-correctness |
❌ No |
HC-5 stated, not done |
Proofs not discharged |
Compiler implemented |
❌ No |
|
Not started |
Proofs exist |
❌ No |
No proofs directory |
Early implementation phase |
| Gate | Command | Status |
|---|---|---|
Design validation |
|
✅ Validates examples against schema |
Full build |
Not yet configured |
Compiler not implemented |
Proof check |
Not yet configured |
Proofs not implemented |
just check validates that all example IR files are schema-valid and round-trip
through the trope-checker to the stated verdicts.
-
For users: Haec is in design phase with verified examples but no implementation. The Trope IR is defined and examples work, but there’s no compiler yet.
-
For contributors: The highest priority is implementing the compiler (parser, type-checker, elaborator, codegen) so that O2 lowering-correctness proofs can be discharged. The second priority is the LSP.
-
For auditors: Haec is honest about gaps — the AFFIRMATION.adoc explicitly states what exists (design, examples) and what doesn’t (compiler, proofs). The examples are verified but not proven.
| Document | Purpose | Location |
|---|---|---|
README.adoc |
Vision, core concept, architecture |
Root |
AFFIRMATION.adoc |
Authoritative honesty snapshot (dated 2026-06-22) |
Root |
design/grammar.ebnf |
Surface grammar |
|
design/elaboration.adoc |
Elaboration table with O2 obligations |
|
examples/*.ir.json |
Schema-valid IR examples |
|
compiler/STATUS.adoc |
Compiler status |
|
lsp/STATUS.adoc |
LSP status |
|
Haec is part of the trope-theoretic ecosystem:
| Project | Relationship | Haec’s Role |
|---|---|---|
trope-checker |
Portable checker |
Separate repo; checks Haec’s Trope IR output |
Vocarium |
Trope database |
Haec produces Trope IR for Vocarium |
Hermeneia |
Query language |
Sibling project; queries Vocarium |
Haec’s design cleanly separates: - Language front-end (Haec) — produces Trope IR - Checker (trope-checker) — validates Trope IR against use-models - Vocabulary — not owned by Haec; separate concern
This separation means Turing-completeness (Haec) and decidability (checker) never meet, avoiding Rice’s theorem obstacles.
The AFFIRMATION.adoc explicitly states: "Haec is one front-end among many; it defines neither the checker nor the vocabulary. Its sole present claim is that its elaboration targets the IR and its examples lower to IR the checker accepts."
Generated: 2026-08-14
Source of truth: AFFIRMATION.adoc + README.adoc