- Haskell-Cafe - Haskell.org

"Recent content is available under a simple permissive license"
by Robin Green 11 May '07

11 May '07

The Haskell wiki[1] says "Recent content is available under a simple permissive license". But this is unilluminating - recent? how recent, exactly? - and will become increasingly understated as time goes by. Wouldn't it be slightly more helpful to say "Content added after " ... YYYY/MM/DD ... " is available under a simple permissive license"? -- Robin [1] http://www.haskell.org/haskellwiki

3 2

Re: [Haskell] ANNOUNCE: Harpy -- run-time code generation library
by Justin Bailey 11 May '07

11 May '07

On 5/11/07, Dirk Kleeblatt <klee(a)cs.tu-berlin.de> wrote: > > Hi everybody, > > we're pleased to announce the first release of Harpy. > > Harpy is a library for run-time code generation of x86 machine code. > It provides not only a low level interface to code generation > operations, but also a convenient domain specific language for machine > code fragments, a collection of code generation combinators and a > disassembler. Impressive. Does the library require that an assembler (e.g. MASM) be installed? Justin

3 2

Re: [Haskell] ANNOUNCE: Harpy -- run-time code generation library
by Duncan Coutts 11 May '07

11 May '07

On Fri, 2007-05-11 at 10:04 +0200, Dirk Kleeblatt wrote: > Hi everybody, > > we're pleased to announce the first release of Harpy. > > Harpy is a library for run-time code generation of x86 machine code. > It provides not only a low level interface to code generation > operations, but also a convenient domain specific language for machine > code fragments, a collection of code generation combinators and a > disassembler. > > Harpy homepage: > http://uebb.cs.tu-berlin.de/harpy/ This looks cool. I was wondering what the need for ensureBufferSize is? Could this by automated? I would have thought that we could just check this when writing out a single instruction. Duncan

2 1

Monad pronounced like gonad?
by Dan Weston 11 May '07

11 May '07

I've been pronouncing monad like gonad (moh-nad), but it occurs to me that it might be pronounced like monoid (mah-nad). Is there an official way to pronouce this word - maybe with a Scottish accent? :)

14 15

Sudoku solving
by Antoine Latter 10 May '07

10 May '07

I'm a relatively new to Haskell, so I figured I needed to write a Sudoku solver. The key features of this solver are: * It's longer than other Haskell Sudoku solvers I've seen around * It fails to solve many solvable puzzles Fantastic! link: http://panicsonic.blogspot.com/2007/04/sudoku-solving.html The approach: Because I'm new to Haskell, the traditional guess-and-check method of Sudoku solving would involving things like backtracking down a search path, which is still in the realm of Haskell Black Magic. Instead, I cast the problem into successive function applications on data - A Sudoku puzzle is represented as an array of constraints on the values of cells. The constraints are reduced via analysis of the surrounding constraints until the puzzle is solved (or not). For those who like references: my approach is similar to "Solving Sudoku Puzzles with Rewritting Rules" by Gustavo Santos-Garcia and Miguel Palomino, 2005, Electronic Notes in Theoretical Computer Science. My main rules and techniques can be considered as generalizations on some of their rules and techniques - except their solver can solve all solvable puzzles (with the help of a guess-and-check rule). Thanks for taking a look, Antoine

2 1

Re: [Haskell-cafe] generate Haskell code from model
by Brian Smith 10 May '07

10 May '07

On 4/14/07, Steffen Mazanek <steffen.mazanek(a)googlemail.com> wrote: > > Brian, but don't you think that you have to write a lot > of boilerplate code in Haskell? I have never felt I was writing a lot of boilerplate. There are a lot of abstraction mechanisms in Haskell to avoid boilerplate. Second, if Haskell should be more successful in the > real world there has to be a way of demonstrating > basic ideas of a big program to "customers". How > would you do this? Everybody knows UML class > diagrams, for example. In contrast, nobody knows > about termgraphs or lambda *g*. I've never had to show a UML or ER diagram to any business people--usually they want a slideshow that is far simpler and a little prettier. The fact that "nobody knows about termgraphs or lambda" in your group means that you probably shouldn't be considering Haskell (for the same reason my bosses always asked me to document everything--"in case you get hit by a bus"). Thank you very much for contributing to the discussion. > Please assume, that you have to generate the code from > a model. Further assume, that you have no choice and > are not allowed to discuss the sense of this approach :-) > How should the code look like? I am not sure if you are trying to solve a real problem or not. If you are solving a real problem, where you already happen to have an EMF model which you are required to generate code from, then I recommend to just do everything in Java using the existing tools built for EMF. If you decide to still keep working in Haskell, and it works out well, please share your solution because I think many people here will be very interested. wxHaskell, OOHaskell, and O'Haskell are all starting points for this type of project. - Brian

4 4

Grabbing list of functions from current module
by Joel Reymont 10 May '07

10 May '07

Folks, Does anyone have code that can grab a list of functions named with a certain prefix from the current (or given) module? I want to find functions named, say, ast_* and produce a list of tuples like ("input1", ast_input1). Thanks, Joel -- http://wagerlabs.com/

3 3

Co-arbitrary
by Joel Reymont 10 May '07

10 May '07

Would someone kindly explain why we need co-arbitrary in QuickCheck and how to define it? Detailed examples would be awesome! I would be willing to paste an in-depth explanation on my wall and keep it forever. Thanks in advance, Joel -- http://wagerlabs.com/

5 4

Telling Cabal not to install the executable
by Joel Reymont 10 May '07

10 May '07

I tell Cabal to build library and a test harness. How can I tell Cabal that I only want the library installed? Thanks, Joel -- http://wagerlabs.com/

2 1

Re: [Haskell-cafe] Debugging
by Ryan Dickie 10 May '07

10 May '07

On 5/4/07, Monang Setyawan <monang(a)gmail.com> wrote: > > On 5/5/07, Stefan O'Rear <stefanor(a)cox.net> wrote: > > On Sat, May 05, 2007 at 11:36:16AM +0700, Monang Setyawan wrote: > > > Hi, I'm a beginner Haskell user. > > > > > > Is there any way to trace/debug the function application in GHC? > > > > Absolutely! > > > > stefan@stefans:/tmp$ ghci X.hs > > ___ ___ _ > > / _ \ /\ /\/ __(_) > > / /_\// /_/ / / | | GHC Interactive, version 6.7.20070502, for > Haskell 98. > > / /_\\/ __ / /___| | http://www.haskell.org/ghc/ > > \____/\/ /_/\____/|_| Type :? for help. > > > > Loading package base ... linking ... done. > > [1 of 1] Compiling Main ( X.hs, interpreted ) > > Ok, modules loaded: Main. > > *Main> :break fac > > Great!! Thanks, it really helps. > I should update my GHC to the newest version (I use the old 6.4.2 > with no break command) > > Is there any editor/IDE supporting this break command? It should be > cooler if we can debug functions just by placing mark in the line. > > > > > Stefan > > > > > -- > Demi masa.. > > > -- > Demi masa.. > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > I've only written trivial applications and functions in haskell. But the title of this thread got me thinking. In an imperative language you have clear steps, states, variables to watch, etc. What techniques/strategies might one use for a functional language? --ryan

7 8