Search results

• Regular expressions for XML Schema
  ...gular expressions where not applicable for this task, e.g. they used other r.e. grammars or ...ng ''w'' is a word of a given regular set (given by a regular expression ''r'')
  22 KB (3,425 words) - 22:34, 29 June 2021
• Untypechecking
  > instance AddHyp (Gamma ((T2T t) :*: hs)) r gamma > => AddHyp (Gamma hs) (t :*: r) gamma where
  20 KB (3,458 words) - 15:19, 6 February 2021
• The Fibonacci sequence
  nfibs n = let r = replicate (n-1) 0 ++ 1 : 1 : zipWith ((-).(2*)) (drop n r) r in r
  8 KB (1,150 words) - 15:41, 5 July 2022
• Programming performance
  | [[Programming performance/KrassiVanguelov R]] | R
  4 KB (638 words) - 23:08, 5 April 2021
• Euler problems/181 to 190
  -- r and a natural number k, the decimal expansion of r^k terminates if -- and only if the decimal expansion of r does.
  15 KB (2,018 words) - 01:29, 26 April 2021
• Abbot
  # <tt>chmod -R go-rwx /home/newuser</tt>
  2 KB (246 words) - 08:59, 9 June 2023
• 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
• 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

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