Search results

Rubiks Cube
Edit by somebody else: I'm not the author of this, however I think there are some erros in the definit dirVec $ lines s !! (4*l - y + 1) !! (7*c + 2*(x + 1))

8 KB (1,020 words) - 01:02, 23 September 2018
Output/Input
<small>[https://academic.oup.com/comjnl/article-pdf/32/2/162/1445725/320162.pdf Functional Programming and Operating Systems], Simon -- section 2

8 KB (1,236 words) - 12:36, 1 January 2024
Rhine
freeFallFrom10Meters :: ClSF m cl a Pos Here, <hask>m</hask> is an arbitrary monad and <hask>cl</hask> is an arbitrary clock type

8 KB (1,207 words) - 21:07, 26 September 2018
Exception
newtype ExceptionalT e m a = ExceptionalT {runExceptionalT :: m (Exceptional e a)}

10 KB (1,404 words) - 06:22, 22 January 2020
Euler problems/181 to 190
fun a1 b1 = sum [ e | e <- [2..a*b-1], gcd (e-1) a == 2,

15 KB (2,018 words) - 01:29, 26 April 2021
Xmonad/Config archive/Template xmonad.hs (0.6)
import qualified Data.Map as M myWorkspaces = ["1","2","3","4","5","6","7","8","9"]

10 KB (1,329 words) - 15:18, 6 February 2021
Examples/Random list
unpick (x:xs) = do zs <- unpick' [] [x] xs 2 ,2,3,4.

6 KB (855 words) - 12:54, 26 June 2017
Cookbook/Lists and strings
[1..10] --> [1,2,3,4,5,6,7,8,9,10] [1..] --> [1,2,3,4,5,...

7 KB (1,020 words) - 21:02, 6 January 2019
From a newbie II
Just like it took... what, 2 years? to learn C++ (and I still don't consider myself good at it), I think I'm not even sure if I like the code more than the resulting binaries sometimes

2 KB (390 words) - 15:19, 6 February 2021
Kernel Modules
...(e.g. ar, ld). You also should have the necessary tools to build GHC 6.8.2 - this includes a copy of ghc-6.8.x, alex, and happy. ...downloading the House 0.8.93 [1]. Use the build system to acquire ghc-6.8.2 and apply the House patches. The House patches allow GHC to compile Haskell

8 KB (1,231 words) - 18:14, 20 February 2017
Unicode-symbols
I'm thinking of adding the following symbol as another alternative for (*). 2 * 3 &equiv; 6

9 KB (1,396 words) - 23:18, 24 July 2021
Haskell in 5 steps
ack m 0 = ack (m-1) 1 ack m n = ack (m-1) (ack m (n-1))

5 KB (786 words) - 22:17, 16 December 2020
Evaluation order and state tokens
two <- helper 2 I think most people would agree: it will print 1, then 2, then 3. Now let's tweak this a little bit:

21 KB (3,408 words) - 09:26, 9 September 2014
Package versioning policy
...number of additional components, for example 2.1.0.4 (in this case, ''A''=2, ''B''=1, ''C=0''). This policy defines the meaning of the first three com ...hic ordering of the components. For example, 2.0.1 > 1.3.2, and 2.0.1.0 > 2.0.1. (The <tt>Data.Version.Version</tt> type and its <tt>Ord</tt> instance

9 KB (1,408 words) - 20:31, 2 October 2016
Xmonad/Config archive/Template xmonad.hs (0.8)
import qualified Data.Map as M myWorkspaces = ["1","2","3","4","5","6","7","8","9"]

9 KB (1,218 words) - 15:17, 6 February 2021
Monad
class Monad m where (>>=) :: m a -> ( a -> m b) -> m b

13 KB (1,870 words) - 11:14, 22 October 2022
Debugging
crash = sum [1,2,3,undefined,5,6,7,8] f x = if odd x then x*2 else 0

9 KB (1,453 words) - 19:18, 3 February 2021
Wadler's Law
2. Lexical syntax I'm delighted to hear this.

4 KB (583 words) - 10:26, 26 December 2017
Blow your mind
transpose . unfoldr (\a -> toMaybe (not $ null a) (splitAt 2 a)) unfoldr (\a -> toMaybe (not $ null a) (splitAt 2 a))

12 KB (1,704 words) - 17:53, 22 November 2019
Hack-Nix
...ies which are present on your system. However I haven't tried it because I'm running Nixos myself. I'm pretty sure I've missed important things you're interested in.

5 KB (726 words) - 10:39, 5 January 2018

Search results

Navigation menu

Search