Language succession
answer-chaining string
Given two words (two strings of lowercase-only letters separated by a space) as input to a program PX written in language X, output two programs in languages Y and Z such that program PY outputs the first word and program PZ outputs the second word. Yo...
@RikerW This image took a second to load and for a moment I was convinced you posted a gif of the spinner that Stack Exchange uses. I was rather peeved.
cheddar> Math.fib(2)
Yeah... no functions yet...
If you're complaining that why I haven't made them, make them yourself and make a PR
why do I have to make everything?
< Unprintable object of class "CheddarFunction" with literal value undefined >
heh whoops
@CᴏɴᴏʀO'Bʀɪᴇɴ question: does the Math.fib function you made return a JS number or a Cheddarnumber?
@Dennis That's a good question. I want to say false is not allowed since its not a valid index, but depending on interpretation, like the linked meta, it could be viewed as a representastion of zero. All those answers in the meta post bring up good points but there's not any consensus
@miles None of the answers actually says it shouldn't be allowed, just that allowing it by default would surprise newcomers. I think false is rather zero-y in Julia (1 + false etc. all give the expected output and @printf("%d",false) dutifully prints 0), but it's your call.
@Dennis I lean towards that choice too, since most languages will interpret false as 0 and true as 1. Only a few will error out or give incorrect output like Mathematica.
