Search results

Jump to navigation Jump to search

  • Shootout/Fannkuch
    ...rep1&type=pdf Performing Lisp Analysis of the FANNKUCH Benchmark], Kenneth R. Anderson and Duane Rettig (27KB PDF) (# s, r# #) -> case setcount c# r# s of
    22 KB (3,539 words) - 00:49, 14 December 2016
  • BayHac2017/brainstorm
    * /r/haskell
    1 KB (165 words) - 01:05, 12 January 2017
  • Euler problems/61 to 70
    cont r n d = m : rest m = (truncate (sqrt (fromIntegral r)) + n) `div` d
    6 KB (979 words) - 10:20, 18 May 2022
  • New monads/MonadExit
    instance MonadExit e (ReaderT r (Exit e)) where instance Monad m => MonadExit e (ReaderT r (ExitT e m)) where
    4 KB (707 words) - 09:43, 9 December 2014
  • Concurrency demos/Haskell-Javascript concurrency
    showresp r doc body = case r of
    4 KB (517 words) - 04:59, 26 April 2021
  • Type SK
    > type R = Other R0 > testS = eval (bot :: S P Q R) :: App (App P R) (App Q R)
    10 KB (1,653 words) - 00:25, 12 July 2021
  • 99 questions/Solutions/39
    snap v origin step = if r==0 then v else v+(step-r) where r = rem (v-origin) step -- NB: origin <= v ; else use MOD
    5 KB (696 words) - 19:46, 18 January 2014
  • 99 questions/80 to 89
    arc(u,r). digraph([r,s,t,u,v],[a(s,r),a(s,u),a(u,r),a(u,s),a(v,u)])
    11 KB (1,679 words) - 06:20, 11 June 2023
  • New monads/MonadRandom
    instance (MonadRandom m) => MonadRandom (ReaderT r m) where instance (MonadReader r m, RandomGen g) => MonadReader r (RandT g m) where
    6 KB (894 words) - 13:41, 2 April 2019
  • Plainly partible
    runUO g = let !(# _, r #) = runRW# (useUO# (g . UO)) in r !r = g h
    11 KB (1,656 words) - 22:33, 4 July 2022
  • Dmenu-4.0-xft.diff
    diff -r cdaa1062e534 config.h diff -r cdaa1062e534 config.mk
    7 KB (986 words) - 15:19, 6 February 2021
  • Benchmarks Game/Parallel/BinaryTrees
    check (Node i l r) = i + check l - check r check (Node i l r) = i + check l - check r
    6 KB (1,055 words) - 23:27, 18 April 2020
  • Xmonad/Config archive/adamvo's xmobarrc
    , Run Com "uname" ["-s","-r"] "" 36000
    2 KB (189 words) - 01:17, 9 April 2021
  • 99 questions/Solutions/93
    showsEquation (l, r) = showsExprPrec 0 l . showString " = " . showsExprPrec 0 r
    5 KB (621 words) - 15:30, 8 June 2017
  • 99 questions/11 to 20
    ?- remove_at(X,[a,b,c,d],2,R). R = [a,c,d]
    5 KB (839 words) - 04:58, 10 June 2023
  • Concurrency demos/Zeta
    putStr $ unlines [ "Starting thread for range " ++ show r | r <- ranges ]
    4 KB (555 words) - 10:58, 22 June 2021
  • Xmonad/Config archive/Gwern's xmonad.hs
    ...xK_i), raiseMaybe (runInTerm "-title Irssi" "sh -c 'screen -A -r irssi'") (title ~? "Irssi")) ...xK_r), raiseMaybe (runInTerm "-title rtorrent" "sh -c 'screen -A -r rtorrent'") (title =? "rtorrent"))
    6 KB (615 words) - 23:47, 28 November 2018
  • Anagrams
    minus (lft@(CharCount c1 i1):xs) r@((CharCount c2 i2):ys) | (c1 < c2) = do rem <- xs `minus` r
    2 KB (256 words) - 15:19, 6 February 2021
  • Parsing a simple imperative language
    > Right r -> r > Right r -> return r
    11 KB (1,437 words) - 00:04, 1 September 2017
  • Free structure
    *** A set <math>R</math> *** A unary operation <math>- : R \to R</math>
    13 KB (2,245 words) - 15:18, 6 February 2021

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://wiki.haskell.org/Special:Search"