Ifle-complete
Jump to navigation
Jump to search
A language is Ifle-complete if it satisfies the following requirements:
- It must be plushie-complete and level-1 islp-complete.
- It must be able to do all functions available in ™ type 44, HQ9+-, and deadfish~.
- It must be able to print the strings kiwi, No., and Nope..
- It must be able to do FizzBuzz for a specific number of integers.
- It must have a self-interpreter.