2I1IF

2I1IF(2 interpretations, 1/infinite functions) is a (theoretical) family of languages, based off of Uncompetition.

Concept

For a language to qualify for being a part of 2I1IF, it must be able to be interpreted as "An infinite amount of inputs, and a single universal function", and "An infinite amount of functions, and a single universal input(which can be considered no input), however it must be able to generate multiple different outputs". One such language is ofcourse, Uncompetition. The first condition is met by universally every subset within ℒ, however ℒ languages can most likely not meet the second condition.

2I1IF currently has a three stricter sub group's.

Sinistry is a subset of 2I1IF, where for both, there must be an infinite amount of outputs. Uncompetition is also part of this subset.

2M1/Meta2I1IF is a subset of 2I1IF, where the language has the ability to modify the input/function. This requires the language to be able to correlate changes in one, to a change in the other.

Metastry is a combination of 2M1 and Sinistry, where both the restrictions of 2M1 and of Sinistry apply. Most 2M1 languages are propably part of Metastry, as an infinite amount of outputs may be possible by modifying the input/function every time a function is interpreted/an input is given(to the universal function).