Re: [Haskell-cafe] what does ' mean?

the xs' is just a variable as xs,xs_, _xs. perhaps imply some relations with the counterpart without apostrophe suffix,but this is not mandatory. - Original Message - From: "Logesh Pillay" <[EMAIL PROTECTED]> To: Sent: Monday, July 18, 2005 3:37 AM Subject: [Haskell-cafe] what does ' mea

Re: [Haskell-cafe] IO platform for testing

Matej 'Yin' Gagyi <[EMAIL PROTECTED]> writes: (snip) >>>Please, send me somethung like this (I need to understand it). I need >>>runing more s and with various argument counts and types. All >>>functions "in a bundle" should be in one file. >>> >> > I need a module Main. So, when I write some func

[Haskell-cafe] Re: [Haskell] Re: A MonadPlusT with fair operations and pruning

G'day all. (Moving the discussion to haskell-cafe.) Quoting [EMAIL PROTECTED]: > The last statement should probably be `return (otherState w,b')', > right? Yes, I think so. > mif (mif c t' e') t e > translates to > > ((X=1 ; X=2) *-> X=1 ; fail) *-> true; true. Using the predicate: test(X)

Re: [Haskell-cafe] flushing trace debug output before getting other output

On Sun, 2005-07-17 at 04:46 +, Terrence Brannon wrote: > When I remove my various trace statements, I get what I want: > > *Main> printPicture $ superimposeImage imgA imgB > > > > > ...##... > > So the question is, h

Re: [Haskell-cafe] IO platform for testing

Hi there, > There are some other, minor problems -- for indexing you need ss!!0, the > name m01_mod, and you may need an 'import' to make getArgs visible. yup, and you have to get rid of the two "do"s in the application of putStrLn. Regards, Frank-Andre Riess

Re: [Haskell-cafe] what does ' mean?

Logesh Pillay wrote: > I found the following code on the web > > /-- Andrew Bromage > / > /-- If you're doing permutations, then I suppose you want this too: > //-- (subLists might be a more suggestive name) > /combinations *:: [a] -> [[a]] > *combinations [] = [[]] > combinations (x:xs) >= co

Re: [Haskell-cafe] what does ' mean?

Logesh Pillay <[EMAIL PROTECTED]> wrote: > Dear list > > A v. newbie question. > > I found the following code on the web > > /-- Andrew Bromage > / > /-- If you're doing permutations, then I suppose you want this too: > //-- (subLists might be a more suggestive name) > /combinations *:: [a] -> [

[Haskell-cafe] what does ' mean?

Dear list A v. newbie question. I found the following code on the web /-- Andrew Bromage / /-- If you're doing permutations, then I suppose you want this too: //-- (subLists might be a more suggestive name) /combinations *:: [a] -> [[a]] *combinations [] = [[]] combinations (x:xs) = combinat

Re: [Haskell-cafe] Re: Lists vs. Monads

[EMAIL PROTECTED] wrote: > Jonathan Cast wrote: > > No. You can't define most initial models without recursive (or > > inductive) data types in general, because initial models are defined > > inductively. > > You can't define head, tail, or foldr using the MonadPlus signature > > (how

Re: [Haskell-cafe] IO platform for testing

Isaac Jones wrote: yin <[EMAIL PROTECTED]> writes: ./bundle01... I more apoarches, but no one worked. Now I tried this: m01_mod :: Int -> Int -> Int What's m01? You define b01 below: oops! "m01" propably is a halucination of my keyboard :) main = do (cmd:ss) <- getA