- Haskell-Cafe - Haskell.org

RE: [Haskell-cafe] Building Haddock on Windows
by Bayley, Alistair 17 Mar '04

17 Mar '04

http://www.haskell.org/haddock/docs/haddock.html Ahh, sorry, somehow I missed that. Yes, that is the html generated from the sqml. > -----Original Message----- > From: Arjan van IJzendoorn [mailto:afie@cs.uu.nl] > Sent: 17 March 2004 14:00 > To: Bayley, Alistair > Cc: haskell-cafe(a)haskell.org > Subject: Re: [Haskell-cafe] Building Haddock on Windows > > > Hello Alistair, > > > Where can I find instructions for use? I see haddock.sgml in > > haddock-0.6/haddock/doc but reading sgml hurts. Is there an > html version > of > > this somewhere? > > Haddock is very well documented at http://www.haskell.org/haddock/ > > Greetings, Arjan ----------------------------------------- ***************************************************************** Confidentiality Note: The information contained in this message, and any attachments, may contain confidential and/or privileged material. It is intended solely for the person(s) or entity to which it is addressed. Any review, retransmission, dissemination, or taking of any action in reliance upon this information by persons or entities other than the intended recipient(s) is prohibited. If you received this in error, please contact the sender and delete the material from any computer. *****************************************************************

1 0

RE: [Haskell-cafe] Building Haddock on Windows
by Bayley, Alistair 17 Mar '04

17 Mar '04

Got it built after realising that my PATH didn't include ghc (thanks Andy Moran). I renamed haddock.bin to haddock.exe and copied to into ghc's bin for convenience (ghc's bin is already in my path). Now I just have to figure out how to invoke it... Where can I find instructions for use? I see haddock.sgml in haddock-0.6/haddock/doc but reading sgml hurts. Is there an html version of this somewhere? I have a few questions: - can you invoke it on a folder and have it generate docs for all of the source files in it (and sub-folders)? - does it work on .lhs source containing bird-track style code? It would appear not, as I get a parse error. - why doesn't it know what Int, String, Float, IO, Monad, Show, etc are? What invocation option do I need to ensure it links to Prelude/hierarchical-library stuff? (I think it's --read-interface; must I generate interface files for the Prelude and libraries though?) Thanks, Alistair. > -----Original Message----- > From: Simon Marlow [mailto:simonmar@microsoft.com] > Sent: 17 March 2004 13:22 > To: Bayley, Alistair; haskell-cafe(a)haskell.org > Subject: RE: [Haskell-cafe] Building Haddock on Windows > > > > > Has anyone recently built Haddock on Windows? I'm invoking > > configure and > > make from Cygwin bash. Configure takes a couple of hours, and > > then make produces a load of errors (see below). > > I'm ashamed to say that Haddock, like Alex and Happy don't really > support native Windows too well. > > You can use them in a Cygwin (and possibly MSYS) environment, by doing > the usual ./configure && make install, which will install the tool by > default in /usr/local/bin. > > Cheers, > Simon ----------------------------------------- ***************************************************************** Confidentiality Note: The information contained in this message, and any attachments, may contain confidential and/or privileged material. It is intended solely for the person(s) or entity to which it is addressed. Any review, retransmission, dissemination, or taking of any action in reliance upon this information by persons or entities other than the intended recipient(s) is prohibited. If you received this in error, please contact the sender and delete the material from any computer. *****************************************************************

2 1

infix naming
by David Roundy 17 Mar '04

17 Mar '04

[moving to haskell-cafe due to an extreme shift in topic] On Wed, Mar 17, 2004 at 08:55:22AM +0100, Ketil Malde wrote: > > So it is agreed: we use "isXXXX" :-) > > Hmm... > > s1 `isSubsetOf` s2 vs s1 `isSubset` s2 > isSubsetOf s1 s2 isSubset s1 s2 > > I'm not sure I have any clear preference. ..Of reads slightly clearer > in infix notation, but is arguably a bit more confusing in prefix. This seems to be a common problem: a name that makes sense (i.e. it is obvious what it does) in prefix notation very often is completely wrong in infix notation, particularly when partially applied. "e `isElementOf` list" makes perfect sense, while "isElementOf e list" seems a bit wrong, and "isElementOf e" (of type [a] -> Bool) reads completely wrong. I guess "`isElementOf` list" (which is of type a -> Bool) does make sense. I guess perhaps names just have be chosen to either make sense in infix notation, or in prefix notation, but not both? Is this a general principle, and if so, that seems bad, since the choice of infix vs prefix notation seems like it shouldn't have to be made at the API level. Does anyone know why it was originally decided to make infix notation work as it does? To me it seems like it would make sense for (`f` x) to be the same as (f x) rather than the opposite. e.g. (`is_less_than` 2) and (is_less_than 2) sound the same way when I pronounce them, and it's not entirely pleasant that the second one is in fact the same as (>= 2). On the other hand, if you don't think of it as (is_less_than a) b, one might naturally think that (is_less_than a b) should be (a < b). -- David Roundy http://www.abridgegame.org

1 0

2-CNF Sat algorithm/haskell code
by Ron de Bruijn 17 Mar '04

17 Mar '04

Dear Haskellers, Today I searched over more than an hour on the web to find an implementation of an algorithm that was first written in the 1970's that solves 2-Conjuntive Normal Form logical sentences in polynomial time. The only thing I could find were some homework assignments for students of universities and I learned that there exist an algoritm for 2-CNF. Although I am a student, what I am doing is no homework. I believe the datastructure used was a strongly connected graph (perhaps this rings any bells). If you don't know any implementation in any imperative language or functional language (not to far off when compared to Haskell), a clear pseudo-code description, either written by yourself or a URL to a webpage/paper with that information would also be very welcome. Thanks in advance, Ron de Bruijn P.S. This is really offtopic, but I would like to hear some opinions about this project: http://www.supercompilers.com/ I don't know whether they are for real, but when this works it would greatly impacts the use of inefficient functional programs(when applied to it ofcourse). Like in Haskell, a lot of programs could be written like: [x|x<-someList, somePred x] Although they computationally seen would be very slow, without "supercompilation", with they would perform just as good as some smart way of doing it. __________________________________ Do you Yahoo!? Yahoo! Mail - More reliable, more storage, less spam http://mail.yahoo.com

2 1

Building Haddock on Windows
by Bayley, Alistair 17 Mar '04

17 Mar '04

Has anyone recently built Haddock on Windows? I'm invoking configure and make from Cygwin bash. Configure takes a couple of hours, and then make produces a load of errors (see below). If anyone has a ready-made .exe I'd be happy to use that. I just want to use Haddock, not modify it. Alistair. ---- output from make: [All appears ok up to this point] make[1]: Leaving directory `/cygdrive/h/haskell/haddock-0.6/glafp-utils' make[1]: Entering directory `/cygdrive/h/haskell/haddock-0.6/haddock' ------------------------------------------------------------------------ ===fptools== Recursively making `boot' in src html doc ... PWD = /cygdrive/h/haskell/haddock-0.6/haddock ------------------------------------------------------------------------ ------------------------------------------------------------------------ ==fptools== make boot - --unix -wr; in /cygdrive/h/haskell/haddock-0.6/haddock/src ------------------------------------------------------------------------ test: 504: unknown operand M -optdep-f -optdep.depend -osuf o -H16m -O -package data -package text -package util -package net -fglasgow-exts -cpp Binary.hs BlockTable.hs Digraph.lhs FastMutInt.hs HaddockDB.hs HaddockHH.hs HaddockHtml.hs HaddockLex.hs HaddockModuleTree.hs HaddockParse.hs HaddockRename.hs HaddockTypes.hs HaddockUtil.hs HaddockVersion.hs HsLexer.lhs HsParseMonad.lhs HsParseUtils.lhs HsParser.hs HsSyn.lhs Html.hs Main.hs M: not found make[2]: [depend] Error 127 (ignored) ------------------------------------------------------------------------ ==fptools== make boot - --unix -wr; in /cygdrive/h/haskell/haddock-0.6/haddock/html ------------------------------------------------------------------------ ------------------------------------------------------------------------ ==fptools== make boot - --unix -wr; in /cygdrive/h/haskell/haddock-0.6/haddock/doc ------------------------------------------------------------------------ ------------------------------------------------------------------------ ===fptools== Finished making `boot' in src html doc ... PWD = /cygdrive/h/haskell/haddock-0.6/haddock ------------------------------------------------------------------------ make[1]: Leaving directory `/cygdrive/h/haskell/haddock-0.6/haddock' make[1]: Entering directory `/cygdrive/h/haskell/haddock-0.6/haddock' ------------------------------------------------------------------------ ===fptools== Recursively making `all' in src html doc ... PWD = /cygdrive/h/haskell/haddock-0.6/haddock ------------------------------------------------------------------------ ------------------------------------------------------------------------ ==fptools== make all - --unix -wr; in /cygdrive/h/haskell/haddock-0.6/haddock/src ------------------------------------------------------------------------ test: 504: unknown operand make INSTALLING=0 BIN_DIST=0 - --unix - --no-print-directory -r all test: 504: unknown operand H16m -O -package data -package text -package util -package net -fglasgow-exts -cpp -c Binary.hs -o Binary.o -ohi Binary.hi H16m: not found make[3]: [Binary.o] Error 127 (ignored) H16m -O -package data -package text -package util -package net -fglasgow-exts -cpp -c BlockTable.hs -o BlockTable.o -ohi BlockTable.hi H16m: not found make[3]: [BlockTable.o] Error 127 (ignored) H16m -O -package data -package text -package util -package net -fglasgow-exts -cpp -c Digraph.lhs -o Digraph.o -ohi Digraph.hi H16m: not found make[3]: [Digraph.o] Error 127 (ignored) [and it continues like this for a while...] ----------------------------------------- ***************************************************************** Confidentiality Note: The information contained in this message, and any attachments, may contain confidential and/or privileged material. It is intended solely for the person(s) or entity to which it is addressed. Any review, retransmission, dissemination, or taking of any action in reliance upon this information by persons or entities other than the intended recipient(s) is prohibited. If you received this in error, please contact the sender and delete the material from any computer. *****************************************************************

3 2

Haskell on Rotor CLI
by s_＠id.ru 16 Mar '04

16 Mar '04

Hi, All! Is there any project for running Haskell on the Rotor CLI? zelych --- Professional hosting for everyone - http://www.host.ru

1 0

AW: [Haskell-cafe] Haskell overview
by Markus.Schnell＠infineon.com 13 Mar '04

13 Mar '04

and for some days now Markus Schnell > -----Ursprüngliche Nachricht----- > Von: haskell-cafe-bounces(a)haskell.org > [mailto:haskell-cafe-bounces@haskell.org] Im Auftrag von Gour > Gesendet: Freitag, 12. März 2004 14:53 > An: haskell-cafe(a)haskell.org > Betreff: Re: [Haskell-cafe] Haskell overview > > > MR K P SCHUPKE (k.schupke(a)imperial.ac.uk) wrote: > > > Is it just me or is "citeseer.nj.nec.com" down? > > Same here :-( > > Sincerely, > Gour > > -- > Gour > gour(a)mail.inet.hr > Registered Linux User #278493 > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe >

2 1

Re: Polymorphic lists...
by MR K P SCHUPKE 12 Mar '04

12 Mar '04

Just running through the implementation of some of the functions I mentioned, with the newtyped tuple version. Thought the run-time indexed code looked neat so I thought i'd post it: First the definition: newtype RNil = RNil () newtype RCons attribute relation = RCons (attribute,relation) class Relation relation instance Relation (RNil ()) instance Relation relation => Relation (RCons attribute relation) emptyRM :: RNil emptyRM = RNil () now the code: class Relation r => IndexRM' r a where indexRM' :: r -> Int -> Maybe a instance IndexRM' RNil a where indexRM' _ _ = Nothing instance IndexRM' r a => IndexRM' (RCons a r) a where indexRM' (RCons (a,_)) 0 = Just a indexRM' (RCons (_,r)) n = indexRM' r (n-1) instance IndexRM' r a => IndexRM' (RCons b r) a where indexRM' (RCons (_,_)) 0 = Nothing indexRM' (RCons (_,r)) n = indexRM' r (n-1) This finds the Nth value where 'n' is a normal integer. The last block repeats twice because one matches the case where the return type is the same, and the other is for then the return type and indexed value differ. This is why the return type is Maybe. With the compile time natural number lookup, the program will fail to compile if the types differ, but with the runtime lookup the type and the success cannot be determined (hence no functional dependancy) and returning Maybe makes the most sense. Regards, Keean.

1 0

Re: [Haskell-cafe] Haskell overview
by MR K P SCHUPKE 12 Mar '04

12 Mar '04

Is it just me or is "citeseer.nj.nec.com" down? Keean.

3 2

Re: [Haskell-cafe] Passing types as arguments
by MR K P SCHUPKE 12 Mar '04

12 Mar '04

You can pattern match on types - as I have been having much fun with recently ... you use multi-parameter type classes (with optional functional dependancies) to match types. Regards, Keean.

1 0