00:00:27 apache doesn't handle the case of looping rewrites very well... I don't know how to abort runaway requests in apache 00:01:24 ``m``b`s``c``c`tk.1r``c``bbm``s``bv`t0``s``c`tk`sb`t0``v0i 00:01:35 It is a lot faster for some reason! 00:05:00 OK 00:05:18 I run through another problem with this algorithm http://pastey.net/81239 00:05:43 "! Win" 00:05:45 Heh. 00:05:53 I think it can solve any solveable problem 00:06:10 But will never terminate for impossible problems 00:06:32 What, so you can't solve the halting problem? 00:06:36 You slacker! 00:06:39 sorry :P 00:09:23 I should make a small list of lambda expressions to short combinators. 00:09:27 Might be useful 00:09:57 I would really like a BFS prolog 00:10:06 Like ^a.a, ^a^b.ab, ^a^b.aa, ^a^b.bb, and so on. 00:10:10 BFS? 00:10:21 I shall try to see if I can trick kanren into doing it for me 00:10:29 breadth first search 00:10:50 My algorithm would be miserable in depth first 00:17:15 #ninjacode! the only native-code compilation, REPL-based, concatentative esolang! 00:20:21 Does Ninjacode flips out ALL THE TIME? 00:20:41 Yeah 00:20:46 Then you have to use the debugger. 00:21:54 Hm. My ski-bc abstractor doesn't seem to accept stuff like ^a ^b aaaaa... 00:22:06 There's an infinite loop apparently 00:23:14 Let's try by hand 00:24:17 pikhq: dude, the chans declared war on scientology! 00:24:18 http://video.google.com/videoplay?docid=-2547253292326096449 00:24:24 RodgerTheGreat: old news 00:24:24 GO, ANONYMOUS! GO! 00:24:36 still frickin' awesome 00:24:41 hi RodgerTheGreat 00:24:52 -!- eagle-101 has joined. 00:24:55 RodgerTheGreat: When it hits Slashdot, it's officially old news. 00:25:03 I'm waiting though. 00:25:13 Anonymous gets easily sidetracked 00:25:19 Especially when it's not working too good. 00:25:25 Hi, I'm looking for a version or an extension of brainfuck that can do networking, does any such version exist? 00:25:34 yeah, the power of a steaming locomotive and the attention span of a gnat 00:25:40 Though they stuck to Hal turner for quite a long time 00:25:50 eagle-101: Be sure to prod Sgeo into finishing up PSOX. 00:25:58 (Does Brainfuck over HTTP count? :P) 00:26:02 Well, actually, they're pretty much like a swarm of locust. 00:26:22 olsner, I suppose, if it is able to keep a socket open. (or the brainfuck equivalent) 00:26:30 -!- Corun has quit (Read error: 110 (Connection timed out)). 00:26:34 Not the locomotive power, but they've got number power 00:28:08 Slereah: Not in raids 00:28:15 anonymous has never given up on a raid 00:29:59 -!- olsner has quit (Remote closed the connection). 00:31:25 -!- slereah_ has joined. 00:31:25 -!- Slereah has quit (Read error: 104 (Connection reset by peer)). 00:31:51 The three transformation rules for ^x.ab assume that a or b is free, but in ^a^b`aa, there's a case where nothing is 00:32:15 Either I say that neither means ST[]T[], or I use a fourth rule 00:33:10 -!- slereah_ has changed nick to Slereah. 00:37:13 Hm. It would be some combinator Xxy = ^z.xy 00:37:23 So... ^x^y^z.xy 00:37:56 Well, I think at least. 00:38:02 why should freeness matter? provided you do transformation innermost first 00:38:31 Well, it apparently matters for a transformation into skibc 00:38:40 Says Wikipedia, at least 00:39:15 It's not in Lazy Bird, but I still use that program a lot 00:39:29 the only thing that matters in ^x.ab is whether a or b contain x 00:39:36 Shorter programs are important in that turtle that is lazy bird 00:39:39 Lazy indeed! 00:39:55 Isn't that freeness? 00:39:58 Freedom. 00:40:09 freeness with respect to other bindings is irrelevant 00:40:31 Well, yes 00:40:35 so in ^a^b`aa, the fact that a contains a only matters after the ^b part 00:40:56 Well, at one point, you get this : 00:40:57 ^a^b`aa -> ^a`K`aa 00:41:18 T[^a.S(Ka)(Ka)] 00:41:33 Wait. 00:41:39 What am I saying. 00:41:41 Aaaargh 00:41:45 My head is confused 00:42:04 It is free! 00:42:18 That doesn't solve my problem though, why is there an infinite loop? 00:43:24 -> ``BK``SII, iirc 00:44:20 It apparently gets stuck when analysing ^b`aa 00:45:00 it doesn't recognise the K case properly? 00:45:34 Oh. 00:45:53 It treats everything longer than one combinator as a product 00:46:13 ah 00:46:32 I should add that special case to the product rule. 00:46:41 For no free variable 00:47:16 Although wouldn't that some ^x^y^z`xy also work? 00:47:38 -> ^x^y`K`xy 00:48:22 The idea would just be to make the expression shorter. 00:48:36 Although I'm not sure it would 00:48:41 Hm. 00:48:54 No, I guess not. 00:49:49 -!- sebbu has quit ("@+"). 00:49:58 -!- GregorR has joined. 00:51:58 I get back k for ^a^b`aa 00:52:01 Hm 00:52:33 Oh, I forgot a ` 00:52:48 ``bk``sii 00:52:49 There 00:54:46 Hm. Thinking about it now, I might have some problem if I use .[name of a variable] 00:55:06 Since I use a hamfisted "variable name in string" to check for freedom 01:00:39 Apparently it doesn't seem to be a problem! 01:01:02 I have that "What did that guy write" feeling again. 01:08:41 -!- immibis has joined. 01:15:45 hi 01:21:45 -!- immibis has left (?). 01:22:22 Slereah: what exactly are you workin on, by the way? 01:23:05 -!- ehird has quit ("Leaving"). 01:24:07 -!- slereah_ has joined. 01:24:24 hi slereah_ i'm guessing you missed what i just said? =P 01:24:35 -!- Slereah has quit (Read error: 104 (Connection reset by peer)). 01:25:41 * RockerMONO wonders if anyone is here >.> 01:26:07 BRAINS... 01:26:27 hi oerjan, a zombie, i see ;) 01:27:34 Hello, my good Zombie. -- From the Desk of Pikhq, Minister Without Portfolio. 01:27:54 YAY ANOTHER ZOMBIE! 01:28:00 * RockerMONO pokes the zombies and wonders what they'll do 01:29:01 * pikhq wields his Rubberstamp on Oerjan 01:29:09 -!- slereah_ has quit (Remote closed the connection). 01:29:23 oh noes slereah died again :< 01:29:24 -!- slereah_ has joined. 01:29:44 So, what did you say! 01:29:50 hi again lol 01:30:02 Connexion with a halting problem. 01:30:16 and i was asking what it was you've been working on for what appears to be the whole time i've been here =P 01:30:28 :< ow 01:30:40 i just sneezed so hard i fell out of my chair 01:30:42 >.> 01:31:03 RockerMONO? More like ROCKETSNEEZE 01:31:12 haha 01:31:26 >.> 01:31:33 AGORA BRAINS... 01:31:34 (It's Lazy Bird : http://www.esolangs.org/wiki/Lazy_Bird ) 01:31:35 * RockerMONO gives up on converting this brainfuck parser and starts from scratch 01:58:29 Brainfuck parsing is braindead-easy. . . 01:58:51 You have 8 tokens. 01:58:56 Each token is a single char. 01:58:59 There's your lexer. 01:59:26 BEGINLOOP and ENDLOOP nest. 01:59:29 There's your parser. 02:01:22 pikhq: i'm doing it in C++... which i'm like a 100% noob at.... fun =P 02:02:40 Fine. Let's make this simple. . . 02:03:58 switch(input_char){'+':'-':'[':']':'.':',':do_stuff;break;} 02:04:00 Your lexer. 02:04:19 Parsing and lexing Brainfuck is the easiest thing in the world. 02:04:34 (except perhaps dc) 02:05:14 a _separate_ lexer? for _brainfuck_? 02:05:28 oerjan: Fine, it's stupid. 02:05:55 But the point is, Brainfuck is so damned syntactically simple that you don't need to work hard to parse it. 02:06:34 When you've got 8 single-char tokens to deal with, there's not all that much to parse. 02:08:44 pikhq: the layout of the parser is simple, the base of it is simple, getting all of the characters handled separately is simple.... knowing how brainfuck is parsed in terms of how the data's manipulated... not so much =\ 02:37:42 -!- immibis has joined. 04:06:24 -!- calamari has joined. 04:08:21 -!- uvanta has quit ("blame!"). 04:19:18 -!- eagle-101 has quit (Read error: 104 (Connection reset by peer)). 04:19:41 -!- eagle-101 has joined. 04:22:54 -!- immibis has quit ("Hi Im a qit msg virus. Pls rplce ur old qit msg wit tis 1 & hlp me tk ovr th wrld of IRC. It's a dud! It's a dud! It's a du..). 04:29:54 oerjan: Are you aware of any FRC round which removed all fantasy rules? 04:31:46 i don't remember that, but i think there was one with a temporary ordinance to allow repeals 04:32:16 this is very vague though 04:33:31 FRC round 256, former rule 1 (submission 23): Repeal all fantasy rules. This rule repeals itself. 04:33:48 Netted me 0.5 style points. 04:34:56 is this in the last days? 04:35:30 * oerjan hasn't looked at frc for so long he didn't even know if it was still alive 04:35:40 That was a few days ago. 04:35:46 yay! 04:36:11 It recently got a fairly big kick in participation, when the Fantasy Rules Contest of Agora was created, awarding participation in the Commission. 04:36:37 "Committee" 04:36:42 Sorry. 04:36:54 I always think Commission when it's a Committee. 04:37:08 * pikhq is also proud of the second submission of FRC 256. . . 04:37:56 "Each fantasy rule submitted after this one must consist of rules that are known to have been reasonable in other, long-term, online Nomic games. A source for the rule must be given in the submission of the rule." 05:43:27 pikhq: you know you need to then leverage that to work in a spicerack 05:52:31 * pikhq shall stick a Spicerack on the board 05:52:36 (that fantasy rule was repealed) 06:08:02 -!- calamari has quit ("Leaving"). 06:28:16 -!- oerjan has quit ("leaving"). 06:33:11 heh 06:33:30 oklopol was talking about dimmu borgir, and i was making fun of him for it 06:33:39 but then i listened to some and now i really like them :P 07:26:00 mwahahaha :) 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:35:50 -!- eagle-101 has quit (Read error: 110 (Connection timed out)). 09:07:03 -!- EgoBot has joined. 10:58:46 -!- helios24 has joined. 11:04:21 -!- faxathisia has quit ("If there are any aliens, time travellers or espers here, come join me!"). 11:18:15 -!- [o_O] has joined. 11:27:51 -!- danopia has quit (Read error: 101 (Network is unreachable)). 11:38:53 -!- [o_O] has changed nick to danopia. 12:30:06 -!- slereah_ has quit (Read error: 104 (Connection reset by peer)). 12:31:53 -!- slereah_ has joined. 13:14:58 ````s``bb``bs``cc`.0i``s``bs``b`bs``c``bc``b`bc``c``bbbi`.1i``s``bs``b`bs``c``bc``b`bc``c``bbb``sbi`.2i``s``bs``b`bs``c``bc``b`bc``c``bbb``sb``sb``cbi`.3i``s``bs``b`bs``c``bc``b`bc``c``bbb``sb``sb``sbi`.4i``s``bs``b`bs``c``bc``b`bc``c``bbb``sb``sb``sb``sbi`.5i``s``bs``b`bs``c``bc``b`bc``c``bbb``sb``sb``sb``sb``sb``cbi`.6i``s``bs``b`bs``c``bc``b`bc``c``bbb``sb``sb``sb``sb``sb``sbi`.7i``c``bc``b`bc``c``bc``b`bc``c``bbb``sb``s 13:14:58 b``sb``sb``sb``sb``sbi`.8i`.9i``c`t`k0k``c``bc``b`bc``c``bc``b`bb``cb``b`bttki 13:15:08 Finally some Church-to-char! 13:15:12 Maybe now 99! 13:39:36 -!- slereah_ has quit (Remote closed the connection). 13:40:45 -!- MommeMC has joined. 13:42:10 -!- jix has joined. 13:45:18 -!- Corun has joined. 14:10:30 -!- faxathisia has joined. 14:12:57 -!- Slereah has joined. 14:13:13 Hi Slereah 14:14:04 I worked so hard to code that idea I had but it doesn't work -_- 14:16:20 I'll try cooking something up 14:17:47 Hm. The problem would be evaluating the expression before applying it to the delta operator 14:18:03 Otherwise, I'd have to solve the halting problem 14:18:05 ...delta :O 14:18:20 Delta. 14:18:26 that makes we realize.. I did alpha and beta 14:18:32 not eta :S 14:18:34 [delta x] x -> True 14:18:40 [delta x] y -> False 14:19:39 't'was used in "System of logic based on ordinals" by Turing and I thought it might come in handy. 14:20:03 Though Turing's version was 1 and 2 instead of true and false 14:37:27 `^v^w^x^y^z``wz``&xy```w`vz``&`xa`ya`.bi``c``bc``b`bc``c``bc``b`bb``cb``b`bttki 14:37:34 Damn thing won't eliminate correctly 14:37:36 Yarrr 14:37:40 :( 14:37:58 I'm going to try again tommorow 14:38:25 There's x's and y's remaining in the output 14:39:01 I think I misplaced some ` 14:41:23 Well, it parses. But doesn't work even for only one operator 14:41:36 It tries to compare s with `is 14:41:53 my solver worked for really easy problems 14:41:57 And since delta only works to an alpha conversion, no dice 14:42:46 Got to find a way to evaluate everything first. 14:43:18 And that & never has more than one ` before it until it is evaluated 14:43:53 -!- Hiato has joined. 14:44:25 Hello all, I am back (with a vengeance :P ) 14:44:40 But do you also DIE HARD with it? 14:44:54 heh, lol, hopefully not 14:45:40 We're trying to solve the halting problem! 14:45:47 But, you know, only little ones. 14:46:09 -!- Corun has quit ("This computer has gone to sleep"). 14:46:22 The reason that I was away for soooo long was this: I broke and dislocated my fifth finger on my right hand at cricket practise a while ago and thus was unable to type. As a sign that I still existed, I uploaded the ACRONYM spec, which oerjan so kindly fixed. But now, my finger is getting better and the pin should come out in about a month, so I am back :P 14:46:36 Heh, lol, can I help? 14:46:41 oww 14:46:48 indeed 14:47:01 We're trying to devise a program to check if two lambda expressions (or combinators) can convert to each other 14:47:21 * faxathisia wrote loads of code, then ran it to discover.. It didn't work 14:47:22 For some class of expressions at least, since the general problem is undecidable 14:47:42 hrmm.. I must say: I have no idea how Lambda Calculus/Unlambada/Mocking Bird works.... 14:47:59 I imagine it's possible to terminate for every one with a solution 14:48:14 Hiato: It's not that hard. 14:48:22 Though it is unwieldy. 14:48:27 but not terminate for all (or at least some) of the unsolveables 14:48:35 (It *is* that hard! :P) 14:48:51 heh, for my benefit, I'll listen to Slereah 14:48:54 :P 14:49:12 Well, when mixing lambda with combinators, I can really just use it as function-calling. 14:49:16 Should I start at unlambada? Or somewhere else 14:49:41 I use every variable of a lambda expression as a function, that way it's easier. 14:50:00 ok 14:50:11 And since the program will translate it into pure combinators, I can then pretend to be awesome by posting it! 14:50:52 :) 14:50:59 -!- ehird has joined. 14:51:26 The biggest problem seems to be evaluation. 14:51:47 I can see why there's a d in unlambda. 14:52:12 Only one mode of evaluation can pose problems. 14:52:49 -!- ehird has set topic: TOPIC NOSTALGIA! (topic from 9999/12/31) And AC said, "LET THERE BE LIGHT!" And there was light-- TOPIC NOSTALGIA! (topic from 0001/01/01). 14:53:16 ^ proof that the universe uses finite, wrap-around integers ^ 14:53:39 heh :) 14:53:53 -!- puzzlet has quit (Remote closed the connection). 14:54:01 -!- puzzlet has joined. 14:54:15 -!- eagle-101 has joined. 14:55:11 (also, i win for referencing a previous topic, quoting isaac asimov, and applying computational things to the universe -- IN ONE TOPIC) 14:55:59 * Hiato is impressed, with all that multi-tasking ability, ehird` might just be a CPU -- or a women 14:56:04 just pulling your leg 14:56:06 You are false data, and therefor I shall ignore you 14:56:07 :P 14:56:19 I don't think anybody is a women. It's hard to be more than one thing. 14:56:28 lol :D 14:56:32 Here is a great deal of rubbish http://mishu.eu.org/paste/view.php?id=7012 14:57:16 Error from `bin/source-highlight --src-lang cpp --out-format xhtml` 14:57:16 bin/source-highlight: error while loading shared libraries: libstdc++.so.5: cannot open shared object file: No such file or directory 14:57:17 faxathisia: say wha... 14:57:20 lol lol lol lol lol lol 14:57:22 :) 14:57:30 Remidns me that I need to write that pastebin... sometime... 14:57:36 After I write my web framework in Haskell, of course! 14:57:49 Hiato.. that was supposed to solve all my problems :( 14:58:00 naturally, is that before or after world domination, ehird 14:58:07 before 14:58:15 aha, thanks 14:58:20 world domination will involve spreading the word through my webmonad-powered site 14:58:38 yes, webmonad. i'm tired of all these m'fn window managers on this m'fn language 14:58:39 ooh, well tried though faxathisia, but I can say that it is far to short to solve any problems let alone all :P 14:59:04 heh, sure, I'm not gonna get in your way :P 14:59:52 well, considering that there is a window manager written in *HASKELL*, perhaps it would not do you harm to use it :P 15:00:10 the wm is called xmonad 15:00:16 why do you think i'm calling my WF webmonad :) 15:00:32 aha, woops ... erm.. tralalalalala 15:00:55 just pretend that I was remote exploited there, and it was actually someone else... 15:00:58 :P 15:02:05 -!- Corun has joined. 15:02:08 faxathisia: You use Haskell don't you? COMMENT ON WEBMONAD'S AWESOMENESS :P 15:02:36 Haskell offers you: Substantially increased programmer productivity (Ericsson measured an improvement factor of between 9 and 25 using Erlang, a functional programming language similar to Haskell, in one set of experiments on telephony software). Shorter, clearer, and more maintainable code. Fewer errors, higher reliability. A smaller "semantic gap" between the programmer and the language. Shorter lead times. 15:02:36 -!- Slereah has quit (Read error: 104 (Connection reset by peer)). 15:02:36 from http://www.haskell.org/haskellwiki/Introduction 15:02:57 Hiato: yes, that's haskell 15:03:06 I'm far too depressed to be enthusiastic in even the most monadic web framework 15:03:08 Great :) 15:03:15 fact n = product [1..n] -- obligitary factorial example ;) 15:03:18 faxathisia: :( 15:03:20 -!- Slereah has joined. 15:04:03 >:| 15:04:37 Hiato: this produces an *infinite* list of all the fibonacci numbers: 15:04:38 fibs = 0 : 1 : zipWith (+) fibs (tail fibs) 15:05:02 and yes -- this actually terminates. You can do (fibs !! 5) to get the 5th fibonacci number (!! is the list index, like list[i] in other languages) 15:05:06 wicked :), but seeing as it is functional, that doesn't actually matter right 15:05:21 Hiato: you can actually type 'fibs' into the prompt and see all the fibs go by 15:05:27 w00t 15:05:34 the 0 : 1 : stuff is like Lisp lists, [1,2,3] is actually 1:(2:(3:[])) 15:05:39 i.e., a linked list 15:06:09 "zipWith func lst1 lst2" where lst1=[1,2,3] and lst2=[2,3,4] is [3,5,7] 15:06:42 so: since we take the fibonacci numbers as the first argument, and the fibonacci numbers sans the first 15:07:01 ehird: I'm having trouble with GHC (...) ie: when I enter either of the fib = declaration, it moans about "parse error on input" 15:07:03 that gets you the fibonacci numbers, i.e. (fibs !! i) = (fibs !! (i - 1)) + (fibs !! (i - 2)) 15:07:16 Hiato: ghc executes all its input in a "do" statement 15:07:17 cool, that is soo simple 15:07:18 -!- MommeMC has quit (Read error: 113 (No route to host)). 15:07:21 you need: 15:07:23 let fibs = 0 : 1 : zipWith (+) fibs (tail fibs) 15:07:31 just add 'let' to the start. 15:07:37 aha, cool, thanks :) 15:08:10 I'm gonna try it with a foldr and see where I can get to :) 15:08:24 SPOILER: 15:08:28 it'll run forever. :) 15:08:33 true 15:08:42 but I would like to be able to produce that :) 15:08:47 so will (length fibs), aww ;) 15:09:11 haskells laziness takes some getting used to 15:09:19 i.e. 0-argument functions can just be normal variables, because of laziness 15:09:37 -!- slereah_ has joined. 15:09:51 nice :) 15:10:32 Hiato: now you have to go and figure out monads 15:10:33 have fun 15:11:16 sure, I will try, but first I want to crack the foldr conundrum (I am correct in using foldr, right?) 15:11:30 not with fibs, no 15:11:32 use foldl 15:11:37 foldr goes to the right first 15:11:41 ergo: it goes to the END of fibs 15:11:42 oh yeah 15:11:46 that will, uh, never work ;) 15:11:47 I reember 15:11:52 thanks ehird :D 15:11:58 HOWEVER 15:12:01 foldl won't terminate either 15:12:10 on account of having to do the operation over, um, every element. 15:12:30 There's no way to give a 'partly-evaluated' fold. 15:12:30 'map' works though 15:12:30 yeah, I get I :P 15:12:30 -!- Slereah has quit (Success). 15:12:56 Prelude> map (mod 13) (tail fibs) 15:12:56 [0,0,1,1,3,5,0,13,13,13,13,... 15:14:33 let fibs = foldl (+) 0 [0,1,fibs] 15:14:34 ? 15:14:39 I can't actually check :P 15:14:59 why would that work? by the way 15:15:01 the [0,1,fibs] 15:15:06 the fibs doesnt' refer to the fibonaccis you defined before 15:15:10 but THE THING YOU ARE DEFINING ITSELF 15:15:20 so you have: [0,1,foldl (+) 0 [0,1,fold .. 15:15:32 and, ofc, this makes no sense 15:15:41 ahh, but surely you get [0,1,0,1,0,1 etc... when you add you get [0,1,1,2 etc] 15:15:49 yes, I see 15:15:52 you want: 15:15:53 thanks 15:15:54 0 : 1 : fibs 15:16:00 also, foldl doesn't do what you think it does 15:16:09 really? 15:16:13 think of fold* as something replacing the cons operation 15:16:16 if you have [1,2,3] 15:16:17 you have: 15:16:21 1 : 2 : 3 : [] 15:16:24 oh, I see 15:16:27 so you need a map 15:16:28 foldl replaces [] with its second argument 15:16:31 and the cons with its first 15:16:32 so you get 15:16:34 1 + 2 + 3 + 0 15:16:36 -> 4 15:16:40 -!- ais523 has joined. 15:16:45 foldr is the same but it's the other associative 15:16:48 hey ais523 15:16:54 yes, so you need a map, so map foldl etc 15:16:54 hello 15:16:57 hello 15:19:54 let fib = [0,1] 15:19:55 map (foldl (+) 0 fib) (tail fib) 15:20:08 in a pseudo-code kind of way? 15:20:28 * faxathisia prefers, map fst $ iterate () $ (0,1) 15:20:29 :1:5: 15:20:30 Couldn't match expected type `a -> b' 15:20:30 against inferred type `Integer' 15:20:30 In the first argument of `map', namely `(foldl (+) 0 fib)' 15:20:30 In the expression: map (foldl (+) 0 fib) (tail fib) 15:20:30 In the definition of `it': it = map (foldl (+) 0 fib) (tail fib) 15:20:40 (5:20:48 PM) Hiato: in a pseudo-code kind of way? :P 15:20:41 * faxathisia prefers, map fst $ iterate (\(x,y)->(y,x+y)) $ (0,1) 15:20:45 faxathisia: 0 : 1 : zipWith (+) fibs (tail fibs) 15:21:01 ehird: but concept wise, is that correct? 15:21:02 Hiato: Well, obviously not. The first argument to map needs to be a function 15:21:10 ehird, Yes? 15:21:14 oh, I see 15:21:16 -!- puzzlet has quit (Remote closed the connection). 15:21:18 Hiato: I think your terminology is a bit wrong 15:21:24 -!- puzzlet has joined. 15:21:25 probably 15:21:32 Hiato: Maybe reading a tutorial (or GHC's Prelude docs) would help a bit :) 15:21:39 map fst $ iterate (\(x,y)->(y,x+y)) $ (0,1) -- also fibs 15:21:53 but for each in fib do fib[current+1]=foldl (+) 0 fib 15:21:58 yes, agrred 15:22:00 *agreed 15:22:23 I will be the first to admit, I know nearly nothing about Haskell 15:23:13 Actually, Slereah might have said that first :P 15:23:23 lol :) 15:23:25 (In regards to scheme) 15:25:24 Hiato: You can't code that in haskell. Laziness would trip you up 15:25:43 fibs always means 'the WHOLE list' 15:25:55 yes, understood :) 15:26:56 I'll dig around and see what I can do :) Thanks ehird, you have been a big help (believe it or not :P ) 15:27:32 :P 15:27:34 np 15:27:41 -!- ehird has quit ("Leaving"). 15:28:24 -!- ehird has joined. 15:29:45 faxathisia: I'm cooking up something. 15:30:21 It's a program that will simply generate all possible combinations of combinators and pass them through LB 15:30:41 And then try to see if they correspond to the original expression. 15:30:50 wicked 15:31:09 but slereah: won't that get very big very quickly (Factorial possibilities) 15:31:31 * Hiato knows slereah wasn't talking to me for a reason... :P but felt he had to say something 15:31:59 BRUTE FORCE BITCH 15:32:26 Also, since it was for faxathisia's riddle-solving for "To mock a mockingbird", the answer can't be that big. 15:32:26 heh, I guess I should just then Brute Force my Rijandael encrpyted notes then :P 15:33:22 I tried that method 15:33:29 What was the problem? 15:33:41 used the wrong equality check on lambda terms though 15:34:27 What you used? 15:35:10 I was checking terms in STLC intead of untyped for some reason :S 15:35:34 I just coded it between class to pass time 15:51:17 faxathisia! 15:51:17 I think I got something! 15:51:40 cool 15:52:32 http://membres.lycos.fr/bewulf/Russell/Lazy%20Bird/Compare 15:53:32 Also work with the b and {q,t}! 15:54:40 how did you do that so fast @_@ 15:54:57 that's awesome 15:55:37 Although I should hide the inner workings. 15:55:59 Give me an expression to compose from soemthing else to check 15:56:49 (The program is just take the datas, generate all strings, try them in lazy bird with dummy variables) 15:57:10 As such, it can only check combinators that works on all combinators. 15:57:18 s, k, b, m and so on are okay. 15:57:36 Pred won't work, 'cause it doesn't simply rearrange them 15:59:32 ok, ehird: this might be right, but I have no way of telling, what do you think? 15:59:33 let fib = [1,0] 15:59:33 let fib = (foldl (+) 0 fib) : fib 15:59:35 -!- oerjan has joined. 15:59:40 slereah@Vixem:~/Esolang$ python Generate.py 15:59:40 Expression to compare :t 15:59:40 Number of argument :2 15:59:40 Set of combinators to compose from (separated by ,) :c,i 15:59:40 `ci converts to t 15:59:43 Yay 15:59:46 Hiato: let fib = (foldl (+) 0 fib) : fib -- nonsensical self reference 16:00:10 Hiato: You CANNOT resassign a variable in Haskell. They are constant. Referring to a variable in a later binding of it completely forgets about that old one. You have no access to [1,0] from your previous fib. 16:00:19 There is no state in Haskell. 16:00:49 well, running it once functions, sort of: 16:00:49