Search results

Jump to navigation Jump to search

  • Meet Bob The Monadic Lover
    Lover {loverDiary = ("Luisa ",2)} I'm sure you know what method Bob likes most.
    28 KB (4,668 words) - 15:16, 6 February 2021
  • Type SK
    The program developed in this message was tested on GHC 6.4.2. combinator. There are rules for reducing under both 2 and 3 'App's.
    10 KB (1,653 words) - 00:25, 12 July 2021
  • Aprende Haskell en 10 minutos
    necesario). Los lenguajes populares más parecidos son la familia ML (que no son, El compilador de Haskell más común es [[GHC]]. Puede descargarlo de
    14 KB (2,164 words) - 16:35, 9 October 2016
  • Template haskell/Instance deriving example
    And some borrowed helper code taken from Syb III / replib 0.2 typeInfo m =
    6 KB (836 words) - 19:46, 28 December 2013
  • Catamorphisms
    ...e category theoretic machinery behind these was resolved by Grant Malcolm [2][3], and they were popularized by Meijer, Fokkinga and Paterson[4][5]. The phi (S m) = s m
    9 KB (1,367 words) - 09:34, 17 November 2022
  • Web/Libraries/Formlets
    enumRadio :: (Monad m, Enum a) => [(a, String)] -> Maybe a -> Form a validDate (Date m d) = m `elem` [1..12] && d `elem` [1..31]
    8 KB (985 words) - 06:56, 16 September 2013
  • Xmonad/Using xmonad in Gnome
    <pre># gconftool-2 -s /desktop/gnome/session/required_components/windowmanager xmonad --type s ...screen. Note that if you go this road with Ubuntu 10.04 (tested with gnome 2.30.0), you will also need to unset the gconf windowmanager setting.
    28 KB (4,089 words) - 18:22, 5 February 2016
  • AI/Genetic programming/Evolutionary chess
    So, for about 2 years or so, I've been batting around the idea of what it would look like t What I'm thinking is, suppose I have this function:
    5 KB (819 words) - 01:04, 9 April 2021
  • Stiri Ro/Haskell-2007
    8 iunie 2007 S-a primit de la domnul conf M. Gontineac stirea despre continuarea unor cercetari de algebra superioara c ...rtii in catalogul online al Bibliotecii este planificata in jurul datei de 2-3 iunie 2007. Donatia de facto s-a facut pe 26 mai 2007.
    3 KB (399 words) - 14:50, 18 February 2015
  • Regular expressions for XML Schema
    The [http://www.w3.org/TR/xmlschema11-2/#regexs W3C XML Schema] specification defines a language for regular expres Given 2 words ''w1'' and ''w2'' matching the regular expressions
    22 KB (3,425 words) - 22:34, 29 June 2021
  • GHC/GHCi
    :set +m -v0 let main_module = head' [ m' | (m:m') <- ms, m == '*' ]
    21 KB (3,021 words) - 12:03, 15 May 2020
  • CPlusPlus from Haskell
    Currently, I'm using Ghc to do the linking, and instruct it to link the c++ runtime librar This seems to work (with GHC 6.4.1 and G++ 3.3.5). However, I'm pretty
    15 KB (2,199 words) - 00:32, 23 May 2017
  • Library/CC-delcont
    m >>= f >>= g >>= h ...of <hask>m</hask> is, the portion of the program that executes after <hask>m</hask>, and it looks something like:
    25 KB (4,039 words) - 16:39, 12 March 2024
  • Google summer of code
    My project was refactoring programs with hlint suggestions. I'm Johan Tibell writes: I'm very happy with Adam's work strict Haskell. StrictData is already in HEAD a
    8 KB (1,152 words) - 13:09, 24 March 2018
  • HaskellImplementorsWorkshop/2012
    11:00-12:30: Session 2 * '''[[HaskellImplementorsWorkshop/2012/deVries|Cloud Haskell 2.0]]''' (Duncan Coutts and Edsko de Vries) [http://www.haskell.org/wikiuploa
    6 KB (790 words) - 03:05, 25 July 2021
  • Quasiquotation
    ...1..3] |]</hask> by turning them into <hask>"(a) = 1 (map (+a) [1..3]) = [2,3,4]"</hask> to ease debugging and development. parseExpr :: Monad m => (String, Int, Int) -> String -> m Expr
    12 KB (1,695 words) - 15:27, 12 November 2019
  • Xmonad/Config archive/yiannist's xmonad.hs
    floatHook = composeAll [ appName =? "gimp-2.8" --> doFloat , Run CpuFreq ["-t","Freq: <cpu0>/<cpu1> GHz","-L","0","-H","2"
    6 KB (566 words) - 20:23, 21 June 2015
  • Prime numbers
    ...that has no divisors other than itself (and 1). The smallest prime is thus 2. Non-prime numbers are known as ''composite'', i.e. those representable as ...(&forall; ''m'' &isin; '''N'''<sub>2</sub>) (&#8202;(''m'' | ''n'') &rArr; m = n)&#8202;}
    58 KB (8,594 words) - 20:34, 6 May 2023
  • Research papers/Domain specific languages
    ...ott, Sigbjorn Finne, Oege de Moor. Journal of Functional Programming, 13(2), 2003. :M Wallace, C Runciman - ACM SIGPLAN Notices, 1999
    9 KB (1,309 words) - 07:48, 18 September 2014
  • CTRex
    ...ap, we can never be sure if a key is present in a map, i.e. <hask>lookup x m</hask> may return <hask>Maybe</hask>. p :<-| z .| y :<- 'b' .| z :!= False .| x := 2 .| y := 'a' .| empty
    25 KB (4,073 words) - 08:53, 9 December 2013

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

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