Skip to content

Introducing LOVE-LANG: Linguistics as Code

Introducing LOVE-LANG: Linguistics as Code

Section titled “Introducing LOVE-LANG: Linguistics as Code”

We are thrilled to announce the first public release of LOVE-LANG — the List Oriented Virtualized Evaluator — a novel programming language that treats language itself as a first-class citizen.

LOVE is a linguistics-oriented, self-programmable, self-reflective programming language. Unlike traditional PLs that impose a fixed syntax, LOVE enables you to program the programmer. The language adapts to how you think and express intent.

Built on Racket & Sham, LOVE compiles to any target — WebAssembly, native binaries, JavaScript — nothing is off limits.

The most distinctive feature of LOVE-LANG is its five-level bracket hierarchy:

[x] # L1Variables / Data
[[x]] # L2Pure Operations
[[[x]]] # L3Type Contracts
[[[[x]]]] # L4Compiler Directives
[[[[[x]]]]] # L5System FFI / I/O

This is not arbitrary — each level encodes semantic complexity and trust. Outer rings can call inner rings, but inner rings cannot escape outward without crossing a trust boundary.

At the core of LOVE is the Superautology — an invariant that all language variants must satisfy. It is the constitution of the language. No matter how much LOVE mutates its own evaluator, it can never violate the Superautology.

hello.love
@Import[Prelude::*]
name = "LOVE-LANG"
version = 1.0.0
message = "Hello, linguistics!"
[[[[[
@print message
]]]]]

Visit the Quick Start guide to begin your journey.

  • Standard library expansion
  • Language Server Protocol (LSP) implementation
  • First-class WebAssembly compilation
  • REPL improvements
  • Package registry

We are excited to see what you build with LOVE. The future of programming is linguistic.

— The LOVE-LANG Team

Last updated: