Search results

• 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

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