Search results

• The Monad.Reader/Discuss Issue11/FingerTreeIMap
  data Key k v = NoKey | Key k v instance Eq k => Eq (Key k v) where
  2 KB (315 words) - 15:19, 6 February 2021
• 99 questions/Solutions/88
  depthfirst (v,e) n | [x|x<-v,x==n] == [] = []
  1 KB (123 words) - 03:51, 10 January 2017
• 99 questions/Solutions/89
  dfsbipartite (v,e) ((nv, 0):stack) odd even | [x|x<-v,x==nv] == [] = dfsbipartite (v, e) stack odd even
  1 KB (163 words) - 03:51, 10 January 2017
• 99 questions/Solutions/87
  depthfirst (v,e) n | [x|x<-v,x==n] == [] = []
  714 bytes (91 words) - 03:50, 10 January 2017
• Recursion in a monad
  f n = do v <- getLine return $! v : vs
  986 bytes (142 words) - 15:18, 6 February 2021
• 99 questions/Solutions/80
  adjToGraph (Adj ((v, a):vs)) = Graph (v : xs) ((a >>= f) ++ ys) f x = if (v, x) `elem` ys || (x, v) `elem` ys
  2 KB (245 words) - 03:48, 10 January 2017
• Multi-parameter type class
  class Monad m => VarMonad m v where new :: a -> m (v a)
  1 KB (198 words) - 22:52, 21 July 2021
• 99 questions/Solutions/94
  adjToGraph (Adj ((v, a):vs)) = Graph (v : xs) ((a >>= f) ++ ys) f x = if (v, x) `elem` ys || (x, v) `elem` ys
  2 KB (388 words) - 03:47, 10 January 2017
• Ru/GHC/Class Instance Extensions
  class Map m k v where empty :: m k v
  3 KB (170 words) - 23:05, 29 June 2021
• 99 questions/Solutions/64
  In this layout strategy, the position of a node v is obtained by the following two rules: * x(v) is equal to the position of the node v in the inorder sequence
  2 KB (337 words) - 03:41, 10 January 2017
• 99 questions/Solutions/92
  koch ((v, us):vs) eused vused vplan = koch vs eused' (vn:vused) ((v, vn):vplan)
  3 KB (420 words) - 22:52, 7 June 2017
• Unamb
  ...<hask>unamb u v</hask> is the more terminating of <hask>u</hask> and <hask>v</hask>. ...u v</hask> becomes available when the earlier of <hask>u</hask> and <hask>v</hask> does.
  2 KB (356 words) - 21:36, 4 February 2014
• A new list type
  foldr _ v (End) = v foldr f v (Node _ x xs) = f x (foldr f v xs)
  3 KB (587 words) - 15:19, 6 February 2021
• Stateful nondeterminism
  ...in foldl (\(newt,sofar) (v,s) -> let (t'',lst) = runSuperState (f v) s newt
  1 KB (169 words) - 05:31, 9 March 2021
• Diagrams/Dev/Fixpoint
  <code>Transform</code>, <code>V</code>. type Context b v m = Style v ::: Name ::: SubMap b v m ::: ()
  7 KB (1,077 words) - 14:56, 12 June 2014
• 99 questions/Solutions/62B
  atLevel (Branch v l r) n | n == 1 = [v]
  741 bytes (125 words) - 13:40, 25 December 2016
• Diagrams/FAQ
  === Couldn't match type `V (Point R2)' with `R2' === ...[http://projects.haskell.org/diagrams/doc/manual.html#couldn-t-match-type-v-p2-with-r2 the user manual].
  958 bytes (158 words) - 03:41, 29 January 2014
• Action
  search marks (v:vs) = readSTArray marks v >>= \ visited -> writeSTArray marks v True >>
  3 KB (428 words) - 04:08, 12 April 2024
• LensBeginnersCheatsheet
  |<code>at :: Ord k => k -> Lens' (Map k v) (Maybe v)</code> |rowspan="3" valign="top" |<code>Just v</code> -> value is present; <code>Nothing</code> -> value is absent
  5 KB (742 words) - 19:22, 22 May 2022
• IO入門編
  ...ションは普通に実行され、<code>v <- x</code>となっている行ではアクション<code>x</code>を実行し、結果を変数<code>v</code>に割り当てます。
  7 KB (299 words) - 11:39, 22 October 2022
• Denotative
  search marks (v:vs) = readSTArray marks v >>= \ visited -> writeSTArray marks v True >>
  4 KB (488 words) - 04:24, 5 April 2024
• Yhc/Javascript/Programmers guide/EchoCPS2 demo source
  romdec v = let rom = (catchJS ((show . fromRoman) v) (\_ -> ""))
  4 KB (559 words) - 15:17, 6 February 2021
• Monomorphism by annotation of type variables
  let v = unsafeLocalState $ newIORef undefined in do writeIORef v ("0" :: [Char])
  3 KB (459 words) - 08:33, 18 August 2021
• 99 questions/Solutions/84
  adjacent g v = map fst (g!v) prim' t r mst = let e@(c,u',v') = minimum
  1 KB (189 words) - 03:50, 10 January 2017
• Euler problems/61 to 70
  where gather [xs] (v:vs) = let v' = match xs v
  6 KB (979 words) - 10:20, 18 May 2022
• Diagrams/Dev/Transformations
  ...formation'' on a vector space <math>V</math> is a function <math>f : V \to V</math> satisfying * <math>f(kv) = k f(v)</math>
  14 KB (2,245 words) - 03:01, 11 April 2015
• Cont computations as question-answering boxes
  .../code> this question: ''if <code>f</code> were applied to your value <code>v</code> (of type <code>t</code>) how would the resulting box respond to the x >>= f = Cont (\q -> runCont x (\v -> runCont (f v) q))
  7 KB (1,253 words) - 23:34, 25 June 2021
• Ro/Rodin/Alte exemple
  fie v[x]=0; {citeste y;fie v[x]=y;};
  1 KB (212 words) - 05:06, 12 July 2021
• QuickCheck / GADT
  Dyn t v -> RInt -> u == v
  8 KB (1,072 words) - 18:32, 16 January 2017
• Gtk2Hs/Tutorials/TreeView
  v <- Model.listStoreGetValue list s putStrLn $ "selected " ++ v
  2 KB (280 words) - 00:46, 9 April 2021
• Let's Play Free Games
  ub - means "V. Alecsandri" University of Bacau <br>
  629 bytes (98 words) - 04:43, 27 February 2019
• Partibles for composing monads
  mcommute g = \ v u -> g u v mcommute' m = \ v -> liftM ($ v) m
  4 KB (691 words) - 08:14, 12 June 2023
• MultiCase
  Left v, Right v -> v
  3 KB (470 words) - 23:09, 11 July 2021
• Tiny Identifier Dictionary
  | v | v
  2 KB (285 words) - 01:34, 14 July 2021
• 99 questions/Solutions/86
  color ((v, e):xs) ys n = if any (\x -> (x, n) `elem` ys) e else color xs ((v, n) : ys) n
  2 KB (325 words) - 03:50, 10 January 2017
• UrlDisp
  cgiAddHeader n v = lift $ cgiAddHeader n v v <- lift ask >>= \c -> liftIO (quickQuery' c queryText [])
  4 KB (592 words) - 21:17, 29 June 2021
• 99 questions/Solutions/85
  v = map fst a f p = let n = zip v p
  2 KB (287 words) - 03:50, 10 January 2017
• Functional dependencies vs. type families
  instance (...) => C (FilterParam a) v (FilterResult v) where type Input (FilterParam a) (FilterResult v) = v
  6 KB (936 words) - 20:35, 27 January 2014
• Heterogenous collections
  objectString (IntObject v) = show v objectString (StringObject v) = v
  5 KB (863 words) - 11:44, 22 August 2021
• Multiplate
  > buildDecl (v := e) = (:=) <$> pure v <*> expr child e ...he case of <code>v</code> in <code>v := e</code>, we simply use <code>pure v</code>.
  7 KB (1,049 words) - 07:41, 3 March 2022
• Blog articles/Libraries
  ...-revolution-episode-v-the-deb-strikes-back/ The lambda revolution, Episode V, the deb strikes back]
  2 KB (179 words) - 09:01, 13 November 2013
• 99 questions/Solutions/39
  snap v origin step = if r==0 then v else v+(step-r) where r = rem (v-origin) step -- NB: origin <= v ; else use MOD
  5 KB (696 words) - 19:46, 18 January 2014
• Functional dependencies
  <haskell>v = extract ('x', 3)</haskell> and it will infer the type <haskell>v :: Char</haskell>
  4 KB (706 words) - 22:41, 21 July 2021
• Plainly partible
  parts (Fresh g u) = [ Fresh g v | v <- parts u ] fresh (Fresh g u) = [ g v | v <- parts u ]
  11 KB (1,656 words) - 22:33, 4 July 2022
• Diagrams/Dev/Migrate1.3
  ...Basically this means whenever you saw <code>v</code>, replace it by <code>v n</code>. So: * <code>QDiagram b v m -&gt; QDiagram b v n m</code>
  11 KB (1,707 words) - 01:06, 1 May 2015
• Research papers/Authors
  ==V==
  8 KB (1,251 words) - 05:43, 1 September 2022
• New monads/MonadRandom
  liftState t = do v <- get let (x, v') = t v
  6 KB (894 words) - 13:41, 2 April 2019
• Foldable and Traversable
  data Supply s v = Supply { unSupply :: [s] -> ([s],v) } fmap f av = Supply (\l -> let (l',v) = unSupply av l in (l',f v))
  11 KB (1,895 words) - 19:00, 18 May 2020
• 99 questions/Solutions/70
  P v >>= f = P $ \ s -> do (x, s') <- v s
  7 KB (1,025 words) - 02:14, 23 July 2021
• Cookbook/Interactivity
  ...tp://haskell.org/ghc/docs/latest/html/libraries/base-4.12.0.0/Prelude.html#v%3AputStr putStr] ...tp://haskell.org/ghc/docs/latest/html/libraries/base-4.12.0.0/Prelude.html#v%3AputStrLn putStrLn]
  2 KB (218 words) - 21:07, 6 January 2019
• New monads/MonadAdvSTM
  The semantics of printing the contents of the TVar "v" created in ("onRetry v",7)
  24 KB (3,463 words) - 05:20, 12 July 2021
• Xmonad/Config archive/gray hemp's .conky cpu
  echo ${cpu} | gdbar -s v -h 15 -sw 1 >> /tmp/.dzen2cpugraph
  924 bytes (169 words) - 15:18, 6 February 2021
• Concurrency with oracles
  ...e-effects within data-parallel segments of programs. Simon B. Jones and K. V. S. Prasad uses oracles directly for operating and broadcasting systems res ...i=10.1.1.30.6225&rep=rep1&type=pdf A Calculus of Broadcasting Systems], K. V. S. Prasad.
  4 KB (565 words) - 06:24, 12 June 2023
• Real World Applications/Event Driven Applications
  dmUpdate (Domain v) (EventAdd a) = Domain (v + a) uiUpdate (Domain v) = do
  7 KB (1,076 words) - 08:53, 4 July 2014
• Diagrams/Dev/Arrows
  ...ode>DelayedLeaf</code> contains a funtion <code>DownAnnots v -> QDiagram b v m</code>, in other words a set of instructions about how to create the arro can be expanded by running the function <code>DownAnnots v -> QDiagram b v m</code> on
  8 KB (1,340 words) - 13:19, 29 March 2014
• Web/Libraries/Formlets
  v <- liftIO extractor case v of
  8 KB (985 words) - 06:56, 16 September 2013
• 99 questions/Solutions/93
  exprs ns = [(Binary e1 op e2, v) | (ns1, ns2) <- splits ns, v <- maybeToList (apply op v1 v2)]
  5 KB (621 words) - 15:30, 8 June 2017
• Diagrams/Dev/Constraints
  ...b/75e7f64caa7d0bd6e384bd5316b6e5e6754b1f1d/src/Graphics/Rendering/Diagrams/V.hs. He also used the Scalar type from vector: https://github.com/diagrams/d ...ented. It wasn't really any effort, since there was already a type family (V) to use. The diagrams types are already highly polymorphic, so adding more
  10 KB (1,671 words) - 03:59, 16 August 2014
• ListT done right
  v :: Int -> ListT [] Int v 0 = ListT [[0, 1]]
  13 KB (2,036 words) - 13:54, 4 July 2023
• Quasiquotation
  antiExprExp (AntiIntExpr v) = Just $ TH.appE (TH.conE (TH.mkName "IntExpr")) (TH.varE (TH.mkName v))
  12 KB (1,695 words) - 15:27, 12 November 2019
• 99 questions/61 to 69
  In this layout strategy, the position of a node v is obtained by the following two rules: * x(v) is equal to the position of the node v in the inorder sequence
  12 KB (1,696 words) - 05:35, 11 June 2023
• Links/O colectie de link-uri/iulie 2009
  http://www.youtube.com/watch?v=gVLFGQGRsDw&feature=related
  3 KB (432 words) - 05:52, 10 August 2022
• Monoid
  (v, y) -> (w <> v, y) ...the first component that allows you to incorporate both <tt>w</tt> and <tt>v</tt> into the final result, which seems like an important thing to do.
  7 KB (1,101 words) - 02:30, 27 December 2019
• Nonogram
  puzzle h v = Puzzle cols = length v
  17 KB (2,482 words) - 20:34, 8 June 2017
• Emacs/Keybindings and simple usage
  *<code>C-c C-v</code> check current buffers file with hlint
  2 KB (358 words) - 18:22, 11 April 2016
• Catamorphisms
  fromCoYoneda (CoYoneda f v) = fmap f v # T. Uustalu, V. Vene. [http://citeseer.ist.psu.edu/314266.html Coding Recursion a la Mendl
  9 KB (1,367 words) - 09:34, 17 November 2022
• GetOpt
  *# can support using a flag multiple times (-v -v -v) > setFlag f v fs = (Flag f v) : tl where tl = deleteFlag f fs
  10 KB (1,542 words) - 05:40, 8 June 2023
• Diagrams/Dev/Expression
  ...add a choice combinator, <code>orElse :: Diagram v -> Diagram v -> Diagram v</code>, which instructs a backend to use the first diagram it fully support
  8 KB (1,309 words) - 19:09, 18 May 2014
• Introduction to IO
  ...ction <code>x</code> to be run, and the result bound to the variable <code>v</code>.
  5 KB (958 words) - 15:20, 3 August 2022
• Untypechecking
  *FP> let f x = (x,x) in case f id of (u,v) -> type'eq u v *FP> :t let f x = (x,x) in case f id of (u,v) -> type'eq u v
  20 KB (3,458 words) - 15:19, 6 February 2021
• Parsing expressions and statements
  <|> do { v <- m_identifier ; return (v := e)
  8 KB (1,033 words) - 02:43, 21 March 2018
• 99 questions/90 to 94
  ...n jump(N,X/Y,U/V) to express the fact that a knight can jump from X/Y to U/V on a NxN chessboard. And finally, represent the solution of our problem as
  6 KB (802 words) - 06:27, 11 June 2023
• 99 questions/80 to 89
  digraph([r,s,t,u,v],[a(s,r),a(s,u),a(u,r),a(u,s),a(v,u)]) [n(r,[]),n(s,[r,u]),n(t,[]),n(u,[r]),n(v,[u])]
  11 KB (1,679 words) - 06:20, 11 June 2023
• Yhc/Javascript/Programmers guide/Echo demo source
  v <- getProperty o "value" >>= asString when (length v > 0) $ do
  12 KB (2,023 words) - 22:51, 5 April 2021
• Evaluation order and state tokens
  ...ge.haskell.org/package/primitive-0.5.3.0/docs/Control-Monad-Primitive.html#v:unsafeInlineIO <code>unsafeInlineIO</code>], also known as [http://www.redd import qualified Data.Vector as V
  21 KB (3,408 words) - 09:26, 9 September 2014
• MapReduce as a monad
  ...ceT m u u -> MapReduceT m t u -> (u -> MapReduceT m u v) -> MapReduceT m t v
  6 KB (1,053 words) - 03:27, 9 April 2021
• WxHaskell/Quick start
  &gt; /usr/local/wxhaskell/bin/macosx-app -v hello bounce h v
  14 KB (2,248 words) - 15:18, 6 February 2021
• Tutorials/Programming Haskell/Argument handling
  parse ["-v"] = version >> exit $ ./tac -v
  25 KB (3,657 words) - 18:20, 12 September 2015
• Type
  toEnum n = let (v,s) = n`divMod`4 in Card (toEnum v) (toEnum s)
  7 KB (1,016 words) - 15:20, 6 February 2021
• Dmenu-4.0-xft.diff
  else if(!strcmp(argv[i], "-v")) - " [-p <prompt>] [-sb <color>] [-sf <color>] [-v]\n");
  7 KB (986 words) - 15:19, 6 February 2021
• GHC/Type families
  empty :: GMap k v lookup :: k -> GMap k v -> Maybe v
  42 KB (6,828 words) - 17:15, 4 February 2023
• WxHaskell/Download
  &gt; /usr/local/wxhaskell/bin/macosx-app -v hello
  5 KB (640 words) - 18:31, 31 January 2016
• High-level option handling with GetOpt
  , Option "v" ["verbose"] , Option "V" ["version"]
  8 KB (1,082 words) - 23:30, 3 December 2020
• GHC/Data Parallel Haskell
  dotp_wrapper v w = dotp_double (fromPArrayP v) (fromPArrayP w) dotp_wrapper v w = dotp_double (fromPArrayP v) (fromPArrayP w)
  21 KB (3,158 words) - 08:39, 10 August 2022
• Stiri Ro/Haskell-2010
  V-am tradus lucrarea si in limba romana. O puteti descarca de aici: ...ri in Haskell. O gasiti la indexul [[Intrebarile incepatorului]] la litera V. Sub titlul [[Vectorii]].
  6 KB (889 words) - 22:57, 18 April 2021
• The Monad.Reader/Issue3/Functional Programming vs Object Oriented Programming
  v <- interpret x let m' = insert i v m
  10 KB (1,718 words) - 07:14, 10 August 2022
• Haskell programming tips/Discussion
  loop i v acc = ... sum' 2 n = foldl (\a e -> let v = a+e in v `seq` v) 0 [1..n]
  24 KB (4,110 words) - 01:13, 7 November 2020
• The Fibonacci sequence
  Just (u, v) -> unfoldl f v ++ [u]
  8 KB (1,150 words) - 15:41, 5 July 2022
• Generalised algebraic datatype
  (v,vs) <- parse (Times x (Star x)) (t:ts) return (v:vs)
  8 KB (1,374 words) - 14:33, 15 December 2022
• Yi/FAQ
  | Ctrl-v |C-v
  9 KB (1,413 words) - 00:17, 24 November 2014
• WebApplicationInterface
  , headers = map (\(k, v) -> (pack k, pack v)) hdrs forM_ respHeaders $ \(k, v) ->
  14 KB (2,193 words) - 05:45, 12 July 2021
• DHD UHac/Attendees
  | Karel V Hotel
  4 KB (458 words) - 07:32, 8 May 2020
• Web/Frameworks/HSP
  Project HSP v 0.4 consists of a set of packages with related functionality:
  4 KB (597 words) - 10:39, 19 April 2021
• Research papers/Compilation
  ...on Coalgebraic Methods in Computer Science, CMCS '03 (Warsaw, Apr. 2003), v. 82, n. 1 of Electron. Notes. in Theor. Comput. Sci.. Elsevier, 2003. :N. Ghani, T. Uustalu, M. Hamana. Higher-Order and Symb. Comput., v. 19, n. 2-3, to appear. - .pdf, 330K // Conf. version in F. Honsell, M. M
  19 KB (2,599 words) - 00:14, 15 June 2023
• Continuation
  h :: U -> M V h' :: U -> (V -> M b) -> M b
  10 KB (1,560 words) - 12:02, 15 April 2024
• CTRex
  v = if c then "Yes" else "Nope" in p := v .| r''
  25 KB (4,073 words) - 08:53, 9 December 2013
• FFI imports packaging utility
  -v --verbose provide verbose output -V --version show program version number
  19 KB (2,929 words) - 23:51, 13 September 2013
• Template Haskell
  data Options = B1 | B2 | V Integer options = [B1, V 3]
  30 KB (4,551 words) - 00:29, 15 June 2023
• Yhc/Options
  -v --version Show version information (default=off)
  6 KB (733 words) - 15:19, 6 February 2021
• Research papers/Data structures
  :N. Ghani, M. Hamana, T. Uustalu, V. Vene. In H. Nilsson, ed., Proc. of 7th Symp. on Trends in Functional Prog ...ware Science and Computation Structures, FoSSaCS 2003 (Warsaw, Apr. 2003), v. 2620 of Lect. Notes in Comput. Sci., pp. 54-69. Springer-Verlag, 2003.
  14 KB (1,953 words) - 00:54, 5 June 2022

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