13:25 <razzy> hello everyone :]

13:30 <abu[m]> Hi razzy! ☺

14:57 <Hunar> Hello :)

14:57 <Hunar> I have a general lisp question. can I loop through two lists at the same time using only recursion? not using any other index based loop or built in function. So passing this

14:57 <Hunar> '((1 2 3) (4 5 6)) and it would result in something like '((1 4) (2 5) (3 6))

14:59 <abu[m]> Normal mapping functions should work: (mapcar list (car L) (cadr L))

15:02 <abu[m]> Or do you mean not even mapcar, because it is built-in?

15:02 <Hunar> yes, but that would be in the (built in functions) catagory, I recently found out about SectorLisp which is the closest thing to the original Lisp, it doesnt even have numbers. it has lambda and simple stuff like Eq cons NIL (I'll post the complete list of functions later) so you only have recursion, can I implement it in that case?

15:03 <abu[m]> yes

15:03 <Hunar> I scratched my head for a few hours and couldn't get any idea that worked

15:04 <abu[m]> I post something

15:05 <Hunar> :)

15:06 <abu[m]> http://pb1n.de/?909abd

15:06 <abu[m]> Must be translated to other Lisps

15:08 <Hunar> Aha :D now I understand

15:08 <Hunar> Thank you ! :)

15:08 <abu[m]> ☺

15:18 <Hunar> I think this is all of the functions that SectorLisp has (NIL CONS QUOTE ATOM EQ LAMBDA COND CAR CDR )

15:19 <abu[m]> You need also 'de' or 'defun' or so

15:19 <abu[m]> And no 'set'?

15:26 <Hunar> It uses (I forgot the name) to avoid defun .. like this ( '((Add) (Add 2 3)) '((A B) (+ 1 2)) )

15:26 <Hunar> same trick for setting variables

15:27 <abu[m]> Looks like some association list

15:52 <Hunar> Finally found it, the trick is called Y-Combinator. here instead I define PI as 3 and use add function twice while only defining it once... (full message at <https://libera.ems.host/_matrix/media/v3/download/libera.chat/28d6603250fe9826374dcbb053b4c56f54c7b451>)

15:53 <Hunar> without de defun or setq

15:53 <Hunar> But i think everything is immtutable since there is no set

15:57 <abu[m]> Ah, yes, Y-Combinator. There is even a PicoLisp version in RosettaCode.

15:58 <abu[m]> and, yes, it does not "set" anything. Builds a function and calls it

15:59 <Hunar> :)

18:20 <abu[m]> This is well along the PicoLisp line: https://whitep4nth3r.com/blog/html-is-all-you-need-to-make-a-website/