A bit more than 4 years ago, you wrote:
> Stefan Monnier wrote:
>> This release has several changes that have all been only lightly tested,
>> especially w.r.t compatibility with various Emacsen.
> It works (as far as I tried) on my emacs:
> GNU Emacs 21.3.1 (i586-suse-li
>> iio :: IO (IORef Int)
>> iio = newIORef 0
I sometimes feel like "IO" should be renamed to
"CommandSequenceReturning". So the above would read:
iio :: CommandSequenceReturning (IORef Int)
iio = newIORef 0
I.e. iio is not an IORef Int but only a (trivial) sequence of commands
that will end
> [EMAIL PROTECTED] (I like the plural better too, thanks Dan)
> [EMAIL PROTECTED]
> [EMAIL PROTECTED]
FWIW, the GNU projects typically have mailing lists called "bug" for bug
reports, and "help" for general discussions. So "help" sounds
pretty good. But... bikeshed ahead!
Stefa
> I participate in various lists and various forums. That Haskell uses
> lists has crippled my participation here; I am quite sure I am not
> alone. Nabble and the like do not substitute for real forum software.
Funny, it's the first time I hear the argument in this direction.
The only forums I
> However, we were not able to write a function that returns the tail.
>> tailList :: Flip b c => List a b -> List a c
>> tailList (Cons _ xs) = xs
The problem here is that the caller will probably not know which "Flip
b c". OTOH the Cons of type "List a b" already contains a "Flip b c"
proof, s
> I fear our alacritous Neil will now be the unwilling recipient of Haskell
> porn and Nigerian bank scams... :(
M Haskell porn!
Stefan
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
> I'm looking for a tool that implements the source code transformation
> "replace recursion by catamorphism" (fold etc.).
> My application is that if the transformation succeeds,
> it implies that the program terminates. (roughly)
> I don't want to make a big research project out of this,
> rath
A few minor typos/thinkos plagued Haskell-mode 2.2, so here's 2.3.
http://www.iro.umontreal.ca/~monnier/elisp/
No significant change, apart from the inclusion of a haskell-cabal-mode for
Cabal description files (doesn't do anything useful, tho, other than
highlight comments).
St
I've just released version 2.2 of the Haskell-mode package for Emacs.
It has very few visible changes, mostly some commands to query an underlying
interactive hugs/ghci in order to get type/info about specific identifiers,
courtesy of Matthew Danish.
It does have some non-trivial changes in the in
> Provoked by a discussion with Don Syme, and after some helpful
> conversations at POPL, I have finally written up a proposal for adding
> "view patterns" to Haskell. We've wanted views for a long time, but they
> have never made it, into GHC at any rate. This proposal is a very
> lightweight (a
> Ravi Nanavati has very helpfully put together a status report for the
> Haskell Prime process. Please see this link, or read the pasted text
> below:
> http://hackage.haskell.org/trac/haskell-prime/wiki/Status'
This wiki is really neat. I do wish there was some information in it about
the imp
> Is there a Haskell emacs mode that works well with lhs2TeX? Specifically
> (a) treating \begin{spec} ... \end{spec} like \begin{code}... \end{code},
> and (b) coloring inline code ("||)" and maybe inline verbatim
> ("@@") as Haskell rather than LaTeX code.
It'd be trivial to patch haskell-mode
> This change "solves" the problem that different records in a single
> namespace cannot share field names in a simple manner.
As mentioned elsewhere, you'd also need to remove the functional update
feature to fix this namespace problem.
> In order to allow the writing of records code with is bot
>> > instance CpsForm t t where
>> This can't be right, can it?
> In general no: the CPS of a function certainly doesn't fit the above
> pattern. So, if the source language has abstractions (the language in
> the original message didn't), we have to add another instance for
> CpsForm.
But any othe
> instance CpsForm t t where
This can't be right, can it?
After CPS conversion a term of type "a -> b" won't have type "a -> b"
but rather something like "a * (b -> c) -> c".
Stefan
___
Haskell mailing list
Haskell@haskell.org
http://www.haske
Haskell-mode 2.0 is now almost a year old, so I thought it was time to make
a new release. You can find it at
http://www-perso.iro.umontreal.ca/~monnier/elisp/
This release has few visible changes. Most of the changes are in the
haskell-indent module. Those changes have not been heavi
> Hmm. I use font-lock, but I use xemacs (21.4). Maybe that's the cause
> of the difference.
IIRC XEmacs's support for syntax-table text-properties (and more
specifically for font-lock-syntactic-keywords) has been generally fairly
late. I'd expect it to be fully working by now, but maybe only in
> Sorry if I've asked this before, but is version 2.0 of haskell-mode on
> your website really the newest version?
It's the latest released version. There's newer code in the CVS, of course.
> I ask because the file haskell-mode.el says "Version: 1.43" in the header,
> and I thought I remembered
> Jorge Adriano did something similar for Haskell with x-symbol:
> http://www.haskell.org/pipermail/haskell-cafe/2002-August/003237.html
Note that the latest haskell-mode has support for something similar (tho
it works differently). But these are minor cosmetic tricks.
Stefan
_
> However, the only use of that function which I can see in the
> haskell-mode code is:
>(and (fboundp 'make-char) (charsetp 'japanese-jisx0208)
> So charsetp should only be called if the make-char function exists,
> and that function should also only exist if XEmacs was built with the
> MuLE
> case t of
> (x, y, z) -> (x, y, z+1)
How would you do:
case t of
(x, y, z, a, b, c) -> (x+1, y, z, a, b, c+2)
would you allow:
case t of
(ctx @> x, _, _, _, _, ctx @> c) -> ctx (x+1) (c+2)
-- Stefan
___
Haskell mai
> thanks for you work! The indentation works much better than
> before. However, I have some feature requests/bugs:
> - indentation in do monad: lines after "let" should have 2 possible
> indentations. One for new let bindings (how it is currently) and one for
> further monad expressions. Examp
> While playing with the new mode I discovered a small deficiency in the menu
> "Declarations" -> "Imports" (that I've never used before). The names of the
> imported modules are cut off after the first dot. Instead of
> i.e. "Data.List" only "Data" is displayed. (There may be several dots in
> a m
I have recently taken over maintainership of Haskell-mode, and after making
a bunch of changes, I figured it would be a good idea to make a new release.
You can find this new release at:
http://www-perso.iro.umontreal.ca/~monnier/elisp/
If you think it should also be found at
http://www.
> I'm baffled that I can't find anywhere in the documentation how to associate
> two or more patterns with the same right-hand-side...
It gets more interesting with things like:
case x of ( ([],a) | (a,[]) ) -> .. a ..
where the rewrite looks like:
let foo a = ...
in case x of ([],a) -
> "Jan" == Jan Skibinski <[EMAIL PROTECTED]> writes:
> One of the myths was that Smalltalk was notoriously slow for
> math. I checked this last time four years ago in a context
> of comparative tests between Smalltalk and Eiffel interpreter
Speed comparison of interpreters is pretty much poin
26 matches
Mail list logo
