Search results

Anonymous function
Or I could make a nameless function of two parameters, x and y: <hask>\x y -> x + y</hask>, which could be applied like so:

2 KB (296 words) - 06:56, 12 April 2021
99 questions/Solutions/36
where swap (x,y) = (y,x)

722 bytes (109 words) - 19:45, 18 January 2014
Ko/Either
safeDiv x y = Right (x `div` y)

877 bytes (61 words) - 02:13, 14 November 2023
New monads/MonadExit
y <- x case y of

4 KB (707 words) - 09:43, 9 December 2014
Let vs. Where
f x = y where y = ... x ...

4 KB (716 words) - 07:41, 26 January 2019
Rubiks Cube
...gy to the "right hand rule" convention which assigns an ordering to the "x y and z" axes and determines that z will be "out of" rather than "into" the p The mid points of the 27 small cubes are (x,y,z) where x,y,z ∈ {-10,0,10}.

8 KB (1,020 words) - 01:02, 23 September 2018
Bowling
scoreFrame (x:y:rest) | x+y < 10 = (x+y,rest) addFrame (total,x:y:rest) | x+y < 10 = (total+x+y ,rest)

4 KB (555 words) - 15:19, 6 February 2021
Dynamic programming example
...k> if i pieces can be bought, and moreover it can be done by x boxes of 6, y boxes of 9, and z boxes of 20. Below the code for <hask>buy</hask> is more Just(x,y,z) -> Just(x+1,y,z)

6 KB (929 words) - 06:42, 21 November 2020
99 questions/Solutions/49
gray' n = (gl . gr) [] where gl y = foldr (\s acc -> ('0':s):acc) y gp gr y = foldl (\acc s -> ('1':s):acc) y gp

2 KB (298 words) - 03:02, 7 June 2021
Seq
let y = sum [0..47] in x `seq` 3 + y + y^2

4 KB (716 words) - 14:44, 8 January 2024
Partibles for composing monads
let !y = k x u2 in y

4 KB (691 words) - 08:14, 12 June 2023
DDC/DestructiveUpdate
...ple point type as an example. In this definition, <hask>x</hask> and <hask>y</hask> are field names and are ''local'' to the <hask>Point</hask> type. Th = Point { x :: Float; y :: Float; }

3 KB (430 words) - 00:46, 24 February 2018
Es/Haskell
...opilar información en español acerca de este lenguaje puramente funcional, y de esa forma promover su uso entre hispano-hablantes. * [[Librerías y Herramientas|Librerías y Herramientas]]

6 KB (938 words) - 09:51, 18 July 2017
Sistemul de inferente de tipuri stabileste singur tipul oricarei expresii ?
:<code>(\ x -> x x) (\ y -> y)</code> :<code>(\y -> y) (\y -> y)</code>

4 KB (617 words) - 03:01, 9 April 2021
99 questions/Solutions/56
mirror (Branch _ a b) (Branch _ x y) = mirror a y && mirror b x

1 KB (179 words) - 13:36, 25 December 2016
Comparison chain
lift f x (y,chain) = (x, (f,y):chain) lift f (Just x) y | f x y = Just y

3 KB (543 words) - 23:08, 26 January 2016
99 questions/Solutions/19
rotate x y | y > 0 = rotate (tail x ++ [head x]) (y-1)

3 KB (474 words) - 20:35, 23 May 2021
DDC/FieldProjections
= Vector { x :: Float; y :: Float; } out vec.y -- prints '4.0'

3 KB (430 words) - 11:59, 19 April 2021
99 questions/Solutions/46
...y f domain = concatMap (++ "\n") [printBinaryInstance f x y | x <- domain, y <- domain] printBinaryInstance f x y = show x ++ " " ++ show y ++ " " ++ show (f x y)

4 KB (655 words) - 07:48, 27 April 2016
Bresenham's line drawing algorithm
maySwitch = if steep then (\(x,y) -> (y,x)) else id

1 KB (168 words) - 23:01, 11 July 2021

Search results

Navigation menu

Search