JavaScript - Dynamic curry function for addition

I think i win

Nice exercise, but it's way too much work to do this in 99% of cases

(a=>a.bind(0,a))((f,n,s,a)=>a?a[0]?s:f.bind(0,f,0,(s?s:"")+String.fromCharCode(n)):f.bind(0,f,n+1,s))()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()``()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()```'`

@WIPocket When Lisp programmer writes javascript...

@ganjaman aren't operators already curried in OCaml?

@RememberMe yes they are

@WIPocket That's cool, I spent few minutes analysing it and built a parenthesis generator:

const stringToParenthesis = str => {
return '(a=>a.bind(0,a))((f,n,s,a)=>a?a[0]?s:f.bind(0,f,0,(s?s:"")+String.fromCharCode(n)):f.bind(0,f,n+1,s))()``'+Array.from(str).map(char => {
let str = '';
for(let i=0; i<char.charCodeAt(0); i++) {
str+='()';
}
return str;
}).join('``')+'```\'`';
};

inb4 obligatory "Javascript sucks doo doo because it sucks doo doo"

@crisz Cool spagetti!
I also made one (and figured out it crashes after too many characters when you execute it because of a stack overflow/too much recursion)

what does curry have to do with any of this

@Parzi https://stackoverflow.com/a/36321/...