--with-hc only configures what's used to compile 'generic' Haskell
code (i.e., not the contens of ghc/compiler). (As Simon suggests),
use --with-ghc to control what GHC to to use to compile the
compiler bits, i.e.,
./configure --with-ghc=/usr/local/bin/ghc-5.02.2 \
Dear GHC,
Here are some comments on ghc-5.02.2.
I have tested it in the following way.
1. Installed binary = ghc-5.02.2-i386-linux-unknown.
2. Compiled ghc-5.02.2-source with binary for linux-i386,
under empty mk/build.mk, removed binary installation.
3. Compiled a large Haskell
Some questions
--
* up-arrow key does not work in ghci,
and it worked in binary installation.
Probably, some library was not found. How to fix this?
Do you have the readline-devel RPM installed? This is needed to compile
GHC with readline support.
I have stored
To my notes on ghc-5.02.2 Simon Marlow writes
* up-arrow key does not work in ghci,
and it worked in binary installation.
Probably, some library was not found. How to fix this?
Do you have the readline-devel RPM installed? This is needed to compile
GHC with readline support.
I
S.D.Mechveliani [EMAIL PROTECTED] writes:
To my notes on ghc-5.02.2 Simon Marlow writes
Do you have the readline-devel RPM installed? This is needed to
compile GHC with readline support.
I run ghc here on two machines.
And it appears now that both are under Debian Linux.
Some
At 2002-01-24 06:52, Ketil Z. Malde wrote:
GHC is in Debian, you probably want to use a cutting-edge release
(i.e. sid or at least woody) to be reasonably current.
ghc5 in woody and sid is 5.02. If anyone would has a deb for the latest
release, that would be very useful...
--
Ashley Yakeley,
Hello,
I use GHC 5.00.2 on Solaris 2.6 at the university and am unable to use
hierarchical module names --- with and without the -fglasgow-exts switch. GHCi
notifies me of parse errors on the module name. What is interesting is that if
my module with hierarchical name imports a module which
this is mail test, ignore, please
___
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Wolfgang Jeltsch [EMAIL PROTECTED] writes:
Aren't hierarchical module names supported yet in GHC
5.00.2?
No, not as far as I remember.
At home with GHC 5.02 under Linux everything works fine.
I believe they are new to ghc-5.02.
Jens
___
| From: Ross Paterson [mailto:[EMAIL PROTECTED]]
| Sent: 21 January 2002 17:20
| To: [EMAIL PROTECTED]
| Subject: H98 Report: semantics of pattern matching
|
|
| In section 3.17 Pattern Matching, there are some
| inconsistencies between the informal and formal semantics:
Tbanks very much
Lots of people have observed that Haskell might be a good scripting
language for numerical computation. In complicated numerical
applications, the program may spend most of its time in (say) matrix
multiply, which constitutes a tiny fraction of the code for the
application. So write the bulk of
Simon:
Lots of people have observed that Haskell might be a good scripting
language for numerical computation. In complicated numerical
applications, the program may spend most of its time in (say) matrix
multiply, which constitutes a tiny fraction of the code for the
application. So write the
Wolfgang Lux wrote:
Wolfgang Jeltsch wrote
Hello,
say I have a type T defined the follwing way:
newtype T a b = T (a b)
Now I want to make every T a b with a b beeing an instance of Eq also an
instance of Eq where (==) just test for equality of the encapsulated values.
I
try
I'm trying to learn more about Explicit Universal Quantification so I
decide to run the following supposedly correct code from the ghc user
guide:
module Dummy where
import ST
newtype TIM s a = TIM (ST s (Maybe a))
runTIM :: (forall s. TIM s a) - Maybe a
runTIM t = case t of {TIM l - runST l}
One thing I would very much like to see done in a functional language is fault-tree
analysis.
A fault tree has as nodes various undesirable events, with as top node some disaster
(for example,
nuclear reactor meltdown) and as leaves various faults which can occur, with their
probabilities
Jay Cox wrote:
I'm trying to learn more about Explicit Universal Quantification so I
decide to run the following supposedly correct code from the ghc user
guide:
module Dummy where
import ST
newtype TIM s a = TIM (ST s (Maybe a))
runTIM :: (forall s. TIM s a) - Maybe a
runTIM t = case
Please reply to [EMAIL PROTECTED]
I don't remember if I answered this before, but...
I don't see the relevance of there being no constructor to match on. That
is the case for any tuple type. It seems that
newtype T1 [a1 a2 ...] = C1 ...
is the same as
data T2 [a1 a2 ...] = C2 !... !... !...
Hi all
I have written a vim syntax highlighting file which, given a literate
script with TeX markup surrounding the Haskell code, will highlight both
the TeX and Haskell.
lhaskell.vim is at
http://c93.keble.ox.ac.uk/~ian/haskell-vim/lhaskell.vim
along with haskell.vim and tex.vim, but
This is far better than my simple bug fix of edition to John Williams'
syntax files in Vim 6.0, which is on the haskell library page.
But this has some problem. As I were poor making haskell sytax
file I ``haskell.vim'' in a very bogusly ...
Please DO Mail to the webmasters of www.haskell.org
fre 2002-01-25 klockan 02.21 skrev Feuer:
Please reply to [EMAIL PROTECTED]
I don't remember if I answered this before, but...
I don't see the relevance of there being no constructor to match on. That
is the case for any tuple type. It seems that
newtype T1 [a1 a2 ...] = C1 ...
is
Martin Said:
Those two constructs are not the same
Compare
newtype T1 = C1 Bool
dataT2 = C2 !Bool
the difference is that the constructor C1 does not
exist, so only the following values exist for T1:
C1 True (which is the represented as True)
C1 False (which is the represented
fre 2002-01-25 klockan 08.27 skrev David Feuer:
Martin Said:
Those two constructs are not the same
Compare
newtype T1 = C1 Bool
dataT2 = C2 !Bool
The report says clearly that for a newtype like T1,
C1 _|_ = _|_
This is the same as for T2 and C2.
No.
C1 _|_ is the same as
ons 2002-01-23 klockan 22.18 skrev David Feuer:
The paper I am reading uses the following in an instance declaration for
parsers:
p = f = Parser (\cs - concat [parse (f a) cs' |
(a,cs') - parse p cs])
Isn't this the same as
p = f = Parser (\cs -
The easiest way to combine State and IO is using a monad transformer. There
are some lecture notes which you might find useful at
http://www.md.chalmers.se/~rjmh/Combinators/Monads/index.htm
which refer to a library module
I agree with others who mentioned that viewing monads as simply
providing a way to sequentialize things or to program imperatively is
the wrong way to look at them.
snip
Yes, Lists are the classical example.
That said, the EFFICIENCY of monads is often poorly understood. To
state the
Well, it's also possible to interchange data between these two monads by:
unsafeIOToST :: IO a - ST s a
stToIO :: ST s a - IO a
Can anyone tell the possible problems related to
unsafeIOToST?
^^
-- Andre
- Original Message -
From: Tom Bevan [EMAIL PROTECTED]
To: Andre W B Furtado
Tom Bevan wrote:
Hi all,
I'm writing a programme which requires IO actions to be interleaved with
operations on a State monad. From what I can work out, this means that
the IO Monad and the StateTransformation monad need to be composed into
a single highr order monad.
Does anyone have
Andre W B Furtado wrote:
Well, it's also possible to interchange data between these two monads by:
unsafeIOToST :: IO a - ST s a
stToIO :: ST s a - IO a
Can anyone tell the possible problems related to
unsafeIOToST?
^^
Probably in the same manner as with unsafePerformIO:
it can break
I'd like to be able to dynamically load Haskell code
from a plugin binary file into a Haskell application,
just as I can dynamically load .so files into a C application.
Since ghci does this, I thought I could copy its implementation
but after looking into it, it's very complicated. I notice
29 matches
Mail list logo
