Seggan

char (arity) - desc

whitespace - nop
newline - Starts a new function
! (1) - (any) logical not
" - String literal
# - Misc digraph char
$ (1) - (any) reverse
% (2) - (num, num) b mod a, (str, any) replace % in a with b
& (2) - (num, num) bitwise AND

m-ender

• https://codegolf.stackexchange.com/q/55422/8478 Hello, World!
• https://codegolf.stackexchange.com/q/57617/8478 Is this number prime?
• https://codegolf.stackexchange.com/q/62732/8478 Implement a Truth-Machine
• https://codegolf.stackexchange.com/q/62230/8478 Simple cat program
• https://codegolf.stackexchange.com/q/63834/8478 Count up forever
• https://codegolf.stackexchange.com/q/93441/8478 Print all integers
• https://codegolf.stackexchange.com/q/84260/8478 Add two numbers
• https://codegolf.stackexchange.com/q/106182/8478 Multiply two numbers
• https://codegolf.stackexchange.com/q/101638/8478 Shortest code to produce non-deterministic output
• https://codegolf.stackexchange.com/q/13152/8478 Shortest code to produce infinite output

danielcristofani

[How to do functions in brainfuck.

Okay. We'll translate the following program into brainfuck, with no thought of efficiency:

char fib (char a){
	switch(a):
		case 0: return 0
		case 1: return 1
		default: return fib(a-2)+fib(a-1)
}

lyxal

⊞θ₂ΣＸθ²Ｆ =+«←←←ι←Ｇ↑←↓⊟θ#
⊞θ₂                         # Create a template square with size (a^2)
   ΣＸθ²                    # Repeat that code but with the second input
       Ｆ =+                # Push the 3 character string " =+"
            «               # Reverse it and insert the characters in between the template squares
             ←←←            # Compute sqrt(a^2 + b^2) [3 byte function]
                ι←          # Use the code to create the template square and generate one based on the prior result
                  Ｇ↑←      # Join everything together into a list and make it into a template
                      ⊟θ#   # Substitute # into the template and output

lyxal

===================
|  Learning Jelly |
===================

Programs are made of links. Links are made of chains. Chains are made of atoms. Atoms have a fixed arity.
Each link's chains are evaluated according to a set of predefined "rules".

Links can be niladic (called with 0 arguments), monadic (called with 1 argument) or dyadic (called with 2 arguments)
Nilads have arity 0, monads have arity 1 and dyads have arity 2

Ksengine

#!/usr/bin/python
# -*- coding: utf-8 -*-

from __future__ import print_function
import readline  # for better console text edit experience

def isnumeric(number):
    for num in range(10):
        if str(number[-1])==str(num):
            return True