TL;DR

A developer published DOESNT, a new esoteric language built as a single-string rewriting system that describes what computations it won't perform. The system stores its state in a ring buffer, uses longest-prefix matching with an explicit rejection marker, and already has an addition example, a poem, and an implementation online.

What happened

A contributor using the handle "and NULL" introduced DOESNT, an esoteric programming language that realizes the concept behind LANGUAGE 18 from the "FORTY-FOUR ESOLANGS" prompts: programs specify what they don't do rather than what they do. DOESNT is implemented as a single-string rewriting system with the program string held in a ring buffer. Each rule tries to match the longest possible prefix up to a subpattern it is required to reject; the special token "!!" forces immediate rejection of a candidate rule, preventing certain problematic backtracking loops. The author said they nearly abandoned the project after encountering matching difficulties but found a quick fix and posted a working addition example. They also published a short poem written in DOESNT and shared a corrected implementation URL and a landing page describing the language.

Why it matters

  • DOESNT illustrates a subtractive programming model that flips typical program intent by expressing exclusions rather than actions.
  • The language exposes interesting matching and backtracking behavior in rewriting systems, including a pragmatic solution to avoid infinite loops.
  • Its design may be useful for experimental generative work—author suggests procedural poetry and randomized initial states as applications.
  • The project has attracted community comments relating it to other esolangs (Thue) and unusual control-flow concepts (COMEFROM).

Key facts

  • DOESNT is a single-string rewriting system whose state is stored in a ring buffer.
  • Rules attempt to match the longest possible prefix before encountering a subpattern the rule 'doesn't' take.
  • A special marker, "!!", in a pattern causes immediate rejection of that rule, taking nothing from the input.
  • The author published an example program that performs addition; they also produced a poem written in DOESNT.
  • An implementation was posted at https://www.sheeeeeeeep.art/raw/DOESNT.lua after an initial wrong link was corrected.
  • A short explanatory page for DOESNT is available at https://www.sheeeeeeeep.art/esolangs-doesnt.html.
  • The creator reported struggling to write a fizzbuzz example and noted the language currently has some limitations.
  • A community responder compared DOESNT to Thue and commented it evokes COMEFROM-like thinking.

What to watch next

  • Author plans to write a formal esolang-wiki entry for DOESNT in the future (stated as a future intention).
  • Progress or examples addressing the fizzbuzz challenge the author mentioned; they noted current limitations while attempting it.
  • Wider adoption, ports, or analyses of DOESNT's computational power are not confirmed in the source.

Quick glossary

  • esoteric programming language (esolang): A language created largely for experimentation, exploration, or artistic intent rather than practical programming use.
  • string rewriting system: A formal system where strings are transformed according to a set of substitution rules.
  • ring buffer: A fixed-size data structure that treats storage as circular, so new data can overwrite the oldest data when full.
  • backtracking: A search mechanism that retracts previous choices to try alternative matches or paths when a current attempt fails.

Reader FAQ

Who created DOESNT?
A developer posting as "and NULL" introduced the language on the horadric mailing list.

Where can I find the implementation?
The author posted the implementation at https://www.sheeeeeeeep.art/raw/DOESNT.lua.

Does DOESNT include example programs?
Yes — the author shared an addition example and a short poem written in DOESNT.

Is there a fizzbuzz example or is DOESNT Turing-complete?
The author reported difficulty writing a fizzbuzz example and noted limitations; whether DOESNT is Turing-complete is not confirmed in the source.

4 2 [lang] DOESNT and NULL Details 2 days ago I don't know if anyone still reads this, but I've got a funny rewriting system to share. The idea is…

Sources

Related posts

By

Leave a Reply

Your email address will not be published. Required fields are marked *