## #haskell - Mon 19 Feb 2007 between 02:34 and 02:41

### NY Lost Funds

 lambdabot Control.Parallel.Strategies.Assoc :: data Assoc a bText.ParserCombinators.Parsec.Expr.Assoc :: data AssocArray.assocs :: Ix a => Array a b -> [(a, b)] nornagon @hoogle Graph lambdabot Data.Graph :: moduleData.Graph.Inductive.Graph :: moduleData.Graph.Graph :: type Graph encryptio @where obsfucated lambdabot I know nothing about obsfucated. encryptio where can i find some obsfucated haskell code? kc5tja Here's some: :) (.) . (:):) bd_ @unpl (.).(:) lambdabot (\ f b c -> ((:)) f (b c)) bd_ encryptio: lambdabot will be happy to generate some for you. Just run virtually anything through @pl :) encryptio lol bd_ @pl uncurry (/) . foldr (\x -> (+x) *** (+1)) (0,0) \$ [1..1000000] lambdabot uncurry (/) (foldr ((*** (1 +)) . (+)) (0, 0) [1..1000000]) Cheery @pl (+ 2 3) lambdabot (2 3 +) bd_ hmm, too easy Cheery > (2 3 +) lambdabot add an instance declaration for (Num (t -> a)) bd_ @pl let (sum, ct) = foldl' (\(sum, ct) n -> let s' = sum + n; ct' = succ ct in s' `seq` ct' `seq` (s', ct')) (0,0) [1..50000] in sum/ct Cheery @pl (2 + 3) lambdabot (line 1, column 5):unexpected "("expecting natural, identifier or "in"5 bd_ @pl let x = foldl' (\(sum, ct) n -> let s' = sum + n; ct' = succ ct in s' `seq` ct' `seq` (s', ct')) (0,0) [1..50000] in (fst x / snd x) lambdabot uncurry (/) (foldl' (uncurry (flip ((.) . flip (ap (ap . (seq .) . seq) (,)) . fix . const . succ) . (+))) (0, 0) [1..50000]) bd_ there :) Cheery @pl \x -> x lambdabot id encryptio eesh. Cheery hm.bd_: it does not work for anything. :> bd_ Cheery: Use some variables, tsk >.>I said virtually anything :P bos any cabal people around?