- Haskell-Cafe - Haskell.org

Re: www.haskell.org -> applications -> HWS-WP
by Benjamin Franksen 02 Nov '04

02 Nov '04

On Tuesday 02 November 2004 11:53, you wrote: > Benjamin Franksen wrote: > >The Haskell Web Server with Plugins is not easily found if one only has > > the link to the sourceforge announcement. Maybe a link to the home page > > http://www.mdstud.chalmers.se/~md9ms/hws-wp/ would be nice? > > > >Cheers, > >Ben > > Cheers, > > I added the link (although I wonder for how long it will survive, > belonging to a student login). The tar ball seems to have vanished already. Do you guys have any idea where to get the sources for the HWS (with or without plugins)? Ben

2 1

RE: [Haskell-cafe] Newbie Question on type constructors
by Brian Beckman 02 Nov '04

02 Nov '04

Most interesting discussion -- in reading it, I realized that I had a 'hidden agenda' in asking my question (hidden even from myself), and that is: can I put interesting functionality, like precondition checks & data validation, in data constructors? I suspect not, and that's why I tend to write something like the following: data Shape = Circle Float | Square Float deriving (Eq, Show) circle :: Float -> Shape circle x = if (x <= 0) then error "Bad radius!" else Circle x That's fine, but I don't know how to prevent users from calling "Circle" directly (in some other languages, I could declare the raw constructor to be "private", and, in Haskell, there may be some way for me to hack module exports to hide the raw constructor, but I haven't seen a way to do that). In any event, it might be useful if I could have some pattern to prevent circumvention of initialization code. Advice? -----Original Message----- From: haskell-cafe-bounces(a)haskell.org [mailto:haskell-cafe-bounces@haskell.org] On Behalf Of Ben Rudiak-Gould Sent: Monday, November 01, 2004 11:33 AM To: finnw(a)iname.com Cc: haskell-cafe(a)haskell.org Subject: Re: [Haskell-cafe] Newbie Question on type constructors Finn Wilcox wrote: >On Mon, 1 Nov 2004, Ben Rudiak-Gould wrote: > >>In particular, one cannot write an invert :: (a->b) -> Maybe >>(b->a) which never returns a wrong answer, except for invert = const >>Nothing > >How about: > >invert = undefined > >This never returns an answer at all, so it can't return a wrong one! Sorry, I should have been clearer: my Nothing return was intended to mean "I don't know an answer", not "there is no answer". So my const Nothing is like your undefined, a function which never returns an answer (and thus never returns a wrong one). -- Ben _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

7 11

RE: [Haskell-cafe] Re: Processing of large files
by Bayley, Alistair 02 Nov '04

02 Nov '04

> From: Alexander Kogan [mailto:alexander@kogan.nnov.ru] > > But I wonder why the very useful function foldl' as I define > it is not > included into Prelude? I think, many people work with large lists or > streams... It's in Data.List: <http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data.List.html#v %3Afoldl'> ----------------------------------------- ***************************************************************** 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

Re: [Haskell-cafe] Newbie Question on type constructors
by Antonio Regidor García 02 Nov '04

02 Nov '04

Interesting discussion. I'm still learning Haskell and I also thought about the difference between constructors and functions time ago. I don't think the question about what a constructor really IS is meaningful. It can be can be thought as a label, a special function, ... wathever is more useful in each context or to each person. For me, the main diference between constructors and Haskell functions is that constructors are never evaluated. A program will never simplify "Circle 5", but does simplify "factorial 5" to "5 * factorial 4" and so on, until there are only a numeric literal (a constructor, indeed). So constructors can be tought as some kind of "primitive functions" that can't be evaluated, or blocks to construct "primitive expressions" (literals) that can't be further simplified. Antonio Regidor García ______________________________________________ Renovamos el Correo Yahoo!: ¡100 MB GRATIS! Nuevos servicios, más seguridad http://correo.yahoo.es

1 0

Calling Haskell from .Net Environment
by David Lo 01 Nov '04

01 Nov '04

Dear all, Vincenzo, thank you for your reply and advice. I'll take a look on xmlrpc. I've heard of hugs98 for .Net. Anyone has ever tried to call haskell from .Net using it ? Please kindly advise, since one example provided in the sample is Haskell -> .Net -> Haskell, while I require .Net -> Haskell. When I tried to modify the sample (maybe I modify wrongly), I find that the I'm unable to load new haskell file (when referencing hugsscript.dll from .Net) or BadImageFileFormat exception (when referencing hugs.exe from .Net). Thank you in advance for your help and attention. Best Regards, David Lo On Friday 29 October 2004 03:48, David Lo wrote: > Dear all, > > I'm new in Haskell. I need to port a haskell application written by > someone else to be called by a .Net C# application. Please kindly > advise on which option to pursue. Any helps will really be > appreciated. The easiest path I know would be to use xmlrpc, (or perhaps soap if you know it - but I am unsure of availability of the latter for haskell, you might check the www.haskell.org website). Bye Vincenzo

3 2

Problems with HaXml
by Tom Spencer 31 Oct '04

31 Oct '04

Hi, I thought i had successfully installed HaXml, ghci loads up the package successfully etc. but then it complains that it can't find XmlLib. Using -v i get the following: Prelude> :load iChing.hs *** Chasing dependencies: iChing.hs: Can't find module `XmlLib' locations searched: XmlLib.hs XmlLib.lhs /usr/lib/ghc-6.2.1/imports/XmlLib.hi /usr/lib/ghc-6.2.1/imports/HaXml/XmlLib.hi /usr/lib/ghc-6.2.1/hslibs-imports/data/XmlLib.hi /usr/lib/ghc-6.2.1/hslibs-imports/util/XmlLib.hi /usr/lib/ghc-6.2.1/hslibs-imports/posix/XmlLib.hi /usr/lib/ghc-6.2.1/hslibs-imports/concurrent/XmlLib.hi /usr/lib/ghc-6.2.1/hslibs-imports/lang/XmlLib.hi i ran the install script again to see what was happening and noticed this line at the end of the install script: warning: can't find GHCi lib `HSHaXml.o' Saving old package config file... done. Writing new package config file... done. make[1]: Leaving directory `/usr/local/bin/HaXml-1.12/obj/ghc' it doesn't seem to work in ghc or hugs either any ideas? Thanks in advance Tom Spencer P.S. apologies if i've accidentally posted this twice

1 0

Re: [Haskell-cafe] Set of reals...?
by MR K P SCHUPKE 30 Oct '04

30 Oct '04

>Double already has +Inf and -Inf; it's just that Haskell doesn't have >(AFAIK) syntax to write them as constants. In the source for the GHC libraries it uses 1/0 for +Infinity and -1/0 for -Infinity, so I assume these are the "official" way to do it. Personally I would define nicer names: positiveInfinity :: Double positiveInfinity = 1/0 negativeInfinity :: Double negativeInfinity = -1/0 Keean.

3 2

Set of reals...?
by Stijn De Saeger 30 Oct '04

30 Oct '04

Hi all, I'm new to this list, as well as to haskell, so this question probably has "newbie" written all over it. I'm thinking of a way to represent a set of reals, say the reals between 0.0 and 1.0. Right now I am just using a pair of Float to represent the lower and upper bounds of the set, but i have this dark throbbing feeling that there should be a more haskellish way to do this, using laziness. List comprehensions are out it seems, because they increment with integer steps... (obviously). In other words, 0.5 `inSet` (Set [0.0..1.0]) returns False. I'm sure someone must have hit this problem before me and found a way around it. any suggestions greatly appreciated, regards, stijn.

11 24

RE: [Haskell-cafe] Set of reals...?
by Brian Beckman 29 Oct '04

29 Oct '04

Very pretty, Keean, though to get it to work in Hugs Nov 2002 I had to type the following uglier but equivalent syntax > myInterval = Interval { > isin = (\r -> > if r == 0.6 then True else > if r > 0.7 && r < 1.0 then True else > False ) > } -----Original Message----- From: haskell-cafe-bounces(a)haskell.org [mailto:haskell-cafe-bounces@haskell.org] On Behalf Of Keean Schupke Sent: Wednesday, October 27, 2004 3:53 AM To: Stijn De Saeger Cc: haskell-cafe(a)haskell.org Subject: Re: [Haskell-cafe] Set of reals...? I think someone else mentioned using functions earlier, rather than a datatype why not define: data Interval = Interval { isin :: Float -> Bool } Then each range becomes a function definition, for example: myInterval = Interval { isin r | r == 0.6 = True | r > 0.7 && r < 1.0 = True | otherwise = False } Then you can test with: (isin myInterval 0.6) Keean _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

hugs segmentation fault
by Andrej Bauer 29 Oct '04

29 Oct '04

Hi, I am new to haskell, but otherwise experienced in programming languages. My first attempt at Haskell was this (on a Linux Debian) session with hugs: Type :? for help Prelude> :version -- Hugs Version November 2003 Prelude> let p = 1 : [2 * x | x <- p, x < 1] in p [1Segmentation fault Is it the norm for hugs to dump core like this? Or was I just very lucky to discover a bug? Best regards, Andrej

6 8