@DLosc cool thanks

@DLosc if you are the room owner you may wanna add the lotm thread and the github to the description

I don't want to clutter up the description too much, but I'll pin some info

Resources: GitHub | TIO | Tips | LotM post

@DLosc how to remove last element?

just (reverse (tail (reverse x)))?

@Razetime Looks that way, yeah.

(with t for tail, of course)

i showed tinylisp to another person today

and they're trying a C implementation of it

(I think i will also make one in my spare time)

Well now I have to implement it in Clojure

tinylisp in a lisp

how refreshingly meta

Is there a bootstrapped version of tinylisp?

@Razetime Original is my middle name 😎

@Razetime Sweet. ^_^ (There is also a C implementation on the original challenge that is really clever.)

@user Meaning...?

i dunno what's going on there

i just want to make a modes timpl

i've never done tail call elimination before

@DLosc My real name is Original Original Original VI, didn't you know? :P

@Razetime TCO is pretty fun to implement--it's basically a rewriting pass in your evaluate function, repeated until it's not possible to rewrite the expression any further.

@user I do remember that, but that's not the message I was replying to. ;)

Oh lol

I meant a tinylisp interpreter written in tinylisp

@user Ah. No, I haven't ever tackled that.

@DLosc Can you teach a bit of tinylisp for rep?

@DLosc confusing

I think for an interpreted language, bootstrapping isn't a good idea, since it just makes everything slower.

True

A tinylisp interpreter in tinylisp would be quite an accomplishment, though.

Is there a way to print the string ")"

that sounds like one of the most painful things a person can be subjected to

No, the most painful thing a person could be subjected to would be writing a tinylisp interpreter in tinylisp and then getting kicked in the stomach

Try it online!

I mean, Nitrodon made a Brain-Flak interpreter in Brain-Flak, so...

well nitrodon is probably in a mental asylum now

@DLosc is there a way to compare types without loading library? I have this for "Scan a ragged list"

( I know it's 112 bytes by removing the (d f( )

You could do something like this, I think

Or better yet

(e(q Int)(type x

@chunes Oh it was (q Int) that I was missing; I was trying to compare to Int directly like (type? does thanks!

@Giuseppe Yeah, Int is a library shortcut for (q Int). Depending on what types you're comparing, you can also do some hacky stuff with builtins, since passing the wrong types to a builtin prints an error message but also returns nil.

@Giuseppe So in this case, since you have either a list or a positive integer, you can replace (e(type(h L))(q Int)) with (a(h L)1): positive integer (truthy) if (h L) is an integer, or nil (falsey) if it's a list.

@Giuseppe Since your second answer is on a challenge I've previously answered, I can't give it a 50-point bounty. Is it okay if I bounty your first answer instead?

@DLosc is that why programs will run with nonsense output even though it "errors"? I'll definitely have to keep that in mind.

@DLosc sure, any answer is fine by me.

@Giuseppe Yeah. There are no fatal errors IIRC.

@DLosc I don't see where map* is defined.

It's in matrices.tl because it's implemented in terms of transpose. Not the most intuitive location, I admit.

Ah the only place I didn't check. Thanks.