Search results

No kind signatures
newtype MonadTransformer t m a = MonadTransformer (t m a) * <hask>m :: * -> *</hask>,

1 KB (192 words) - 23:01, 5 April 2021
Nondeterminism, monadically
newtype NondetT m a = NondetT { mkNondetT :: (forall b. (a -> m b -> m b) -> m b -> m b) }

1 KB (223 words) - 07:25, 15 June 2022
ListT done right alternative
newtype ListT m a = ListT { runListT :: m (Maybe (a, ListT m a)) } foldListT :: Monad m => (a -> m b -> m b) -> m b -> ListT m a -> m b

2 KB (402 words) - 06:31, 12 May 2015
Solution4.html
parent :: MonadPlus m => Sheep -> m Sheep grandparent :: MonadPlus m => Sheep -> m Sheep

1 KB (151 words) - 08:45, 9 April 2021
Solution1.html
mother ms >>= \m -> father m

1 KB (147 words) - 08:41, 9 April 2021
99 questions/Solutions/37
(**) Calculate Euler's totient function phi(m) (improved). totient m = product [(p - 1) * p ^ (c - 1) | (p, c) <- prime_factors_mult m]

373 bytes (58 words) - 19:46, 18 January 2014
New monads/MonadSupply
newtype SupplyT s m a = SupplyT (StateT [s] m a) class Monad m => MonadSupply s m | m -> s where

1 KB (202 words) - 05:09, 4 April 2014
99 questions/Solutions/24
Lotto: Draw N different random numbers from the set 1..M. diffSelect n m = do

2 KB (244 words) - 00:09, 7 April 2019
Emacs/Project navigation
ETAGS allows jumping to the definition of names at the point via <code>M-.</code>. To generate tags (a TAGS file) for a project, you need [http://h Run <code>M-x haskell-process-generate-tags</code> to generate the TAGS file of the [[S

1 KB (170 words) - 18:23, 11 April 2016
All About Monads/Solutions
mother ms >>= \m -> father m

4 KB (454 words) - 02:33, 7 January 2022
MonadPlus
class (Monad m) => MonadPlus m where mzero :: m a

2 KB (240 words) - 22:55, 5 April 2021
New monads/MonadExit
class Monad m => MonadExit e m | m -> e where exitWith :: e -> m a

4 KB (707 words) - 09:43, 9 December 2014
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
Partibles for composing monads
type M p a = p -> a unit :: Partible p => a -> M p a

4 KB (691 words) - 08:14, 12 June 2023
Incompatibilities between MTL 1 and MTL 2
instance (Applicative m) => Applicative (ReaderT r m) where ... instance (Alternative m) => Alternative (ReaderT r m) where ...

3 KB (378 words) - 15:19, 6 February 2021
Category theory/Monads
class Functor m => Monad m where return :: alpha -> m alpha

3 KB (547 words) - 07:53, 16 April 2019
99 questions/Solutions/41
goldbachList n m = map goldbach $ dropWhile (<4) $ filter even [n..m] goldbachList' n m i = filter (\(x,y) -> x > i && y > i) $ goldbachList n m

992 bytes (161 words) - 19:48, 18 January 2014
Unix tools/Date
$ ./a.out "%a %b %e %H:%M:%S %Z %Y" $ ./a.out "%y-%m-%d"

543 bytes (78 words) - 15:19, 6 February 2021
99 questions/Solutions/22
range n m | n == m = [n]

1 KB (214 words) - 02:08, 5 April 2014
Xmonad/Config archive/Gwern's xmonad.hs
import Data.Map as M (fromList,union, Map()) keys = \c -> myKeys c `M.union` keys def c

6 KB (615 words) - 23:47, 28 November 2018
MonadPlus reform proposal
class Monad m => MonadZero m where mzero :: m a

4 KB (609 words) - 18:22, 23 June 2015
Mutable variable
data T m a = Cons { write :: a -> m (), read :: m a } modify :: Monad m => T m a -> (a -> a) -> m ()

2 KB (338 words) - 20:04, 13 May 2020
New monads/MonadRandom
class (Monad m) => MonadRandom m where getRandom :: (Random a) => m a

6 KB (894 words) - 13:41, 2 April 2019
Upgrading from MTL 1 to MTL 2
* ''Could not deduce (Functor m) from the context (Monad m) arising from a use of fmap'' * ''Could not deduce (Functor m) from the context (Monad m) arising from the superclasses of an instance declaration''

2 KB (374 words) - 00:43, 9 April 2021
Monad Transformers Tutorial
newtype MaybeT m a = MaybeT { runMaybeT :: m (Maybe a)

5 KB (801 words) - 19:04, 8 February 2014
Merely monadic
* <code>return :: Monad m => a -> m a</code>: | <code>:: m a</code>

6 KB (988 words) - 04:35, 16 March 2021
99 questions/Solutions/18
--slice xs m n = [(xs !! (m-1)) .. (xs !! (n-1))] slice lst 1 m = slice' lst m []

3 KB (560 words) - 22:51, 3 December 2020
Expanding type synonyms in error messages proposal
duplicate :: Monad m => a -> Producer a m () doubleUp :: Monad m => Consumer String m String

2 KB (215 words) - 09:14, 19 June 2015
Diagrams/Converting
! !! <code>QDiagram ... m</code> !! <code>Diagram</code> ! <code>QDiagram ... m</code>

3 KB (373 words) - 20:53, 2 June 2017
Monads as containers/is
...ldi ásamt auka upplýsingum. Auka upplýsingarnar eru mismunandi fyrir hvern mónað. Fyrir Either eru auka upplýsingarnar eitt Boolean: annaðhvort Left return :: (Monad m) => a -> m a

3 KB (553 words) - 12:08, 13 August 2015
Haskell入門 5ステップ
ack m 0 = ack (m-1) 1 ack m n = ack (m-1) (ack m (n-1))

7 KB (356 words) - 07:44, 16 November 2019
Monad laws
| <haskell>m</haskell> | <haskell>m</haskell>

5 KB (788 words) - 10:40, 1 February 2024
Ru/GHC/Class Instance Extensions
class Map m k v where empty :: m k v

3 KB (170 words) - 23:05, 29 June 2021
Random shuffle
fisherYatesStep (m, gen) (i, x) = ((insert j x . insert i (m ! j)) m, gen') {- | @grabble xs m n@ is /O(m*n')/, where @n' = min n (length xs)@

5 KB (743 words) - 13:10, 9 May 2017
Concurrency demos/Haskell-Javascript concurrency
Just m -> putLine "" ("Success") doc body showmsg t m doc body =

4 KB (517 words) - 04:59, 26 April 2021
Contstuff
newtype ContT r m a ...tT'' behaves like the identity monad. A computation of type <hask>ContT r m a</hask> is a CPS computation with an intermediate result of type <hask>a</

12 KB (2,067 words) - 05:43, 9 March 2021
Testing primality
f k m | r == 1 = (k,m)

4 KB (605 words) - 17:09, 18 July 2022
Performance/Monads
instance (Monoid m, Error e) => Monad (DRMonad e s w) where bindDRMonad :: Monoid m => DRMonad a e s w -> (a -> DRMonad b e s w) -> DRMonad b e s w

6 KB (995 words) - 23:51, 16 April 2021
MapReduce as a monad
...hask>m</hask> be a <hask>Monad'</hask>, a type with four parameters: <hask>m s a s' b</hask>. m s a s' b -> ( b -> m s' b s'' c ) -> m s a s'' c

6 KB (1,053 words) - 03:27, 9 April 2021
Humor/Dialogs
Student: Hey, you're cheating! I'm the one doing all the work here! I'm generating primes faster than I need them, so really I'm stealing

3 KB (445 words) - 15:19, 6 February 2021
Diagrams/Dev/Fixpoint
I'm not sure about <code>Style</code> yet. type Context b v m = Style v ::: Name ::: SubMap b v m ::: ()

7 KB (1,077 words) - 14:56, 12 June 2014
Hackathon/PDX
* jmelesky: i'm interested. maybe a "wrap a C library for hackage" hackathon?

274 bytes (36 words) - 02:36, 9 April 2021
Class system extension proposal
class Functor m where fmap :: (a -> b) -> m a -> m b

8 KB (1,232 words) - 01:58, 8 October 2014
Monoid
...''m'' as precisely what you need in order to fold up a list of values of ''m''. class Semigroup m where

7 KB (1,101 words) - 02:30, 27 December 2019
Lifting
return :: (Monad m) => a -> m a liftM :: (Monad m) => (a1 -> r) -> m a1 -> m r

7 KB (1,165 words) - 20:40, 31 October 2019
Haskell/Lazy evaluation
magic m n = m : (magic n (m+n)) ...me expression (bound to <code>m</code> in <code>magic n m = n : magic m (n+m)</code>), and so the second <code>(1+1)</code> is now 2 as well. The first

4 KB (708 words) - 23:10, 19 April 2021
Hac φ/Projects
...framework for writing stateful, elastically scalable, AP microservices. I'm probably going to be working on the cluster rebalancing system. Also, help ...for getting native cross platform GUI up and running quickly and easily. I'm probably going to work on patching the missing Linux High DPI support. Any

2 KB (362 words) - 15:04, 21 October 2016
Foldable Traversable In Prelude
- foldM :: Monad m => (a -> b -> m a) -> a -> [b] -> m a + foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b

14 KB (2,640 words) - 11:47, 26 November 2023
Euler problems/21 to 30
problem_21 = sum [m+n | m <- [2..9999], let n = divisorsSum ! m, amicable m n] where amicable m n = m < n && n < 10000 && divisorsSum ! n == m

8 KB (1,054 words) - 15:53, 11 October 2015
ListT done right
newtype ListT m a = ListT { runListT :: m [a] } instance (Monad m) => Monad (ListT m) where

13 KB (2,036 words) - 13:54, 4 July 2023
99 questions/Solutions/86
sort xs n f = let m = f xs in m : sort [x | x <- xs, x /= m] (n + 1) f

2 KB (325 words) - 03:50, 10 January 2017
SDL/Windows
SETX /M PATH "%SDL_DIR%\bin;%PATH%" SETX /M LIBRARY_PATH "%SDL_DIR%\bin;C:\Programs\MinGW\lib;%LIBRARY_PATH%"

6 KB (984 words) - 23:58, 17 June 2016
GHC/Stand-alone deriving declarations
data T m = MkT (m Int) deriving Eq instance Eq (m Int) => Eq (T m) where ...

5 KB (755 words) - 22:49, 12 June 2021
99 questions/Solutions/34
(**) Calculate Euler's totient function phi(m). ...ined as the number of positive integers r (1 <= r < m) that are coprime to m.

1 KB (224 words) - 19:44, 18 January 2014
GHC/Type system/PolyKinds
where I'm writing the kind argument explicitly. To be fully clear, I'm writing <hask>List</hask> for the type constructor for lists (written <hask

2 KB (242 words) - 23:38, 24 July 2021
99 questions/Solutions/68
preInTree :: Monad m => String -> String -> m (Tree Char)

2 KB (280 words) - 03:43, 10 January 2017
Anagrams
minus :: (Monad m) => [CharCount] -> [CharCount] -> m [CharCount]

2 KB (256 words) - 15:19, 6 February 2021
HDBC-ODBC MS SQL under Linux
Prelude> :m Database.HDBC Prelude Database.HDBC> :m + Database.HDBC.ODBC

1 KB (210 words) - 11:52, 19 April 2021
Sistemul de inferente de tipuri stabileste singur tipul oricarei expresii ?
unusual m f g = (m f [1,2,4,7] , m g ['A','C','M'] ) unusual m f g nu se poate infera un (cel mai mic) tip al lui m deoarece m este folosit odata ca 

4 KB (617 words) - 03:01, 9 April 2021
Xmonad/Config archive/TeXitoi's xmonad.hs
import qualified Data.Map as M keys = \c -> myKeys c `M.union` keys desktopConfig c,

4 KB (452 words) - 14:23, 2 May 2018
List comprehension
| i <- [0..], let x = m + 60*i, test x y ] | m <- [1..60], n <- [1..60], mod (poly m n) 60 == k ]

5 KB (679 words) - 17:14, 4 February 2023
99 questions/Solutions/63
maxmin Empty m = (0, m) maxmin (Branch _ l r) m = (max m $ max max_l max_r, min min_l min_r) where

9 KB (727 words) - 03:41, 10 January 2017
Emacs/Keybindings and simple usage
*<code>C-c M-.</code> find definition of (interpreted) symbol at point (See <code>C-h m</code> for more information).

2 KB (358 words) - 18:22, 11 April 2016
Abstract data type
left :: (MonadPlus m) => t a -> m (t a) right :: (MonadPlus m) => t a -> m (t a)

5 KB (872 words) - 13:14, 2 September 2014
Haskell mode for Emacs/Color chords
(Please see screenshot below) and, In an emacs buffer, type (M-x list-colors-display) I'm looking to modify haskell-mode in emacs so that each type decleration has t

2 KB (249 words) - 22:40, 29 June 2021
Diagrams/Dev/Transformations
...>M</math> is a matrix <math>M^{-1}</math> such that <math>MM^{-1} = M^{-1} M = I</math>, the identity matrix (with ones along the diagonal and zeros eve The ''transpose'' of a matrix (denoted <math>M^\top</math>) is the matrix you get when you reflect all the entries about t

14 KB (2,245 words) - 03:01, 11 April 2015
Euler problems/71 to 80
triangs = [p | n <- [2 .. 1000], m <- [1 .. n - 1], odd (m + n), m `gcd` n == 1, let p = 2 * (n ^ 2 + m * n), p <= limit]

7 KB (972 words) - 02:57, 3 May 2015
Recursive function theory
...achieve something similar to currying, see [http://en.wikipedia.org/wiki/S-m-n_theorem Kleene's <math>s^m_n</math> theorem]). So using <math>f:A\times B For all <math>0\leq i<m</math>:

13 KB (2,068 words) - 23:19, 3 June 2019
Cookbook/Other data structures
editDistance xs ys = table ! (m,n) (m,n) = (length xs, length ys)

4 KB (640 words) - 21:05, 6 January 2019
99 questions/31 to 41
..."border-bottom:1px solid #eee">(**) Calculate Euler's totient function phi(m). [[99 questions/Solutions/34|Solutions]]< ...ined as the number of positive integers r (1 <= r < m) that are coprime to m.

6 KB (805 words) - 02:30, 11 June 2023
Exception
newtype ExceptionalT e m a = ExceptionalT {runExceptionalT :: m (Exceptional e a)}

10 KB (1,404 words) - 06:22, 22 January 2020
Xmonad/Using xmonad in LXDE
I'm assuming you are using <tt>lxsession</tt> to start LXDE.

835 bytes (122 words) - 19:31, 28 January 2016
BayHac2014/Prolog
...e</hask>. This is just a little helper function that takes the two terms I'm unifying, updates them with the MGU so far and calls the actual case-by-cas Right now, the slides themselves are a little broken, so I'm not putting them up yet.

2 KB (410 words) - 11:26, 13 February 2019
Free structure
*** A set <math>M</math> *** An identity <math>e \in M</math>

13 KB (2,245 words) - 15:18, 6 February 2021
Conduit
.../user/snoyberg/library-documentation/conduit-overview Conduit overview] by M. Snoyman

1 KB (138 words) - 02:42, 13 July 2019
99 questions/Solutions/67A
stringToTree :: (Monad m) => String -> m (Tree Char)

2 KB (372 words) - 03:43, 10 January 2017
Output/Input
type M a = OI -> a unit :: a -> M a

8 KB (1,236 words) - 12:36, 1 January 2024
The Monad.Reader/Discuss Issue11/FingerTreeIMap
lookup :: (Monad m, Ord t, Monoid v) => t -> IMap t v -> m v

2 KB (315 words) - 15:19, 6 February 2021
HDBC-ODBC under Windows
Prelude> :m Database.HDBC Prelude Database.HDBC> :m + Database.HDBC.ODBC

2 KB (286 words) - 08:45, 23 May 2021
Benchmarks Game/Parallel/BinaryTrees
mapM_ (\((m,d,i)) -> io (show m ++ "\t trees") d i) vs depth d m

6 KB (1,055 words) - 23:27, 18 April 2020
Euler problems/61 to 70
poly m = [(n, x) | (n, x) <- zip [1..] $ takeWhile (<10000) $ scanl (+) 1 [m-1,2*m-3..],

6 KB (979 words) - 10:20, 18 May 2022
Tiny Identifier Dictionary
| n,m | m

2 KB (285 words) - 01:34, 14 July 2021
Monads as containers
...d method, ''return'', is specific to monads. If <code style="color:indigo">m</code> is a monad, then ...>a</code>, and gives a container of type <code>(m a)</code>

18 KB (3,270 words) - 05:36, 9 March 2021
Research papers/Authors
*[https://scholar.google.com/citations?user=w6XYY_EAAAAJ Manuel M. T. Chakravarty] ==M==

8 KB (1,251 words) - 05:43, 1 September 2022
SceneGraph
type OSGT m = (StateT OSGState m) (<+>) :: Monad m => OSGT m SceneNode -> OSGT m SceneNode -> OSGT m SceneNode

6 KB (988 words) - 04:52, 26 April 2021
Euler problems/1 to 10
triplets l = [[a,b,c] | m <- [2..limit], n <- [1..(m-1)],

6 KB (881 words) - 02:31, 8 May 2016
Monad
class Monad m where (>>=) :: m a -> ( a -> m b) -> m b

13 KB (1,870 words) - 11:14, 22 October 2022
Bluetile
I'm passionate about bringing the paradigm of tiled window management to a wide ==I'm having trouble installing Bluetile - any walkthrough available?==

5 KB (770 words) - 23:20, 11 July 2021
Xmonad/Config archive/nomeata’s xmonad.hs
import qualified Data.Map as M myKeys conf@(XConfig {XMonad.modMask = modMask}) = M.fromList $

7 KB (748 words) - 15:19, 6 February 2021
99 questions/21 to 28
...tom:1px solid #eee">Lotto: Draw N different random numbers from the set 1..M. [[99 questions/Solutions/24|Solutions]]</ * (lsort '((a b c) (d e) (f g h) (d e) (i j k l) (m n) (o)))

6 KB (890 words) - 05:51, 10 June 2023
99 questions/Solutions/31
isPrime n = all ((/=0) . mod n) $ takeWhile (<= m) candidates m = floor . sqrt $ fromIntegral n

3 KB (432 words) - 07:06, 11 May 2016
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
Xmonad/Config archive/thoughtpolice's xmobarrc
, Run Date "%a %b %_d %Y %H:%M:%S" "date" 10

1,023 bytes (104 words) - 15:18, 6 February 2021
Kind
newtype StateT s m a :: * -> (* -> *) -> * -> *

2 KB (234 words) - 19:05, 28 September 2017
Yi/FAQ
M = Meta = Alt|Esc |M-f

9 KB (1,413 words) - 00:17, 24 November 2014
UrlDisp
((h |/ "db" *> m) <|> output "not found")) m :: UrlDisp (ReaderT Connection (CGIT IO)) CGIResult

4 KB (592 words) - 21:17, 29 June 2021
Foldable and Traversable
zipWithTFM :: (Traversable t,Foldable f,Monad m) => (a -> b -> m c) -> t a -> f b -> m (t c)

11 KB (1,895 words) - 19:00, 18 May 2020
Euler problems/31 to 40
factor m (p:ps) | p*p > m = [m] | m `mod` p == 0 = p : factor (m `div` p) (p:ps)

11 KB (1,557 words) - 09:03, 19 September 2014
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
Physical units
...ut modeling units (seconds, meters, meters per second, etc) in Haskell? I'm particularly interested in getting the typechecker to verify proper usage, ...can't see a good way of handling it without forcing a choice of basis. I'm also not sure how it would work -- the whole point of GA is to incorporate

3 KB (521 words) - 07:04, 13 September 2016

Search results

Navigation menu

Search