- Haskell-Cafe - Haskell.org

Summer of Code idea: Haskell Web Toolkit
by Alejandro Serrano Mena 18 Mar '12

18 Mar '12

Hi, I'm really looking forward to helping in the Summer of Code, if Haskell goes into it this year (something I take for granted :). I would like to propose an idea for a project, and I'm looking for suggestions about whether it's good, should be improved or it's just unfeasible. My idea is to make a client-side Haskell Web Toolkit, in the spirit of Google Web Toolkit, which would allow to program in Haskell the client part of a web application, and would complement the web frameworks already existing for Haskell (such as Yesod and Snap). The point is coming about with a Haskell-ish way to program applications, to reuse all the existing knowledge for our beloved language. I've added more details in a pre-proposal in Google Docs, available in https://docs.google.com/document/d/1FnTNO9uTobDHRTDXWurKns7vGTjeauw0nRhbtt6… Tell me if you prefer to see it in other format, but I didn't want to generate a bigger e-mail. Thanks in advance.

10 16

We *have* been accepted into the Google Summer of Code
by Edward Kmett 18 Mar '12

18 Mar '12

Just to clarify, since I've been getting a ton of emails on the topic, we *have* been accepted to the Google Summer of Code this year. The list on their site is still updating, and we should appear there shortly. -Edward

3 3

cabal-install problem with alex dependency in bytestring-lexing
by Erik de Castro Lopo 17 Mar '12

17 Mar '12

Hi all, With a base system with just ghc and cabal-install, if I try to install bytestring-lexing I get: $ cabal install bytestring-lexing Resolving dependencies... Configuring bytestring-lexing-0.4.0... cabal: The program alex version >=2.3 is required but it could not be found. cabal: Error: some packages failed to install: bytestring-lexing-0.4.0 failed during the configure step. The exception was: ExitFailure 1 The cabal file for bytestring-lexing contains Build-Tools: alex >= 2.3 Is there any way to make the cabal install of bytestring-lexing force the install of alex first? Cheers, Erik -- ---------------------------------------------------------------------- Erik de Castro Lopo http://www.mega-nerd.com/

6 8

In an imperative language, commands & fulling memory cells is easy, but gives the false impression that S/W engineering is easy.
by KC 17 Mar '12

17 Mar '12

-- -- Regards, KC

3 2

In Haskell, because of the fine layers of abstraction that are possible, it pays to hone one's critical thinking skills.
by KC 17 Mar '12

17 Mar '12

-- -- Regards, KC

4 4

Theoretical question: are side effects necessary?
by Christopher Svanefalk 17 Mar '12

17 Mar '12

Dear all, there is a question I have been thinking about a bit. In short, we could simply formulate it like this: Are there any problems which *cannot *be solved a side effect-free language (such as Haskell)? In other words, are there problems that would explicitly demand semantics that can only be provided by a language allowing direct modification of external state variables, such as Java and C++? If not, are there problems which are simply *infeasible *to solve with a side effect-free language? I realize this question is very broad, and I am not expecting an exact answer by any means. I am asking since I am curious about the relation between functional and imperative/procedural languages in general. I primarily come from a Java background, but I can program Haskell and Erlang, and have recently started exploring Scala, so this would be interesting to know. -- Best, Christopher Svanefalk Student, Department of Computer Science and Engineering University of Gothenburg / Chalmers University of Technology

13 14

Re: [Haskell-cafe] Theoretical question: are side effects necessary?
by KC 17 Mar '12

17 Mar '12

On Fri, Mar 16, 2012 at 7:44 PM, Jerzy Karczmarczuk <jerzy.karczmarczuk(a)unicaen.fr> wrote: >... but the question of purity of a program - in my opinion - concerns the program, and nothing else. You might be thinking of software engineering purity. >The networking is not expected to break the referential transparency, or does it? > > > Jerzy Karczmarczuk > What does referential transparency mean to you? -- -- Regards, KC

3 3

Prettier pretty-printing of data types?
by Johan Tibell 17 Mar '12

17 Mar '12

Hi all, The derived Show instance is useful, but I sometimes wish for something that's easier to read for big data types. Does anyone have an implementation of show that draws things in a hierarchical manner? Example: Given data Tree a = Leaf | Bin Int a (Tree a) (Tree a) and value = Bin 1 (Bin 2 Leaf Leaf) (Bin 3 Leaf Leaf) draw as Bin 1 Bin 2 Leaf Leaf Bin 3 Leaf Leaf Cheers, Johan

11 11

A GSoC Proposal
by Kit Barnes 17 Mar '12

17 Mar '12

I have a proposal for a GSoC project that I wish to undertake. Is this a good place for me to begin discussing it? -- KitB

2 1

Re: [Haskell-cafe] Regular Expression with PCRE
by Carter Tazio Schonwald 17 Mar '12

17 Mar '12

There's a lot of reasons why I don't recommend that approach, but I think it's best explained by the following now classic stack overflow post and answer http://stackoverflow.com/questions/1732348/regex-match-open-tags-except-xht… Basically this applies in your case because recognizing if a sequence of characters is in a comment block or not for HTML is likely not expressible using regexes. There may be a way for a very controlled restricted subset of HTML, but it might require some complex regexes. That said, if you're ok with some false positives and dealing with that, a simple regex based solution is the way to go! Cheers, -- Carter Tazio Schonwald On Friday, March 16, 2012 at 7:08 PM, Joseph Bozeman wrote: > My goal is to remove the HTML comments. It probably would be at least as efficient to use an HTML parser, but I usually strip files by hand, and I always use regex then. I didn't want to bother importing yet another package, because if I could just get this line to work, I could get all my stripping done with three functions, and then I have four that I use to apply a template to the text once it's bare. > > On Fri, Mar 16, 2012 at 5:41 PM, Carter Tazio Schonwald <carter.schonwald(a)gmail.com (mailto:carter.schonwald@gmail.com)> wrote: > > have you considered using one of the many amazing HTML parsers on hackage? > > > > If the goal is to just get the HTML comments, that might be a much more effective use of your time > > > > -- > > Carter Tazio Schonwald > > > > > > On Friday, March 16, 2012 at 4:55 PM, Joseph Bozeman wrote: > > > > > > > > > Hey everyone, I'm hoping someone can point me in the right direction. > > > > > > The regex-pcre package exports (=~) and (=~~) as two useful infix functions. They're great! The only problem is, they are a positive match for a regex. I have a file that contains HTML comments (it was generated in Word) and I really just want the barest text. I already have a function that strips out all the tags, and I have a function that finds all the links and sticks those in another file for later perusal. > > > > > > What I'd like is advice on how to implement the (!~) and (!~~) operators. They should have the same types as (=~) and (=~~). I'm stuck, though. Here's the source for both of those functions: they depend on Text.Rege.PCRE package. > > > > > > (=~) :: (RegexMaker (http://hackage.haskell.org/packages/archive/regex-base/0.93.2/doc/html/Text…) Regex (http://hackage.haskell.org/packages/archive/regex-pcre/0.94.2/doc/html/Text…) CompOption (http://hackage.haskell.org/packages/archive/regex-pcre/0.94.2/doc/html/Text…) ExecOption (http://hackage.haskell.org/packages/archive/regex-pcre/0.94.2/doc/html/Text…) source, RegexContext (http://hackage.haskell.org/packages/archive/regex-base/0.93.2/doc/html/Text…) Regex (http://hackage.haskell.org/packages/archive/regex-pcre/0.94.2/doc/html/Text…) source1 target) => source1 -> source -> target > > > (=~) x r = let q :: Regex q = makeRegex r in match q x > > > > > > (=~~) :: (RegexMaker (http://hackage.haskell.org/packages/archive/regex-base/0.93.2/doc/html/Text…) Regex (http://hackage.haskell.org/packages/archive/regex-pcre/0.94.2/doc/html/Text…) CompOption (http://hackage.haskell.org/packages/archive/regex-pcre/0.94.2/doc/html/Text…) ExecOption (http://hackage.haskell.org/packages/archive/regex-pcre/0.94.2/doc/html/Text…) source, RegexContext (http://hackage.haskell.org/packages/archive/regex-base/0.93.2/doc/html/Text…) Regex (http://hackage.haskell.org/packages/archive/regex-pcre/0.94.2/doc/html/Text…) source1 target, Monad (http://hackage.haskell.org/packages/archive/base/4.5.0.0/doc/html/Control-M…) m) => source1 -> source -> m target > > > (=~~) x r = do (q :: Regex) <- makeRegexM r matchM q x > > > What I figured I could do was find a function that was the inverse of "match" and "matchM", but I can't find any in the docs. I really hope I don't have to implement that, too. I'm still new at this, and that seems like it would be over my head. > > > > > > > > > > > > _______________________________________________ > > > Haskell-Cafe mailing list > > > Haskell-Cafe(a)haskell.org (mailto:Haskell-Cafe@haskell.org) > > > http://www.haskell.org/mailman/listinfo/haskell-cafe > > > > > > > > > > > > > >

2 1