XY is a new concatenative language that merges K's vector operations with Joy's stack-based approach. Its unique architecture uses a paired stack and queue for computation, where every step transforms the entire state. This design, detailed in its specification, supports atomic K verbs and Joy's unary functions, offering a distinct model for program execution.

The language's core innovation lies in its "stackless" evaluation. Instead of a traditional call stack, XY passes the current continuation at each step via its queue. This enables powerful primitives for queue manipulation and control flow, like `->` for setting the queue or `=>` for appending to it. These tools allow for patterns like conditional jumps and stateful transformations not easily expressed in conventional languages.

XY's pattern notation and shuffle syntax (`--`) provide a concise way to destructure data and reorder operations. By treating programs as lazily-evaluated lists (quotations), it supports metaprogramming and dynamic code generation. While not flat by default, XY 2.0 aims to implement flatness, making code partitioning more predictable. This positions XY as an experimental tool for exploring alternative programming paradigms.