Beyond the Binary

Fun fact: due to existence of container-like gender identities [1] we can define arbutrary gender structures by using the notion of ``multigender'' as a glue, the same way as we make use of ``cons'' [2] in LISP. Moreover, because of lazy nature of our language, we can even deal with infinite gender lists or trees of any arity, just like we do in Haskell or any other lazy programming language!

Starting from now on, I will identify myself as a genderfluid [3] quadgender [4], where the first gender is quadgender, where the first gender is guadgender, where the first gender is quad...

[1] if you are still not aware of it, educate yourself here → http://gender.wikia.com/wiki/Multigender
[2] It directly corresponds to ``bigender''
[3] http://gender.wikia.com/wiki/Genderfluid
[4] http://gender.wikia.com/wiki/Quadgender

what programming gender is this?

>>2
It's Gay Lisp.

http://www.gay-lisp.org/

Genders are just monads.

>>4
gender is just a genderoid in the category of queerfunctors. what's the problem?

AREA EXAMPLE, CODE, READONLY

start BL func1

func1 ; function body
; code
LDR r1, =0x55555555 ; =>LDR R1, [pc, #offset to lit pool 1]

MOV pc, 1r ; end function
LTORG ; lit. pool 1 contains literal 0x55555555

data SPACE 4200 ; clears 4200 bytes of memory.
; starting at current location
END ; default literal pool is empty