Search results

• Tiny Identifier Dictionary
  | x,y,z | x,y,z
  2 KB (285 words) - 01:34, 14 July 2021
• Euler problems/1 to 10
  f x y | fst z <= n2 = z where z = x `addE` y
  6 KB (881 words) - 02:31, 8 May 2016
• 99 questions/Solutions/17
  third (_, _, z) = z
  3 KB (452 words) - 21:07, 10 March 2019
• Type SK
  > , Eval1 z z' d3 > ) => Eval1 (App (App (App (Other a) x ) y ) z )
  10 KB (1,653 words) - 00:25, 12 July 2021
• Cookbook/Lists and strings
  ['a'..'z'] --> "abcdefghijklmnopqrstuvwxyz" ['a','c'..'z'] --> "acegikmoqsuwy"
  7 KB (1,020 words) - 21:02, 6 January 2019
• State Monad
  getNext >>= \z -> return z
  7 KB (1,055 words) - 15:06, 21 December 2018
• 99 questions/1 to 10
  λ> myLast ['x','y','z'] 'z'
  5 KB (719 words) - 05:27, 10 June 2023
• Avoiding partial functions
  (\x0 go y -> case go y of ~(zs,z) -> (x0:zs,z))
  3 KB (506 words) - 04:03, 4 September 2017
• Functional programming/Old version
  move z,d0 let s = z-(x+y)
  2 KB (378 words) - 23:58, 5 April 2021
• Fold
  -- if the list is empty, the result is the initial value z; else foldr f z [] = z
  12 KB (1,923 words) - 18:51, 28 March 2019
• Lifting
  liftL3 f x y z = fmap (uncurry . uncurry $ f) $ zipL (zipL x y) z assoc ~(~(x, y), z) = (x, (y, z))
  7 KB (1,164 words) - 13:33, 22 May 2024
• Performance/Strictness
  lgo z [] = z lgo z (x:xs) = lgo (f z x) xs
  7 KB (1,162 words) - 17:16, 8 June 2022
• Do notation considered harmful
  mdo x <- f x y z y <- g x y z
  10 KB (1,589 words) - 01:08, 27 September 2021
• WxHaskell/Development/Release procedure
  wxhaskell-x-y-z-w
  1 KB (187 words) - 13:26, 30 December 2015
• Catamorphisms
  data NatF a = S a | Z deriving (Eq,Show) fmap f Z = Z
  9 KB (1,367 words) - 09:34, 17 November 2022
• Haskell a la carte
  ...egers to integers. In mathematics, we'd write <math>f:\mathbb{Z}\to\mathbb{Z},\ f(x)=x\cdot x</math>. Every expression in Haskell has a type and the com foldr f z [] = z
  6 KB (1,024 words) - 23:56, 25 June 2021
• Research papers/Authors
  ==Z==
  8 KB (1,251 words) - 05:43, 1 September 2022
• Monoid
  (x <> y) <> z = x <> (y <> z) ...>, then all the elements of <hask>y</hask>, them all the elements of <hask>z</hask>.
  7 KB (1,101 words) - 02:30, 27 December 2019
• Parallel/Glossary
  == S-Z ==
  4 KB (637 words) - 02:02, 6 May 2024
• HaskellImplementorsWorkshop/2013/Yang
  ''Edward Z. Yang''
  1,004 bytes (152 words) - 06:35, 16 September 2013

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