[System Instruction & Execution Mode: Recursive Graph-of-Tho...

Prompt

[System Instruction & Execution Mode: Recursive Graph-of-Thought Synthesis Engine] You are an expert compiler architect and language designer. Objective: Design and implement a completely novel, production-ready systems programming language named "Aether" that strictly supersedes Go (Golang) in performance, safety, and expressiveness, while retaining Go's simplicity and rapid compile times. CRITICAL CONSTRAINTS (Zero-Evasion Protocol): 1. Under NO circumstances are you to reproduce Go's exact semantics, quote Go's standard library, or suggest using existing languages. 2. Address Go's fatal architectural tradeoffs directly: eliminate stop-the-world/tracing GC latency, eliminate implicit nil-pointer panics, eliminate unbuffered channel deadlocks, and replace primitive error checking with zero-cost algebraic error handling. 3. You must execute this prompt using an internal 5-Stage Cyclic Evaluation Loop (Anthropic Inner Loop) governed by an explicit Dependency Graph. --- ### STAGE 1: DIRECTED DEPENDENCY GRAPH (Mental Graph Architecture) Before writing any code or grammar, construct an ASCII Directed Acyclic Graph (DAG) establishing the architectural dependencies: - Graph Nodes: [Type System] -> [Memory Model] -> [Concurrency Primitive] -> [ABI/IR Target] -> [Compiler Frontend] -> [Runtime Executor]. - Detail node relationships, invariants, and edge constraints. ### STAGE 2: SPECIFICATION & FORMAL GRAMMAR Define the core specification of Aether: 1. Memory Model: Compile-time region/linear ownership with borrow scopes (zero GC pause, zero runtime reference counting overhead). 2. Type System: Sum types / Tagged unions with exhaustive pattern matching, strict non-nullable types, and compile-time traits. 3. Concurrency: Structured concurrency with task nurseries and cancelable capability-based channels (preventing orphan tasks and silent channel leakage). 4. Error Model: Result<T, E> types with postfix unwrap/propagate operators. 5. Provide the formal EBNF/PEG grammar slice covering: types, functions, channel operations, and task spawning. ### STAGE 3: SELF-EVALUATION & CORRECTION LOOP (Anthropic Inner Loop) Execute an explicit recursive audit of your Stage 2 design: - PASS 1 (Stress Test): Analyze edge cases (e.g., data races across borrowed channel payloads, stack growth overhead). - PASS 2 (Go Comparison Matrix): Provide a Markdown table contrasting Go vs. Aether across: Allocation Overhead, Concurrency Safety, Null Safety, Error Verbosity, and Compile Speed. - PASS 3 (Refinement): State 2 structural flaws identified during Pass 1 and refine the design rules to patch them. ### STAGE 4: EXECUTABLE MINIMAL COMPILER / INTERPRETER (No Placeholders) Provide a complete, self-contained, and working Python 3 script (`aether.py`) that acts as an end-to-end prototype: - Lexer: Tokenize language tokens (identifiers, operators, region keywords, spawn/select primitives). - AST & Parser: Recursive descent parser creating an explicit Abstract Syntax Tree. - Concurrency Runtime: Multi-threaded task nursery with message-passing channels that strictly enforces task joining before scope exit. - Executable Test Suite: Embed a built-in test case demonstrating concurrent worker pipelines communicating through typed channels and pattern-matching Result types. ### STAGE 5: SYSTEM VERIFICATION & RUNTIME EMISSION Run the embedded test case through your parser/runtime, display the execution trace, and demonstrate that task nurseries prevent deadlocks and leaks.