We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.

User:DigitalDetective47

From Esolang
Jump to navigation Jump to search

Hi, I like to make stuff. Check out my website here.

Languages

  • Left‐Right March: A one‐dimensional fungeoid.
  • Expressions: A basic and very unoriginal Forte clone.
  • Dashes: A language where programs are sequences of dashes.
  • Highways: My first two‐dimensional language, also my first concurrent language.
  • PRG: A weirdlang where every word is three letters long.
  • Fool: A language based on boolean logic, which requires unconventional methods to achieve control flow.
  • Cratefuck: A language based around the idea of a limited number of data markers on an infinite tape.
  • ONE WAY: A language based on one‐way movement of data across stacks.
  • *lang: A language where the only data type is pointers.
  • Unicodefuck: A Binaryfuck derivative where all programs must be valid UTF-8 strings.
  • Monotonic Boolfuck: A Boolfuck variant where cells cannot be unset once they are set.

Here is some quick data on these Esolangs:

Name Paradigm Determinism Memory Computational class I/O Dimensions Implemented Self‐modification
Left‐Right March Imperative Deterministic Cell‐based Unknown Yes 1 Yes Yes
Expressions Imperative Deterministic Uncategorized Unknown Yes 1 No No
Dashes Imperative Deterministic Cell‐based & stack‐based Turing-complete Yes 1 Yes No
Highways Imperative Probabilistic Cell‐based Turing-complete Yes 2 No No
PRG Imperative Deterministic Variables & dynamic memory Unknown Yes 1 No No
Fool Imperative Deterministic Cell‐based Turing-complete No 1 Yes No
Cratefuck Imperative Deterministic Cell‐based Turing-complete Output only 1 Yes No
ONE WAY Imperative Deterministic Stack‐based Turing-complete Yes 1 Yes No
*lang Imperative Deterministic Variables Unknown Output only 1 Yes No
Unicodefuck Imperative Deterministic Cell‐based Turing-complete Yes 1 No No
Monotonic Boolfuck Imperative Deterministic Cell‐based Unknown Yes 1 No No