Search results

Jump to navigation Jump to search

Page title matches

Page text matches

  • parent s = father s `mplus` mother s grandparent s = paternalGrandfather s `mplus`
    561 bytes (71 words) - 08:43, 9 April 2021
  • parent s = (maybeToList (mother s)) ++ (maybeToList (father s)) grandparent s = (maybeToList (paternalGrandfather s)) ++
    631 bytes (63 words) - 08:44, 9 April 2021
  • newtype SuperState s t a = SuperState { runSuperState :: (s -> t -> (t,[(a,s)])) } instance Monad (SuperState s t) where
    1 KB (169 words) - 05:31, 9 March 2021
  • newtype State s a = State { runState :: s -> (a, s) } * <hask>s -></hask>
    380 bytes (24 words) - 12:26, 6 December 2023
  • parent s = (toMonad (father s)) `mplus` (toMonad (mother s)) grandparent s = (toMonad (parentalGrandfather s)) `mplus`
    1 KB (151 words) - 08:45, 9 April 2021
  • maternalGrandfather s = return s >>= \ms ->
    1 KB (147 words) - 08:41, 9 April 2021
  • newtype SupplyT s m a = SupplyT (StateT [s] m a) newtype Supply s a = Supply (SupplyT s Identity a)
    1 KB (202 words) - 05:09, 4 April 2014
  • maternalGrandfather s = return s >>= \ms ->
    4 KB (454 words) - 02:33, 7 January 2022
  • xor s t = if null s then t else s loop n s = cycle $ replicate (n-1) [] ++ [s]
    980 bytes (157 words) - 15:19, 6 February 2021
  • [s] <- getArgs putStrLn $ formatCalendarTime defaultTimeLocale s time
    543 bytes (78 words) - 15:19, 6 February 2021
  • ...e writings on the relevance of algorithmic information theory, and Chaitin's thoughts of its relatedness to epistemology, biology. [[Chaitin's construction]].
    440 bytes (57 words) - 06:23, 4 February 2016
  • It's very simple to use, and provides a highly efficient, pure interface * JeremyShaw's update of HalDaume's NewBinary package (Cabalized): http://www.n-heptane.com/nhlab/repos/NewBina
    2 KB (254 words) - 19:03, 23 October 2013
  • s/^> // s/\(\n\)> /\1/g
    600 bytes (99 words) - 10:10, 7 November 2013
  • ...e the prelude function for computing gcd's along with a test of the result's equality to one.
    329 bytes (49 words) - 19:43, 18 January 2014
  • .../github.com/bergey/diagrams-stow/blob/master/release/UpperBounds.hs Daniel's]) This page has ideas & requirements for building a less ad-hoc tool, whic Either Brent's tool or Daniel's (or both) performs each of the tasks listed above. In some cases the code
    2 KB (241 words) - 16:19, 22 June 2015
  • ...n if it is (mostly) backward-compatible, and otherwise in the "alternative(s)" column. !Module(s)
    5 KB (633 words) - 15:16, 6 February 2021
  • Page about the implementation of Oleg's Iteratee maintained by John Lato. * [http://okmij.org/ftp/Haskell/Iteratee Oleg's Original Implementation]
    2 KB (228 words) - 15:18, 6 February 2021
  • ...e hackathon on Friday and Saturday, and possibly Sunday afternoon if there's interest. To get sound you'll need VSTs, a VST host, and jack if it's linux. It's
    886 bytes (153 words) - 22:47, 5 April 2017
  • ! Author(s) ! Maintainer(s)
    4 KB (491 words) - 10:14, 3 August 2015
  • * <hask>unsafeInterleaveST :: ST s a -> ST s a</hask> * <hask>unsafeIOToST :: IO a -> ST s a</hask>
    1 KB (206 words) - 12:27, 8 June 2023

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