Re: [Haskell] Type-Level Naturals Like Prolog?

Hello Jared, Thursday, July 13, 2006, 9:25:39 AM, you wrote: > Why can't Haskell (with extensions) do type-level Peano naturals in > the same fashion? The code would be something like: btw, my beloved article on type-level programming is http://www.cs.nott.ac.uk/~ctm/faking.ps.gz i myself start

[Haskell] ANN: Takusen 0.5

Oleg and I are pleased to announce the release of a new version of Takusen (it's been a while; so long that we don't remember the last version number we used). The most significant code change is a new internal design (courtesy of Oleg) which gives better separation of concerns like statement pre

[Haskell] Re[2]: ANN: TextRegexLazy 0.44

Hello Chris, Thursday, July 13, 2006, 12:17:30 PM, you wrote: >> are you included Makefile? this makes building & installation somewhat >> simpler for a user > Yes, but the makefile is used just to compile Setup.hs to ./setup and tell the > user to run that instead. i've attached my Makefile. i

[Haskell] Re: ANN: TextRegexLazy 0.44

Bulat Ziganshin wrote: Hello Chris, Thursday, July 13, 2006, 12:17:30 PM, you wrote: Question 2: Is there interest in getting this into an official release of the base libraries? The Compat module could at least replace or sit alongside the performance sink of the current Text.Regex code. i'

[Haskell] The History of Haskell

Friends, Phil Wadler, John Hughes, Paul Hudak and I have been writing a paper about the The History of Haskell We've submitted an earlier draft to the History Of Programming Languages conference (HOPL'07), and it's been accepted. We have to submit a more-or-less final draft by 1 Septembe

[Haskell] ANN: System.FilePath 0.9

Hi, I have written a System.FilePath module in part based on the one in Yhc, and in part based on the one in Cabal (thanks to Lemmih). The aim is to try and get this module into the base package, as FilePath's are something many programs use, but its all too easy to hack up a little function that

[Haskell] What would Haskell middleware look like?

I've noticed that many other languages have a middleware to handle distribution and concurrency issues. Haskell has STM for shared-memory concurrency, but there is no mechanism (AFAIK) for distribution. So I've been having a think about what one might look like. The primary requirements seem