Blog
All articles. All pillars. All authors.
#035 -- Pattern Matching: From Switch to Match
How we designed FLIN's pattern matching -- from simple value matching to exhaustive checking on tagged unions, and the Rust implementation that powers it all.
#036 -- Tagged Unions and Algebraic Data Types
How we brought algebraic data types to FLIN -- generic enums with associated data, Option<T>, Result<T, E>, and the Rust implementation of tagged unions.
#006 -- Why We Chose Rust to Build a Programming Language
Why Juste A. GNIMAVO and Claude chose Rust to build the FLIN programming language compiler from Abidjan.
#007 -- Writing Apps Like It's 1995 With the Power of 2026
FLIN brings back the simplicity of 1995 web development with the power of a 2026 compiler, VM, and database.
#008 -- What FLIN Looks Like in Practice: First Examples
Real FLIN code examples: todo app, reactive dashboard, API routes, database queries -- all in one language.
#009 -- The Roadmap to FLIN v1.0
The FLIN v1.0 roadmap: 3,452 tests pass, 409 built-in functions, and what remains before stable release.
#014 -- The Abstract Syntax Tree: FLIN's Internal Representation
FLIN's Abstract Syntax Tree: how the compiler represents code as expressions, statements, views, and entities.
#010 -- Building a Programming Language From Abidjan, Cote d'Ivoire
How Juste A. GNIMAVO built the FLIN programming language from Abidjan with AI CTO Claude and a $200/month budget.
#012 -- Building a Lexer From Scratch in Rust
How we built FLIN's lexer in Rust: character stream to tokens, keyword recognition, and view mode scanning.
#013 -- Pratt Parsing: How FLIN Reads Your Code
Pratt parsing in FLIN: how we implemented operator precedence, expression parsing, and control flow in Rust.
#028 -- The Reactivity Engine: How FLIN Makes Everything Reactive
FLIN's reactivity engine: automatic dependency tracking, SSE-based updates, and incremental DOM rendering.
#031 -- FLIN's Type System: Inferred, Expressive, Safe
How we designed FLIN's type system to be inferred by default, expressive when needed, and safe at compile time -- without the verbosity tax of traditional typed languages.