AW: [Haskell] Hugs Nov2003 X Nov2002

Title: Nachricht try   fromInt = fromInteger . toInteger   Markus   -- Markus Schnell -Ursprüngliche Nachricht-Von: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] Im Auftrag von StenioGesendet: Dienstag, 16. März 2004 10:29An: Ketil MaldeCc: [EMAIL PROTECTED]Betreff: Re

AW: Generic Haskell Diffs?

Thank you, Ralf. Curiosity satisfied. :) Markus -- Markus Schnell > There is just one Generic Haskell project > even though the actual language extension is a moving target of course > because this is an active project. > > The boilerplate approach is about lightweight generic

AW: Generic Haskell Diffs?

th at the same time? > Is one building on the other? > Are there adressing different issues? > > A clarifying sentence or two would be heartily welcome. > > Cheers, > Markus > > > -- > Markus Schnell > __

Generic Haskell Diffs?

r two would be heartily welcome. Cheers, Markus -- Markus Schnell ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

AW: access to fields in nested records

There is updateable syntax. You can write > setSquare :: DiningRoom -> Int -> DiningRoom > setSquarer n = r { square = n } HTH, Markus > -Ursprüngliche Nachricht- > Von: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] Im Auftrag von Se

AW: Boilerplate revisited

egemnt = Comp [Segment] Attributes and 'everywhere (mkT f) seg' would also jump into the attributes, which is waisted effort. -- Markus ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Boilerplate revisited

g a lot of time in the segmap function, while using a self-written map on the structure was much faster. I didn't keep records, though. Perhaps the boilerplate people (Ralf Lämmel, Simon PJ) have already looked at performance issues? If you stayed with me, thank you for your time. Ma

AW: Need some help please

Title: Nachricht If you post some of your tries, we could give you specific tips.   -- Markus Schnell    -Ursprüngliche Nachricht-Von: Rajiv Patel [mailto:[EMAIL PROTECTED] Gesendet: Mittwoch, 27. August 2003 16:09An: [EMAIL PROTECTED]Betreff: Need some help please Hi

AW: container for different types, avoiding boiler plate

. Before I use your code, I have to understand it - this may take a while... :) But I'm not sure if it's suitable for what I'm doing, as the attributes get inserted at run time, and not all of them appear everywhere. So Maybe is quite natural here. Markus

Re: container for different types, avoiding boiler plate

; gnumber = gattr :: GetAttr Number which already is much more readable. But I'm sure problems are just around the corner ... Thank you. Markus ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

container for different types, avoiding boiler plate

ttr ((Cat c):) -- set value > > gcat :: Segment -> Maybe Cat-- get value > gcat = deCat . gattr TypeCat . attrs > where deCat (Just (Cat c)) = c > deCat x = x > ... Does anyone have some suggestions for making this more concise? Generic Haskell

Suffix Tree

Does anybody know of a suffix tree implementation for Haskell? Are there algorithms for a (lazy) functional setting? My reference is Dan Gusfield: "Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology". Thanks, Markus -- Markus Schnell Infineon Te

RE: problems with working with Handles

utStr handle2 (inputtext ++ " extra") > > handle3 <- openFileEx outputfile (BinaryMode ReadMode) > inputtext2 <- hGetContents handle3 > handle4 <- openFileEx outputfile (BinaryMode WriteMode) > hPutStr handle4 (input

RE: forall quantifier

Yes, this would work, thanks. But let me extent my question: what if all the types would be in a class FakeClass which has function specialID :: a -> ID and I would like to do > foo $ map specialID [a,b,c,d] ? ___ Haskell mailing list [EMAIL PROTECTED]

RE: forall quantifier

ially with long lists. Is there a nice solution? Markus ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

AW: AW: simulating dynamic dispatch

Thanks! These examples and counterexamples help a lot in understanding. Markus > The reason is that sum only works on integer lists, whereas the given > type for fun requires that the first argument be a function that works > on lists of any type, such as length. > If sum wer

AW: simulating dynamic dispatch

tells me: ERROR - Use of fun requires at least 1 argument Why that? At least I have explicitely specified the type. Markus > One may want: > > fun f x y = f x + f y > > for instance: > > fun length [True, False] [1,2] > > Therefore, I would say, you need typing a

AW: simulating dynamic dispatch

ing the forall. What does it do? How do I have to read a type definition with foralls? Or more concrete: What is the difference between (forall b. Term b => b -> b) -> a -> a and (Term b) => (b -> b) -> a -> a ? Markus ___

Scrap your Boilerplate

Does the "zipper" fall into this category? http://haskell.org/wiki/wiki?TheZipper Markus > You might also find the 'cast' function in Section 3 of "Scrap your > boilerplate" useful. > http://research.microsoft.com/~simonpj/papers/hmap/ > I'm n

simulating dynamic dispatch

I think you are looking like something done in the HTML-Combinator-libraries. I tried something like that some time ago, but didn't finish. But perhaps you can get an idea from that. See the files with this mail. (The code is in unknown condition.) Markus > ah, yes. i was aware that wo

haskell cocoa integration

I put some points together of how one can integrate Haskell with a Mac OS X Cocoa application: http://www.markusschnell.com/cocoa_howto.html Perhaps some Mac-Users can comment on it. Thanks, Markus -- Markus Schnell

Random Permutations

tl) : permute gen' (hd ++ tail tl) >where (idx, gen') = randomR (0,length xs - 1) gen > (hd, tl) = splitAt idx xs Markus -- Markus Schnell, Infineon Technologies AG ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

AW: Parsec: GHC /= Hugs?

> Try the November release of Hugs with the +N option. Well, now Hugs and ghc show the same behaviour for my program: they don't parse my doc, even with the same error. But the +N does not work: it says "New hierarchical libraries not found along search path; ignoring +N toggle." I tried adding

Parsec: GHC /= Hugs?

: how do I avoid writing different Code for Hugs and ghc? For example, I had to hide "Word" in Hugs with > import Prelude hiding (Word) but was not allowed to do that with ghc. I ended up using "Wort". Why the difference? Markus

AW: GUI for Windows

Thanks, Axel, Daan, I will have a try with ObjectIO. (At least the examples work ;-)) Markus ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

GUI for Windows

;t compile). Any ideas, suggestions? Markus ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

ANNOUNCE: haskell modules

pment versions for your programs. Have a look at it, comments (or better versions) are welcome. Markus -- Markus Schnell ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

AW: Binary I/O in haskell.

e possible purely in Haskell with the Binary module, but I never was sure which of the many was working on my Mac. So I didn't really try. (Can anybody comment on that?) Markus -Ursprüngliche Nachricht- Von: Immanuel Litzroth [mailto:[EMAIL PROTECTED]] Gesendet am: Montag, 27. Janua

Mathematics and Software Engineering (was slide: useful function? )

of its practitioners, which, > contrary to some opinions, I think is a Good Thing. I'm fully with you there, but - as someone already pointed out - I don't want to need a math major to read a paper regarding programming. This doesn't mean there is something wrong with these pape

AW: slide: useful function?

t; 3, pp 99-110. Intellect, > Bristol / Portland, OR, 2002. - .ps.gz, 46K (© Intellect) > > http://www.cs.ioc.ee/~tarmo/papers/sfp01-book.ps.gz , > > if you want to be bothered with categorical nonsence ;-) There's too much mathematics in it, I'm only an engineer..

slide: useful function?

lowpass = firfilter [0.005178,0.005712,0.00589,0.005712,0.005178] firfilter :: [Coeff] -> DigitalFilter firfilter b = slide (firfilter' b) where firfilter' b = sum . zipWith (*) b What do you think? Or is there already a function slide, just with another name? Markus -- Ma

Feature Structures

Has anybody tried to implement (typed) feature structures in Haskell with unification? I'm trying to build my own library, but if there is already support for it, I would consider using this alternative. Thanks, Markus -- Markus Schnell Speech Interface Group, Infineon Technologies AG

ghc MacOS X 10.2 behaviour

/ghc-5.04/include/RtsAPI.h:125: previous declaration of 'GHCziTopHandler_runIO_closure'" Using ghci or compiling with -O2 doesn't show this error. Any ideas what's wrong? Thanks, Markus By the way, if there is a list more suited for the subject, please tell me. _

question on type classes

etter way, than to copy the instance declaration of FooList for every a in that is in class Foo? Thanks for any hint, Markus -- Markus Lauer <[EMAIL PROTECTED]> ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

CfP ALP/PLILP'95

ny) Jan Maluszynski (Sweden) Erik Meijer (Netherlands) Dale Miller (USA) Masaki Murakami (Japan) Rinus Plasmeijer (Netherlands) Laurence Puel (France) Gert Smolka (Germany) Doaitse Swierstra (Netherlands, Co-Chair) Pascal van Hentenryck (USA) Organizing Committee: ----- Michael Hanus