Hi Joachim,
I would like to nominate myself for a spot on the GHC Steering Committee if the
committee thinks it is appropriate. I have been writing Haskell programs for
pretty much as long as Haskell has been around. (I started with Miranda in 1987
and tracked the Haskell reports as they became
Thanks John,
Feedback is important. Please do let us know if you spot anything we have
missed.
Chris
On 09/03/2017, 20:04, "John Wiegley" wrote:
>>>>> "CD" == Chris Dornan writes:
CD> I am pleased to announce the regex package, a regula
://contact.regex.uk).
For more details see this blog post,
http://engineers.irisconnect.net/posts/2017-03-07-regex.html
and the regex website at:
http://regex.uk
Chris Dornan
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin
>=
> The (Interactive) Glasgow Haskell Compiler -- version 7.6.1
> =
GHC 7.6.1 is available now on all platforms (el5, el6, fc16, fc17) at
http://justhub.org/download.
Ch
Hi Anders,
> If this adds anything in terms of functionality that Nix doesn't already
> provide, then I would be interested to know. From having a quick look
> at your announcements, it's not quite clear though if it does.
I disagree Anders, but this is not the place to discuss it.
I will reply
> it might be of interest to know that the Nix package manager [1] offers
that functionality too
I am sorry if I gave the impression that JustHub was unique in adopting a
functional
philosophy to distributing Haskell -- obviously it is not and that was poor
phrasing on my part.
The key feature i
nd trackers etc., see http://justhub.org.
Chris Dornan
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Alex-generated scanners to suit the big Haskell compilers such as GHC.
Until the integration has been completed the new home for Alex is
http://www.syntaxpolice.org/~ijones/alex/
Please email Isaac ([EMAIL PROTECTED]) if you have any queries.
Cheers,
Chris Dornan
[EMAIL PROTECTED
Oops, that last message went out to the mailing list by mistake. Term has
started and the stress must be getting to me. Fortunately most of it could
well go onto the list anyway!
With foot in mouth,
Chris Dornan[EMAIL PROTECTED]
University College Cork http
> I'm confused. I thought at the ICFP Haskell meeting we agreed
> on the following types:
>
>length :: Integral i => [a] -> i
>take, drop :: Integeral i => i -> [a] -> [a]
>showsPrec :: (Show a, Integral i) => i -> a -> ShowS
> I'm not against adopting a conservative de
> Following quite a bit of discussion at a meeting at ICFP,
> and subsequent discussion with a smaller group at Yale,
> I must say that I am now strongly inclined to adopt (2); that is,
> to make Haskell 98 be the same as Haskell 1.4 on Int vs Integer matter.
> (This differs from the view put for
am advocating (pleading for) is to be able to use whatever compiler, old
or new, to compile old programs that refer to Int.
If we cannot agree to this, or something equally simple that will not break
programs, then can we just make no change at all.
Sorry for any confusion caused by my previous r
ckages.
Cheers,
Chris Dornan[EMAIL PROTECTED]
University College Cork +353 21 903165
ort
is still looking fairly good but the pairing heaps sort is much closer.
Chris Dornan[EMAIL PROTECTED]
University College Cork +353 21 903165
-- The Haskell Sort Benchmark Program
import List(group)
import System(getArgs
use it allows me to enumerate ordered data
structures into lists, process them and rebuild the data structure again,
quickly; the first thing to be done in rebuilding such a data structure is to
sort it, but that's OK because my sorting algorithm degenerates nicely into
little more than a quick linea
Does anyone else have one?
I would be intersted to see this. When would a heap sort be preferable to a
merge sort?
Chris Dornan[EMAIL PROTECTED]
University College Cork +353 21 903165
gt; v
= case | qs-> case e' of { p -> e; _ -> v }
| otherwise -> v
(f) done
case | True -> e
| otherwise -> v
= e
Conclusion
==
It looks as if case conditionals may help explain pattern guards in separating
them out from the pattern matching machinery. In doing so it would make for a
more uniform treatment of a new construct in addition to cleaning up the older
if-then-else expressions.
Chris Dornan[EMAIL PROTECTED]
University College Cork +353 21 902837
lete Haskell parsing utility in the process.
Chris Dornan[EMAIL PROTECTED]
University College Cork +353 21 902837
tr++".0"))
> (_,'.':f_str) | all isDigit f_str -> Just (read str)
> _ -> Nothing
Chris Dornan[EMAIL PROTECTED]
University College Cork +353 21 902837
t that it fails for some reasonable inputs like "2" and there
is no way of detecting and handling failures. I am just about to code an
`atof' for them but was wondering if there is a better way.
Chris Dornan[EMAIL PROTECTED]
University College Cork +353 21 902837
> data Ev = Ev { global:: MutVar Int,
>progName:: String,
>args::[String] }
>
> setup:: IO Ev
> setup = do
> v <- newVar 42
> pn <- getProgName
> as <- getArgs
> return (Ev v pn as
dly out of place with this
multi-process execution model.
The death-wish-avoiding pragmatist in me still thinks that Simon's proposal is
useful though.
Chris Dornan
22 matches
Mail list logo
