00:00:04 ehird: eh? 00:00:14 SimonRC: Nothing. 00:00:23 SimonRC: anyway i don't think you can 00:00:29 ehird: excatly 00:00:50 lol, i just read the logs 00:00:52 so typical 00:01:00 that was the joke I was making. giving the most-general type of that function in Haskell is just as hard as getting vim to do what I was trying to do 00:01:03 "It's a question about vim. 00:01:03 Therefore, try emacs!" 00:01:11 wel, harder actually, as vim has ways round it 00:01:11 ehird: Good, then I don't need to figure out how to pass on that "clarification". 00:01:19 fizzie: "I HOPE YOU DO" 00:01:23 Do you want to betray him? :-( 00:02:24 well, vim's commands are a bit more typeable 00:02:38 * ehird sniffs. Poor AnMaster. 00:02:47 I work with xm,l a lot and it is handy to be able to type f>ct< 00:02:50 and the like 00:02:57 *Completely* unrelated, but what should I do with underload ^def command arguments? Push the whole input string on the initial stack, or split it somehow? 00:02:58 xm,l 00:03:10 fizzie: um 00:03:14 do what ais523 was going to do 00:03:14 ehird: as I said, 3 sec of lag 00:03:19 basically 00:03:24 push it as church numeras 00:03:25 numerals 00:03:27 of the ascii chars 00:03:32 you'll have to figure out how to do a list in underload 00:03:33 have fun. 00:03:55 Hrm. 00:04:18 fizzie: i would say an underload linked list is just: 00:04:36 (tip(tip-1(tip-2 SOME-NIL-SENTINEL))) 00:04:43 SOME-NIL-SENTINEL would have to be detectable somehow 00:04:45 ah! 00:04:46 of course 00:04:47 fizzie: 00:04:51 for the list (a b c) 00:04:57 fizzie, well? 00:05:02 not going to do it I see 00:05:05 *shrug* 00:05:07 AnMaster: He read the logs already. 00:05:10 ok 00:05:13 LOL 00:05:17 did he ask you to pass it on again? 00:05:23 he's so desperate i'll misunderstand him :'( 00:05:51 fizzie: i've figured out a list structure 00:05:52 sec 00:06:05 ^echo I also suggested nano. Just FYI. If I have an issue with a program, and can't solve it, I often try some other program. 00:06:05 I also suggested nano. Just FYI. If I have an issue with a program, and can't solve it, I often try some other program. I also suggested nano. Just FYI. If I have an issue with a program, and can't solve it, ... 00:06:20 lol 00:06:21 ^echo night... 00:06:21 night... night... 00:06:23 AnMaster: stop being a retard. 00:06:28 if you have a problem with a program 00:06:30 you try and solve it. 00:06:33 by asking people 00:06:36 ehird!*@* added to ignore list. 00:06:39 you don't change program. 00:06:42 fizzie, you may want to tell ehird that ^ 00:06:52 * ehird checks logs 00:06:52 and I *don't* read logs 00:06:52 ehird: He ignored you again. 00:06:54 ignored? 00:06:55 lol 00:06:59 fizzie, what do you mean again? 00:06:59 ehird: the anal master is /ignoring you too 00:07:01 ^echo AnMaster two can play the ignore-avoidance game. 00:07:01 AnMaster two can play the ignore-avoidance game. AnMaster two can play the ignore-avoidance game. 00:07:09 AnMaster: Haven't you done it before? I would think so. 00:07:22 In any case, that's about as much message-passing as I care to do. 00:07:26 wait, that *is what your names stands for isn't it? 00:07:28 ^echo Well you did it first, a few weeks ago iirc 00:07:28 Well you did it first, a few weeks ago iirc Well you did it first, a few weeks ago iirc 00:07:34 ^echo shrug 00:07:35 shrug shrug 00:07:36 SimonRC: i think it means annoying master. 00:07:42 ^echo AnMaster - please shut up. 00:07:42 AnMaster - please shut up. AnMaster - please shut up. 00:07:48 ^echo I ignored you for a reason. 00:07:48 I ignored you for a reason. I ignored you for a reason. 00:07:50 -!- fungot has left (?). 00:07:51 anyway 00:07:54 fizzie: list structure 00:07:55 i has it 00:08:01 fizzie, good 00:08:07 ummmmmmm 00:08:09 now I'm heading to bed *yawn* 00:08:10 fizzie: what's dip in underload again 00:08:11 oh 00:08:12 nm 00:09:18 fizzie: 00:09:18 ((a)((b)()(a~*^)~a*^)(a~*^)~a*^) 00:09:20 i think. 00:09:25 that's (a b) 00:09:50 oi fizzie 00:09:58 im helping you :( 00:10:15 Is that worth a ":(" then? 00:10:22 fizzie: just pay attention to me :-P 00:10:23 basically 00:10:47 LIST = (HEAD(TAIL)(a~*^)~a*^) 00:10:51 where TAIL :: LIST 00:10:56 fizzie: or 00:11:00 LIST can also be 00:11:01 () 00:11:10 i think you can use it like this: 00:11:15 (S)LIST^ 00:11:21 fizzie: can i get fungot to test that? 00:11:28 Sure. 00:11:31 -!- fungot has joined. 00:11:43 I'm not in a very Underloady frame of mind today, but I am paying attention, fwiw. 00:11:45 ehird: Would you just let me see your effing bonko code already :P 00:11:51 ^ul (S)((hello)()(a~*^)~a*^)^ 00:11:52 hello 00:12:07 ^ul (S)((hello)((hello)()(a~*^)~a*^)(a~*^)~a*^)^ 00:12:07 hello 00:12:11 fizzie: bugg :( 00:12:15 oh, right 00:12:17 I'm sure you need a : somewhere. 00:13:12 fizzie: 00:13:13 well 00:13:15 it executes the head 00:13:15 -!- atrapado_ has joined. 00:13:18 the issue is dropping up again 00:13:47 fizzie: lets try this: 00:13:52 (HEAD(TAIL)(a~:(*^)~a*^)~a*^^) 00:14:04 ^ul (S)((hello)((world()(a~:(*^)~a*^)~a*^^))(a~:(*^)~a*^)~a*^^)^ 00:14:04 hello 00:14:07 fizzie: :( 00:14:42 fizzie: any ideas? 00:15:06 My Underload thinking goes slowly. 00:15:14 ditto 00:15:18 but here is my basic algorithm: 00:15:23 -!- atrapado has quit (Nick collision from services.). 00:15:39 you have the program, then the head, then the tail 00:15:41 so 00:15:43 you use dip 00:15:44 -!- atrapado_ has changed nick to atrapado. 00:15:45 so now you have 00:15:47 program, then the head 00:15:49 so now you flip 00:15:53 the head, then the program 00:15:55 and concat 00:15:57 the head the program 00:15:59 then run it 00:16:01 but now you have no program 00:16:03 SO 00:16:05 you have the program, then the head then the tail 00:16:07 dip 00:16:09 the program, head 00:16:11 swap 00:16:13 head, the program 00:16:15 dup 00:16:17 head, the program, the program 00:16:19 dip 00:16:21 head, the program 00:16:23 concat 00:16:25 head the program 00:16:27 run, finish dip 00:16:29 the program 00:16:33 finish dip 00:16:35 the program the fail 00:16:37 *tail 00:16:39 and then run 00:16:41 hmm 00:16:43 nil should actually be (!) 00:16:45 to eliminate the program 00:16:47 fizzie: see my basic algo? 00:16:53 ^ runs func for every element in list 00:18:15 ((hello)((world)(!)(~:(*^)~a*^)~a*^^)(~:(*^)~a*^)~a*^^) 00:18:22 ^ul (S)((hello)((world)(!)(~:(*^)~a*^)~a*^^)(~:(*^)~a*^)~a*^^)^ 00:18:22 ...bad insn! 00:18:27 fungot: huh? 00:18:27 ehird: its only " real" programming language? are there significant advantages to that over using fnord fnord 00:18:30 fizzie: 00:18:38 ah wait 00:18:46 ^ul (S)((hello)((world)(!)(~:(*^)~a*^)~a*^^)(~:(*^)~a*^)~a*^~*^)^ 00:18:46 ...bad insn! 00:18:51 ^ul (S)((hello)((world)(!)(~:(*^)~a*^)~a*^^)(~:(*^)~a*^)~a*^*^)^ 00:18:51 ...bad insn! 00:18:57 wtfoo 00:19:16 -!- Slereah_ has joined. 00:21:07 I would rather start by using just ((foo)((bar)...)) -style lists instead of "something that evaluates top-of-stack for each element", given how much easier car and cdr sound for that sort of lists. But really, I'm not in an underloady mood. And sure, that sort of list might be trickier to use. 00:21:38 hm. 00:21:40 good point. 00:21:41 but fizzie 00:21:46 how do you check if you've reached the end of the list? 00:21:49 how can you do == ()? :-P 00:22:30 ehird: Would you just let me see your effing bonko code already :P 00:22:38 GregorR: i gave up on it 00:22:38 :D 00:22:48 WELL THEN I GIVE UP ON YOU 00:22:58 GregorR: ...ok :( 00:23:01 Maybe not plain ((foo)((bar)...)) then; maybe something more like (((foo)^)(((bar)^)(!))); but *really*, I don't want to think about Underload now. 00:23:15 Er, ~^ there instead of ^. 00:23:22 fizzie: Oh, that could work. 00:23:24 It's easier to "detect" (!). 00:27:07 ^ul (((foo)~^)(((bar)~^)(()(!))))(~^~(S)~^~:^):^ 00:27:07 foobar 00:27:18 fizzie: Hooray. 00:27:20 Ok, so basically 00:27:33 Make the input one of those lists, with the elements as the underload-church-numearls. 00:27:35 And voila. 00:27:40 :) 00:28:02 That sounds like quite a lot of stack, but... 00:28:55 fizzie: You perhaps thought Underload was lightweight? 00:29:01 fizzie: The alternative is to add a new char - say, @ 00:29:09 Which pushes a church numeral of the next input char on the stack. 00:29:11 Or 0 on EOF. 00:29:22 Well, it does say "underload", it sounds small. 00:30:44 Converting those church numerals back to ASCII for output sounds like something which would pretty fast go over the IRC message length limits. 00:31:45 fizzie: Oh. True. 00:31:53 fizzie: Then you need _two_ new commands. 00:32:03 @ to get a church numeral, $ to output a church numerally-thing as ascii. :\ 00:33:05 I think I'll let ais523 to do the bleeding-edge feature-adding; as far as Underload is concerned, I'm happy to be a follower. 00:33:32 fizzie: underload is abandoned, underlambda is what is being developed, i think. 00:41:22 I have a feeling I need sleep; early morning again, and getting 0145 around here. 00:42:15 'night 00:42:22 -!- M0ny has quit ("Hum... Hum..."). 00:47:48 -!- mbishop has quit (Remote closed the connection). 00:48:29 -!- Corun has joined. 00:53:14 outputting church numerals actually wouldn't be too hard 00:53:25 SimonRC: it would you have to store every ascii char 00:53:27 in the program 00:53:28 you just feed increment into them and apply that to zero 00:53:34 lol 00:53:37 SimonRC: in underload? 00:53:43 you couldnt do that. 00:53:49 in underload, code blocks (aka strings) are opaque 00:54:02 I meant as a primitive: output church numeral as ascii char 00:54:05 ah 00:54:07 well duh 00:54:28 -!- atrapado has quit ("quita"). 00:54:31 * SimonRC wonders if automatic-church-numeral-detection is practical 00:54:45 tc 00:55:10 SimonRC: its tc 00:55:22 well, how about common cases then? 00:55:39 sure, but thats not pure. 00:57:18 "pure"? 00:57:24 SimonRC: pure. clean 00:57:27 elegant. 00:57:37 :-S 00:57:46 It might be anice optimisation 00:58:23 underload is the slowest thing evr 01:00:04 bye 01:06:17 * SimonRC goes, leaving you with this question: what character would be best paired with Godot in a slashfic? 01:06:44 -!- optbot has set topic: the entire backlog of #esoteric: http://tunes.org/~nef/logs/esoteric | Hrm; I seem to have forgotten the details of gas's constant syntax.. 01:09:52 -!- Slereah has joined. 01:10:04 >:| 01:21:49 -!- CakeProphet has quit (Read error: 110 (Connection timed out)). 01:22:27 -!- Slereah_ has quit (Read error: 110 (Connection timed out)). 01:28:41 -!- mbishop has joined. 01:41:08 -!- CakeProphet has joined. 01:54:14 -!- mbishop has quit ("leaving"). 02:30:22 autoScheme can now be run in to generate a