Search results

• FRP explanation using reactive-banana
  If you're wondering why I'm not using Haskell syntax, it's to focus on the meaning of boxes rather than ...that event. So if an event comes in with value 2 the value of bSet becomes 2.
  25 KB (4,168 words) - 15:10, 24 October 2017
• Glome tutorial
  ....hs file and recompiling). NFF doesn't define a specific intensity, and I'm not sure what sort of falloff (if any) Eric Haines used when he rendered th type T = Texture Tag M
  40 KB (6,787 words) - 01:19, 8 April 2014
• Untypechecking
  into GHCi -- tested on GHCi 6.2.1 or GHCi snapshot 6.3.20041106. It the regions. The monadic regions are described in the paper by M. Fluet
  20 KB (3,458 words) - 15:19, 6 February 2021
• If-then-else
  ...ould be simply replaced by a function. Maybe there is some subtlety that I'm not able to see right now." There is no longer confusion with the interfere There should be one tool, that converts Haskell 98 and Haskell' to Haskell-2.
  6 KB (937 words) - 05:34, 10 December 2020
• Xmonad/Config archive/John Goerzen's Configuration
  I'm going to take you step-by-step through the process of configuring Xmonad, s And here is a screenshot that points out what I'm talking about when I talk about the status bar and the tray:
  20 KB (3,066 words) - 13:01, 24 May 2020
• Xmonad/Config archive/Nnoell's xmonad.hs
  import qualified Data.Map as M { leftClickCA = "/usr/bin/xdotool key super+m"
  45 KB (4,625 words) - 00:21, 27 October 2013
• OOP vs type classes
  main = do print (coord (FloatPoint 1 2)) print (coord (IntPoint 1 2))
  30 KB (4,685 words) - 01:34, 14 July 2021
• Tying the Knot
  two = FaState 2 True [two,one] [one,two] CCardFA> [{@{State 1 True [1,2] []}{State 2 True [2,1] [1,2]}@}]
  24 KB (3,850 words) - 17:16, 28 June 2021
• GHC/Type families
  lookup k (GMapInt m) = Data.IntMap.lookup k m insert k v (GMapInt m) = GMapInt (Data.IntMap.insert k v m)
  42 KB (6,828 words) - 17:15, 4 February 2023
• Future of Haskell
  further details. Implemented in GHC, proposed for Haskell 2. ...by Mark Jones supporting a language based on the Haskell report version 1.2.
  11 KB (1,692 words) - 16:37, 28 January 2023
• Research papers/Type systems
  :Sean Seefried, Manuel M. T. Chakravarty, and Gabriele Keller. In Gabor Karsai and Eelco Visser, edi :Patricia Johann and Janis Voigtländer, Fundamenta Informaticae, vol. 69(1-2), pp. 63-102, 2006.
  26 KB (3,569 words) - 10:04, 1 September 2022
• GHC/As a library (up to 6.8)
  -- equivalent to GHCi's :m Prelude Control.Monad *Main runStmt session "let n = 2 + 2" -- n is bound
  18 KB (2,724 words) - 11:05, 17 January 2014
• Ministg
  ...ve any questions, feedback feature requests, or bug reports for Ministg. I'm particularly keen to hear from anyone who has tried to use it, and would li two = CON(I 2);
  15 KB (2,396 words) - 07:19, 10 August 2022
• Sudoku
  newtype NondetT m a = NondetT { foldNondetT :: (forall b. (a -> m b -> m b) -> m b -> m b) }
  67 KB (9,593 words) - 05:40, 9 March 2021
• FAQ
  == I'm making an RPG. Should I define a type for each kind of monster, and a type ...3-135009 language standard] only guarantees a range of -2²⁹ to (2²⁹ - 1). Most implementations will provide a full machine-size si
  36 KB (5,814 words) - 22:06, 10 May 2024
• Tutorials/Programming Haskell/Introduction
  code, written well. (And I'm grateful to Larry Wall, Tom Christiansen moles = 2.5
  13 KB (1,817 words) - 17:53, 20 October 2016
• HStringTemplate
  Prelude> :m + Text.StringTemplate 1, 2, 3, 4
  12 KB (1,726 words) - 15:16, 6 February 2021
• HaskellImplementorsWorkshop/2015
  | '''10:30-12:00''' || '''Session 2''' * Talk 2: GHC Performance Dashboard (Joachim Breitner) ([https://youtu.be/0nWT390n88
  15 KB (2,190 words) - 21:19, 17 February 2016
• Haskell logos/New logo ideas
  ...a new version of it in Inkscape and made it aqua-like for the shiny-glossy-2.0 web world.</p> (1) Haskell is considered powerful but feared. (2) Reversed Biblical logic: condemned to purity to be saved by monads, which
  34 KB (5,126 words) - 19:19, 15 August 2019
• Monad tutorials timeline
  ...'' is a triple (''M'', ''unit'', ''★'') consisting of a type constructor ''M'' and two operations of the given polymorphic types." *: "So now I can reveal what a monad is. The triple of objects (m,unit,bind) is the monad, and to be a monad they must satisfy a bunch of law
  35 KB (5,030 words) - 08:53, 12 June 2024

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