What CompSci concepts have been used in conlanging?

Question

I am looking for things in the vein of the use of run-length encoding in representing arbitrarily large integers in a Haskell-based conlang.

An example might be tree data structure based punctuation in a writing system (Lispy), a language in which sentence ends are signaled not by structure but by an explicit stop word (like a C-style language's semi-colon), or a language in which there are labels (explicitly or implicitly) assigned to each sentence, which can be used to refer to that sentence (assembly or BASIC-like).

Could someone share some examples of how CS ideas are used in conlanging?

Answer 1

Some examples of conlangs which use CS concepts include

• Fith, as pointed out to me by @bradrn in the comments of this question. It is a stack-based conlang, similar conceptually to forth, or min. It is spoken by "a race of centaur-like marsupials" known as Fithians.

• Shallow Fith, which is intended as a human speak-able subset of Fith, devised to allow Fithians and humans to communicate.

• The conlang from this question, Leksah. It is a functional conlang, inspired by Haskell, which was created for a world-building project. Leksah has functions, which act similarly to verbs, a function application word, and literals, which act somewhat like nouns.

Edit:

I am in the process of creating an as-yet unpublished conlang with a system of pattern matching with pronouns. For example, The red horse is friends with the black dog. The red <third-person pronoun> is much bigger than the black <third-person pronoun>, would mean that

1. The red horse and black dog are friends.
2. The red horse is much bigger than the black dog.