Orchestrate logic.
Designed for readability.

Heddle is a hybrid-paradigm language designed to orchestrate logic. By combining functional and imperative paradigms, its simple design makes it easy to read, write, and understand. A language for both Engineer and AI agents.

How Heddle Works

Heddle's syntax is designed to be expressive and concise, separating what to do (functional) from how to do it (imperative). It is based on simple declarations, pipes, reactive pattern matching, PRQL, and row-safe error handling.

Clean by design.
Built for robustness.

Heddle enforces Clean Architecture by design, establishing clear boundaries between core business use cases and technical implementation details, creating a Screaming Architecture centered on business logic.

Logical Orchestration

Simplifies code design by decoupling orchestration flow from imperative execution, making pipeline logic clean and easy to maintain.

Columnar Layouts

Organizes data pipeline values in columnar structures internally. Write imperative code while effortlessly modeling and extending custom types.

In-Memory PRQL

Relational queries (joins, filters, projections) directly on variables. Generate new types on the fly with on-demand columnar joins.

Row-Level Failure Isolation

Redirects errors from individual records to specialized traps, acting like a built-in Dead Letter Queue for lines without stopping pipeline execution.

Compiler & VM Architecture

The Heddle framework is built as a complete compiler and virtual machine execution stack written entirely in Go, adhering to Clean Architecture principles.

GoASTParser Interop

The frontend semantic analyzer parses Go companion sources using standard AST libraries. It maps snake_case Heddle instructions to PascalCase Go targets, resolving types before execution.

Columnar Frame Buffers

Data flows through Heddle in columnar `Frame` segments, wrapping `NestedListContainer` elements. Slices and structs transition smoothly to Go representation without duplicate allocations.

Memory Arenas

VM query processing runs within dedicated memory-isolated arenas. Slices and tables are allocated, utilized, and garbage-collected in bulk to minimize GC pauses.

Stack-Based Virtual Machine

A fast, thread-safe virtual machine interprets linearized IR bytecode. It handles concurrent timer tick sequences, background event loops, and HTTP listeners cleanly.

Complete LSP Integration

An official Language Server Protocol implementation exposes real-time syntax checking, hover signatures, inlay parameter types, and semantic highlights to IDE editors.