On Dec 18, 2007 11:18 AM, Simon Marlow [EMAIL PROTECTED] wrote:
I'd like to suggest a slight change to this. Currently we put the user
package database in
appdata\ghc\arch-os-ghcversion\package.conf
so perhaps the GHCi startup file should be
appdata\ghc\ghci.cfg
To keep all the
On Dec 16, 2007 3:38 PM, Yitzchak Gale [EMAIL PROTECTED] wrote:
As long as GHC has a built-in notion of home directory,
which doesn't exist on Windows, there needs to be
a user-configurable way to specify what to do instead,
as there always was until now. It depends on a lot
of factors -
On Dec 14, 2007 5:09 PM, Simon Marlow [EMAIL PROTECTED] wrote:
Ok. Unless there are any objections, this is what we'll do.
Thanks.
Juanma
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
On Dec 14, 2007 11:46 PM, Duncan Coutts [EMAIL PROTECTED] wrote:
I can just imagine the bug report and eventually figuring out that some
application the user had installed had set $HOME and this was messing up
finding files.
There are not many (there is any, other than perhaps Cygwin?) which
On Dec 15, 2007 2:16 AM, Felix Martini [EMAIL PROTECTED] wrote:
I agree with Duncan. getHomeDirectory should follow the Windows API.
There are other unix-style dot-config files in my Windows home folder
as well. Ideally the ghci config file would be put into
AppData\GHC\.
Have you installed
On Dec 12, 2007 7:44 PM, Ian Lynagh [EMAIL PROTECTED] wrote:
The GHC Team is pleased to announce a new patchlevel release of GHC.
With the Windows release of GHC 6.8.2, GHCi does not find .ghci in
%HOME% (though it finds it in the current directory):
C:\wrk echo %HOME%
C:\home
C:\wrk ghci
On Dec 13, 2007 2:05 PM, Claus Reinke [EMAIL PROTECTED] wrote:
try %HOMEDRIVE% %HOMEPATH% instead?
Doesn't work either.
you might have set %HOME% to help some unix software
along, but this variable doesn't seem to exist by default.
It worked in 6.8.1.
With which I mean, GHCi had no trouble
On Dec 13, 2007 4:20 PM, Juanma Barranquero [EMAIL PROTECTED] wrote:
I suppose that is a fix for some people; it is a regression for me...
In fact, it'd be better if GHC/GHCi would do what Emacs on Windows
does: use HOME if defined, else use ShGetFolderPath to find the
Windows-defined home
On Dec 13, 2007 4:13 PM, Simon Marlow [EMAIL PROTECTED] wrote:
Yes, see this ticket which was fixed in 6.8.2:
I suppose that is a fix for some people; it is a regression for me...
GHCi now uses getHomeDirectory, so you need to put your .ghci file wherever
getHomeDirectory says your home
On Dec 13, 2007 4:49 PM, Claus Reinke [EMAIL PROTECTED] wrote:
in the interest of backwards-compatibility, perhaps.
That is a good reason, yes.
but as the links i gave should demonstrate, there is no
%HOME% on windows, unless you invent it.
Sorry, it's not me who invented it. There are many
On Dec 13, 2007 6:03 PM, Claus Reinke [EMAIL PROTECTED] wrote:
perhaps my fault for filing that ticket in absolutes, which led
to a fix replacing, rather than augmenting, the old, erroneous
behaviour.
It's not a matter of fault, but sure it would've been wiser to
suggest (or implement) the
On Dec 13, 2007 11:31 PM, Yitzchak Gale [EMAIL PROTECTED] wrote:
I agree, that is closer to the correct behavior.
Except that on Vista ShGetFolderPath is deprecated.
Use ShGetKnownFolderPath instead on Vista.
Aha, I didn't know that. Thanks.
Also, %HOMEPATH% is unsuitable for a Unix-style
On Nov 28, 2007 6:16 PM, Laurent Deniau [EMAIL PROTECTED] wrote:
I can't see how it could be one page of C unless the page is 10 lines
long ;-) The following code is the direct translation of your Haskell
code (except that it prints the result instead of building a list).
a+, ld.
#include
On 9/27/07, ok [EMAIL PROTECTED] wrote:
(What the heck _is_ Tangut, anyway?)
http://en.wikipedia.org/wiki/Tangut_language
Juanma
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi.
You've probably already noticed, but in case not, there are now two
installers available for Windows:
http://www.haskell.org/ghc/download_ghc_661.html#windows
I installed the old style Windows Installer, prepared by Sigbjorn
Finne. ghc --version says:
The Glorious Glasgow Haskell
On 5/9/06, Simon Marlow [EMAIL PROTECTED] wrote:
that was a bug. Now fixed.
Thanks.
/L/e/k/t/u
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
Trivial question, just out of curiosity.
Why it is not possible to define aliases for :quit in GHCi?
Prelude :def ayuda \_ - return :help
Prelude :def adios \_ - return :quit
Prelude :ayuda
... normal help output...
Prelude :adios
Prelude
--
/L/e/k/t/u
On Wed, 12 Nov 2003 10:07:58 -
Simon Marlow [EMAIL PROTECTED] wrote:
Yes, they're binary incompatible I'm afraid.
Oh, well... :)
The path is the path to the HTML files, and the filename is the name of
the .haddock file. They can be completely different, e.g.
Of course. Silly me.
On Tue, 11 Nov 2003 11:01:00 -, Simon Marlow [EMAIL PROTECTED] wrote:
There is a new release of Haddock, version 0.6.
Are interface files binary-incompatible with those of previous releases?
With a Cygwin-compiled 0.6, I get an error:
Fail: end of file
Action: Data.Binary.getWord8
On Fri, 7 Nov 2003 19:55:47 +0100
Stefan Karrmann [EMAIL PROTECTED] wrote:
I've inserted 'convert = (uncurry cFromTai) . cToTai'.
Great, thanks.
A fixed and checked version is appended and carbon copied to
[EMAIL PROTECTED].
What's haskell-libs-developers? I thought libraries'
On Sat, 1 Nov 2003 17:36:11 +0100
Stefan Karrmann [EMAIL PROTECTED] wrote:
a while ago time calculation was subject on this list.
Now, I have a time library based on the TAI (international
atomic time) time scale.
I get the following error with GHCi:
Section 7.4 of the User Guide (or doc source
ghc/docs/user_guide/glasgow_exts.sgml) references Haskell 1.4 several
times when Haskell 98 would perhaps be more appropriate.
Also, section 7.4.10 (Arbitrary-rank polymorphism, same sgml source)
has an example with functions f1, g1, f2, g2 and f3, but
On 24 Oct 2003 16:30:05 +0200
[EMAIL PROTECTED] wrote:
I was under the impression it was no longer current. Is it still
true?
It is still what the docs say, at least :)
Juanma
___
User's Guide 6.2 says:
So, when we want very fast code, we use: -O -fvia-C.
but I've seen programs which use the (apparently undocumented) -O2-for-C
flag too.
In fact, generally speaking anyone of:
-O -fvia-C
-O2 -fvia-C
-O -fvia-C -O2-for-C
-O2 -fvia-C -O2-for-C
produces different
An even simpler example, with just one module:
---
module Test where
import Data.List (genericLength)
{-# RULES
genericLength/length genericLength = length
#-}
---
D:\...\hask
But I'm getting an error on recompilations that I don't understand. It
happens only with -O (or -On), AFAICS.
On second (and less sleepy) thought, there's no mystery in it happening
only with -O, as RULEs aren't used for non-optimizing compilations :)
Still, it's weird to get an error on
I'm using Haddock 0.5, compiled for GHC 6.0.1, and I get warnings when
haddocking a simple module:
Warning: module not found: Prelude
Warning: MyModule: the following names could not be resolved:
Prelude.[] Bool Eq
I can see what's happening: I'm not passing Prelude.hs to Haddock, but
I'm playing with rules, and I wonder if it is posible to define a rule
that will trigger for a specialization of a function.
(In the following examples, the functions are not necesarily useful or
good-style... :)
I have:
count :: (Integral b) = (a - Bool) - [a] - b
count = count' 0
On Thu, 02 Oct 2003 14:57:22 +0200, Juanma Barranquero [EMAIL PROTECTED] wrote:
data Accum s a = Ac [s] a
instance Monad (Accum s) where
return x = Ac [] x
Ac s1 x = f = let Ac s2 y = f x in Ac (s1++s2) y
output :: a - Accum a ()
output x = Ac [x] ()
After trying this one
I have an extremely-newbie question about monads and how to interpret
the monadic laws; I asked that same question yesterday on IRC and the
answers were interesting but non-conclusive (to me anyway).
I'm trying to learn monads by reading All About Monads, version 1.0.2.
I though of defining a
On Thu, 02 Oct 2003 11:22:13 +0200
Marcin 'Qrczak' Kowalczyk [EMAIL PROTECTED] wrote:
As you discovered, there is no meaningful count of operations. If an
operation doesn't do anything, do you count it?
It's not about counting the operations (that's just an example), but
accumulating any kind
On Thu, 2 Oct 2003 13:16:13 +0200
[EMAIL PROTECTED] wrote:
The Monad class is just called Monad because it is intended
to cover a monad. But it doesn't ensure the laws. That is your
sole responsibility.
Yeah, I know. But it's difficult to ensure I'm satisfying the laws when
I'm not entirely
On Thu, 2 Oct 2003 12:30:54 +0100
Alastair Reid [EMAIL PROTECTED] wrote:
Observational equivalence.
For monads like list and maybe, this boils down to the normal equality because
the standard equality on these types is exactly observational equality.
For monads like IO, you can't define
On Thu, 02 Oct 2003 14:27:29 +0200
Marcin 'Qrczak' Kowalczyk [EMAIL PROTECTED] wrote:
Accumulating state is fine. These definitions don't accumulate state:
'return' should yield a neutral state, and the above = ignores the
state of the lhs.
You're right.
data Accum s a = Ac [s] a
On Thu, 2 Oct 2003 16:09:11 +0100, Alastair Reid [EMAIL PROTECTED] wrote:
So you should not interpret the '==' in the monad law as requiring you to
define an Eq instance.
If you do define an Eq instance, it ought to be reflexive, symmetric and
transitive (i.e., an equivalence) if you want
In GHC 6.0.1, using GHCi:
Prelude let x # f = f x
Prelude :t (#)
interactive:1: parse error on input `)'
Prelude :t ( #)
interactive:1: parse error on input `#)'
Prelude :t (# )
interactive:1: parse error on input `)'
Prelude :t ( # )
( # ) :: forall t t1. t1 - (t1 - t) - t
Prelude zipWith (#)
On Fri, 19 Sep 2003 14:27:19 +0100
Simon Marlow [EMAIL PROTECTED] wrote:
We could make it understand comments, but that adds extra
complication (nested comments, maximal munch for '--' comments, etc.).
Hmm.
Nested comments yes, I see how that'd be a problem.
But surely it wouldn't be hard
A very small nitpick:
OPTIONS pragmas are only looked for at the top of your source files,
upto the first (non-literate,non-empty) line not containing OPTIONS.
Why doesn't non-empty include comment-only lines?
I usually start source files with the equivalent of:
Extremely-newbie questions:
Is there any way to know if a list is finite or infinite, other than
doing:
length l
and waiting forever? :)
I ask because I was learning Haskell by writing some pretty naive
implementation of surreal numbers, where I used lists for left and right
surreal sets,
On Thu, 18 Sep 2003 15:53:12 -0400, Derek Elkins [EMAIL PROTECTED] wrote:
In Haskell 98, no. With a slightly impure extension (observable
sharing) sometimes but in general, no.
Interesting.
just use a data structure that says, an
infinity of x. The simplest thing I would think of is to
40 matches
Mail list logo
