Search results

CouchDB
justDoc (Just (d,r,x)) = stripResult (fromJSON x) justDoc (Just (d,r,x)) = stripResult (fromJSON x)

12 KB (1,556 words) - 15:19, 6 February 2021
GHC.Generics
-- Another argument, tagged with R because it is :*: M1 S NoSelector (K1 R (UserTree a))

16 KB (2,615 words) - 20:24, 19 October 2020
The Monad.Reader/Issue2/FunWithLinearImplicitParameters
...epository.readscheme.org/ftp/papers/sw2004/shan.pdf</ref>; moreover, <ref> R. Kent Dybvig, Simon Peyton-Jones, and Amr Sabry. "A Monadic Framework for -- i.e the "rest" of the computation, to a final result of type r.

35 KB (5,673 words) - 20:05, 7 July 2015
99 questions/Solutions/50
serialize (Branch l r) = [(x, '1':code) | (x, code) <- serialize r]

5 KB (738 words) - 19:53, 18 January 2014
Xmonad/Config archive/nomeata’s xmonad.hs
-- mod-{w,e,r}, Switch to physical/Xinerama screens 1, 2, or 3 -- mod-shift-{w,e,r}, Move client to screen 1, 2, or 3

7 KB (748 words) - 15:19, 6 February 2021
Memoization
naturals r n = ((naturals $! r2) $! (n+r))

12 KB (1,702 words) - 16:05, 28 April 2014
99 questions/31 to 41
...ient function phi(m) is defined as the number of positive integers r (1 <= r < m) that are coprime to m. Example: m = 10: r = 1,3,7,9; thus phi(m) = 4. Note the special case: phi(1) = 1.

6 KB (805 words) - 02:30, 11 June 2023
Blow your mind
splitAts = foldr (\n r -> splitAt n >>> second r >>> uncurry (:)) return -- "abracadabra" -> fromList [('a',5),('b',2),('c',1),('d',1),('r',2)]

12 KB (1,704 words) - 17:53, 22 November 2019
Rubiks Cube
data Was = R|L|U|D|F|B data Is = R|L|U|D|F|B

8 KB (1,020 words) - 01:02, 23 September 2018
User talk:WillNess
let r = fromIntegral (lwi - si) `mod` bp in if r == 0 then 0 else fromIntegral $ bp - r

7 KB (1,171 words) - 11:56, 21 February 2023
Nonogram
| otherwise = do r <- rs let b' = if c `elem` r then i:b else b]

17 KB (2,482 words) - 20:34, 8 June 2017
Roll your own IRC bot
"NOTICE AUTH :*** Looking up your hostname...\r\nNOTICE AUTH :*** Checking ident\r\nNOTICE AUTH :*** Found your hostname\r\n ...

21 KB (3,285 words) - 19:34, 11 April 2024
RuHaskell
* Subreddit [https://www.reddit.com/r/ruhaskell /r/ruhaskell]

3 KB (397 words) - 10:26, 1 May 2017
Intrebari despre combinatorii de parsere
R:

2 KB (297 words) - 10:37, 9 October 2019
Research papers/Parallelism and concurrency
...Scaife N. Hammond K. Horiguchi S. Klusik U. Loogen R. Michaelson G.J. Pena R. Priebe S. Trinder P.W. Higher-order and Symbolic Computation 16(3) (2003) :Trinder P.W. Loidl H-W. Pointon R.F. Journal of Functional Programming 12(4&5) (2002), pp 469-510.

9 KB (1,362 words) - 08:01, 7 June 2024
Haskell programming tips
tuples r l | r == 1 = [[el] | el <- l]

29 KB (4,702 words) - 12:36, 4 May 2021
User groups
* [https://www.reddit.com/r/haskell/ /r/haskell] * [https://www.reddit.com/r/haskellgamedev /r/haskellgamedev]

14 KB (2,012 words) - 03:41, 21 June 2024
Recursive function theory
:<math>\underline\mathbf R^m : \left\lfloor m\right\rfloor \times \left\lfloor m+2\right\rfloor \to \l :<math>\underline\mathbf R^m f h = g\;\mathrm{where}</math>

13 KB (2,068 words) - 23:19, 3 June 2019
99 questions/61 to 69
Given a binary tree as the usual Prolog term t(X,L,R) (or nil). As a preparation for drawing the tree, a layout algorithm is req ...this string representation, if the tree is given as usual (as nil or t(X,L,R) term). Then write a predicate which does this inverse; i.e. given the stri

12 KB (1,696 words) - 05:35, 11 June 2023
Xmonad/Config archive/Template xmonad.hs (0.8)
-- mod-{w,e,r}, Switch to physical/Xinerama screens 1, 2, or 3 -- mod-shift-{w,e,r}, Move client to screen 1, 2, or 3

9 KB (1,218 words) - 15:17, 6 February 2021

Search results

Navigation menu

Search