Re: Haskell for non-Haskell's sake

* Hal Daume III <[EMAIL PROTECTED]> [2003-08-29 17:39 -0700]: > If you use Haskell for a purpose *other than* one of those listed below, > I'd love to hear. I have written checkrdf[1], a tool for downloading and processing RSS files from various newstickers. checkrdf uses HaXml for processing RSS

Re: proving the monad laws

Steffen Mazanek posed a problem: given the monad: > data Error a = Error String | Ok a > data TI a = TI (Subst -> Int -> Error (Subst, Int, a)) > instance Monad TI where > return x = TI (\s n -> Ok (s,n,x)) > TI f >>= g = TI (\s n -> case f s n of >Ok (s',m,x) -> l

Re: Haskell for non-Haskell's sake

The Timber group at OHSU/OGI are using Haskell to write their Timber compiler and Timber VM executable specification. Andy Gill Hal Daume III wrote: Hi fellow Haskellers, I'm attempting to get a sense of the topology of the Haskell community. Based on the Haskell Communities & Activities repo

Re: Haskell for non-Haskell's sake

G'day all. On Fri, Aug 29, 2003 at 05:39:09PM -0700, Hal Daume III wrote: > I'm attempting to get a sense of the topology of the Haskell > community. I used Haskell to write a compiler for the RenderMan shading language for a former employer. Unfortunately, the compiler never shipped. I still

New address

I apologize to anyone who wrote me last week and did not get any response. For a reason unknown to me I can no longer access the email account which I used when subscribing to this list. I hope this address will remain stable enough. Jan ___ Haskell m

Re: Haskell for non-Haskell's sake

On Fri, Aug 29, 2003 at 05:39:09PM -0700, Hal Daume III wrote: I'm attempting to get a sense of the topology of the Haskell I work at Galois Connections and much of the software we write (mostly government contracting) is written in Haskell. I've written an ASN.1 parser pro

Re: Haskell for non-Haskell's sake

Hello, I am a student from Germany and I have used Haskell for several purposes as well: - to implement and compare algorithms quickly, e.g. Travelling Salesman, Sorting, etc. - to calculate state spaces and blocking probabilities in networks - to solve some of our cryptography and computability

Re: Haskell for non-Haskell's sake

On Fri, Aug 29, 2003 at 05:39:09PM -0700, Hal Daume III wrote: > I'm attempting to get a sense of the topology of the Haskell > community. Based on the Haskell Communities & Activities reports, it > seems that the large majority of people use Haskell for Haskell's sake. > If you use Haskell for a

Re: Haskell for non-Haskell's sake

I use Haskell to design and verify circuits that are used at my company and by our customers. A Haskell-based methodology for producing circuits has proved to be successful in some situations when a conventional flow based on Java or hardware description languages (VHDL and Verilog) was not able to

RE: Type class problem

| > b) at the moment dictionaries have the property that you can always | > evaluate them using call-by-value; if they could be recursively | > defined (as you suggest) that would no longer be the case | > | > Mind you, GHC doesn't currently take advantage of (b), so maybe it | > should be

RE: Type class problem

| I'm wondering if the general method of avoiding non-termination can be | made to work in these more complex cases. | | Incidentally, the constraint solver stack overflow problem can be | turned to our advantage. The typechecker's exhausting the stack should | be considered a failure to match the