#apache #archlinux #asterisk #centos #debian #gentoo #haskell #kde #kubuntu #lisp #math #mysql #perl #python #ruby-lang #rubyonrails #suse #ubuntu #vim #wikipedia 0 1 2 3 4 5 6 7 8 9 10 11
Top Prev 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 Next
#haskell
<lambdabot> Continuation \Con*tin`u*a"tion\, n. [L. continuatio: cf. F.
<lambdabot> connuation.]
<lambdabot> 1. That act or state of continuing; the state of being
<lambdabot> continued; uninterrupted extension or succession;
<lambdabot> [159 @more lines]
<witten> sorear: okay I didn't realize that either
<chessguy> wow, that's a big dictionary entry
<witten> sorear: what's ST stand for?
<sorear> witten: eg. haskell's gmp binding sucks because it never uses the inplace operations, only the make-a-new-number ones.
<sorear> witten: STate
<witten> ok, that's what I thought
<sorear> witten: or State Thread
<witten> ahh
<sorear> witten: it's IO (mutable arrays and all that), but with a nasty typesystem trick that makes unsafePerformIO perfectly safe (called runST)
<glguy> sorear: is that generally necessary because of immutable variables?
<chessguy> ?hoogle runState
<lambdabot> Control.Monad.State.runState :: State s a -> (s -> (a, s))
<lambdabot> Control.Monad.State.runStateT :: StateT s m a -> (s -> m (a, s))
<chessguy> ?hoogle evalState
<lambdabot> Control.Monad.State.evalState :: State s a -> s -> a
<lambdabot> Control.Monad.State.evalStateT :: Monad m => StateT s m a -> s -> m a
<witten> thanks all, for the answers
<witten> I'll look into this some more
<chessguy> i swear, i will never rember which of runState, evalState, and execState are which
<sorear> glguy: yes. if we had last use analysis ala clean's uts, we could use the (asymptotically faster in some cases) inplace operations.
<sjanssen> TSC: things seem to go much more quickly without the deriving(Eq,Show) for each data type
<sorear> anyway, I should be going to bed real soon.
<sjanssen> chessguy: join the club
<chessguy> ?hoogle **
<lambdabot> Prelude.(**) :: Floating a => a -> a -> a
<lambdabot> Control.Arrow.(***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')
<chessguy> ?instances Floating
<lambdabot> Double, Float
<sm> haddock is failing to resolve a bunch of imports and doing nothing useful
<sm> how can I tempt it to give me docs ?
<sm> a: it needs -h or similar
<chessguy> :r
<chessguy> bah
<chessguy> ?hoogle sum
<lambdabot> Prelude.sum :: Num a => [a] -> a
<lambdabot> Monad.msum :: MonadPlus a => [a b] -> a b
<lambdabot> Control.Monad.msum :: MonadPlus m => [m a] -> m a
<chessguy> @pl t p f = s $ m (fi p) f
<lambdabot> t = (s .) . m . fi
<nrb23> hmm, I'm experimenting with GetOpt
<nrb23> and I'm having trouble determing a good way to tell if two conflicting options are passe
<nrb23> *passed
<nrb23> is there a good way to pattern match against a consructor without writing a large case statement?
<Azmo> nrb23: why is the case statement large if yuo only need to match against one constructor?
<nrb23> it's not large
Previous Page Next Page