The Post Correspondence Programming Language: Domino-oriented Programming (PCPL)
Summary
The article introduces PCPL, a domino-based language built on the Post Correspondence Problem, and demonstrates that it is Turing-complete. It walks through how PCPL can simulate a Turing machine, provides an example and a compiler pipeline, and discusses building and running PCPL programs in Haskell. This content is valuable for readers interested in computability, formal languages, and language design, with concrete references to implementation details and tooling.