#744: ghc-pkg lies about location of haddock-interfaces and haddock-html
--+-
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug| Status: new
Priority: normal
Christian Maeder wrote:
RtsUtils.p_o
RtsUtils.c: In function 'time_str':
RtsUtils.c:190: error: too few arguments to function 'ctime_r'
I could carry on after adding an argument , 26
C.
-- RtsUtils.c 2006-04-13 09:09:49.778999000 +0200
+++ RtsUtils.c~ 2006-01-12 13:43:03.0 +0100
@@
Brian
I've committed a fix for this. By which I mean that you don't need to
write dropRenderM. You can just use RenderM as if it were IO.
The change won't be in 6.4.2, but it's in the HEAD and will be in 6.6
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
Christian Maeder wrote:
RtsUtils.c:190: error: too few arguments to function 'ctime_r'
I could carry on after adding an argument , 26
now I get an error when linking the stage2 compiler. How should I fix this?
Cheers Christian
Christian Maeder wrote:
Christian Maeder wrote:
RtsUtils.c:190: error: too few arguments to function 'ctime_r'
I could carry on after adding an argument , 26
now I get an error when linking the stage2 compiler. How should I fix this?
Cheers Christian
Christian Maeder wrote:
OSThreads.c:(.text+0x88): undefined reference to `sched_yield'
collect2: ld returned 1 exit status
I could fix this by adding rt to the extra-libraries of the rts
package.conf file.
Now I have a stage2 compiler but gmake binary-dist does not work. I
assume a couple
Christian Maeder wrote:
Christian Maeder wrote:
OSThreads.c:(.text+0x88): undefined reference to `sched_yield'
collect2: ld returned 1 exit status
I could fix this by adding rt to the extra-libraries of the rts
package.conf file.
Now I have a stage2 compiler but gmake binary-dist does
Simon Marlow wrote:
GhcBinDistDirs is set by ghc/mk/config.mk, which is included by the
top-level Makefile.
I've no such variable in ghc/mk/config.mk or ghc/mk/config.mk.in
C.
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
Simon Marlow wrote:
GhcBinDistDirs is set by ghc/mk/config.mk, which is included by the
top-level Makefile.
I see, there's another mk/config.mk in the subdirectory ghc
$ make show Project=Ghc VALUE=GhcBinDistDirs
GhcBinDistDirs=ghc libraries hslibs
in this subdirectory I get the same
(resent after being indefinitely held in fedora-haskell validation queue)
Hi,
1) I have installed FC5 on 2 different machines. On my Athlon1800+
everything works perfectly.
My other machine is a Pentium IV with hyperthreading, considered by
Linux as SMP (x86 32). This is where problems occur
On 2006-04-13 at 20:18+0200 Alain Cremieux wrote:
(resent after being indefinitely held in fedora-haskell validation queue)
Hi,
1) I have installed FC5 on 2 different machines. On my Athlon1800+
everything works perfectly.
My other machine is a Pentium IV with hyperthreading, considered
Simon Peyton-Jones wrote:
Brian
I've committed a fix for this. By which I mean that you don't need to
write dropRenderM. You can just use RenderM as if it were IO.
The change won't be in 6.4.2, but it's in the HEAD and will be in 6.6
Thanks!
Cheers, Brian.
Hello,
I'm trying to port a
linux-based Haskell application over to Win32. I am fiddling with both
MinGW and Cygwin
with
varying
degrees of bafflement. This is a server app that utilizes secure connections
with the GnuTLS libraries.
From what I
understand, the Win32 version of GHC
Hi,
Chp 8 of the Haskell Report says:
In this chapter the entire Haskell Prelude is given. It constitutes a
*specification* for the Prelude.
Many of the definitions are written with clarity rather than
efficiency in mind, and it is not required
that the specification be implemented as shown
Laszlo Nemeth [EMAIL PROTECTED] wrote:
Chp 8 of the Haskell Report says:
In this chapter the entire Haskell Prelude is given. It constitutes
a *specification* for the Prelude.
My question is how strictly this word specification is to be
interpreted? I can think of a strict and a
In Haskell, the
behaviour of functions on floating-point values which are NaNcan
beplatform dependent.
On"SunOSsun 5.9 Generic_118558-09 sun4u sparc
SUNW,Sun-Blade-1500":
Prelude ceiling
[ CC'ing glasgow-haskell-users@haskell.org ]
Geisler, Tim (EXT) wrote:
In Haskell, the behaviour of functions on floating-point values which
are NaN can be platform dependent.
On SunOS sun 5.9 Generic_118558-09 sun4u sparc SUNW,Sun-Blade-1500:
Prelude ceiling (0/0)
Hello,
I'm pleased to announce the release of version 0.14.2 of MissingH.
New features since 0.14.0 include:
* New module MissingH.Path.Glob. This module expands wildcards by
examining the filesystem. For instance, given the pattern
/*bin/*sh, you might get back [/bin/bash, /bin/sh,
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 (|expr|) and maybe inline verbatim (@expr@) as Haskell rather than LaTeX code.
- Conal
Hello,
HAppS - Haskell Application Server version 0.8 has been released and
contains a complete rewrite of the ACID and HTTP functionalities.
Features include:
* MACID - Monadic framework for ACID transactions:
Write apps as a set of simple state transformers. MACID write-ahead
logging and
| there are interesting problems in FDs, but it seems that the
confluence
| problems were merely problems of the old translation, not anything
| inherent in FDs! I really had hoped we had put that phantom to rest.
Claus
You're doing a lot of work here, which is great. Why not write a paper?
On 12 April 2006 17:51, Malcolm Wallace wrote:
Simon Marlow [EMAIL PROTECTED] wrote:
By infinite loop, you mean both non-terminating, and non-productive.
A non-terminating but productive pure computation (e.g. ones =
1:ones) is not necessarily a problem.
That's slightly odd terminology.
John Meacham [EMAIL PROTECTED] writes:
Checking thread local state for _every_ foregin call is definitly
not an option either. (but for specificially annotated ones it is
fine.)
BTW, does Haskell support foreign code calling Haskell in a thread
which the Haskell runtime has not seen before?
This is just a heads up that I'm currently collating the current state
of the discussion re: concurrency and the FFI, with a view to
enumerating all the current issues with rationale on the wiki. It's
getting to a state where I can't keep it all in my head at one time, and
I think this will help
On 13 April 2006 10:53, John Meacham wrote:
On Thu, Apr 13, 2006 at 09:46:03AM +0100, Simon Marlow wrote:
You seem to be assuming more about cooperative scheduling than eg.
Hugs provides. I can easily write a thread that starves the rest of
the system without using any _|_s. eg.
let
Jan-Willem Maessen wrote:
On Apr 11, 2006, at 5:37 PM, Lennart Augustsson wrote:
Yes, I realize than dynamic idempotence is not the same as
cycle detection. I still worry. :)
I think expectance is in the eye of the beholder. The reason
that (the pure subset of) pH was a proper
On Wed, Apr 12, 2006 at 05:50:40PM +0100, Malcolm Wallace wrote:
The argument John was making is that this is a useful distinguishing
point to tell whether your concurrent implementation is cooperative or
preemptive. My argument is that, even if you can distinguish them in
this way, it is not
On 13 April 2006 10:02, Marcin 'Qrczak' Kowalczyk wrote:
John Meacham [EMAIL PROTECTED] writes:
Checking thread local state for _every_ foregin call is definitly
not an option either. (but for specificially annotated ones it is
fine.)
BTW, does Haskell support foreign code calling
I have now summarised the concurrency proposal status, here:
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/Concurren
cy
I have tried to summarise the various points that have arisen during the
discussion. If anyone feels they have been mis-paraphrased, or I have
forgotten
Hello,
On 4/12/06, Claus Reinke [EMAIL PROTECTED] wrote:
that's why Ross chose a fresh variable in FD range position:
in the old translation, the class-based FD improvement rule no
longer applies after reduction because there's only one C constraint
left, and the instance-based FD improvement
Hello,
The wiki page says that we should alert the committee about
inaccuracies etc of pages, so here are some comments about the page on
FDs
(http://hackage.haskell.org/trac/haskell-prime/wiki/FunctionalDependencies)
1) The example for non-termination can be simplified to:
f = \x y - (x .*.
On Thu, Apr 13, 2006 at 12:07:53PM -0700, Iavor Diatchki wrote:
On 4/12/06, Claus Reinke [EMAIL PROTECTED] wrote:
that's why Ross chose a fresh variable in FD range position:
in the old translation, the class-based FD improvement rule no
longer applies after reduction because there's only
On Apr 12, 2006, at 4:25 PM, John Meacham wrote:
On Wed, Apr 12, 2006 at 09:21:10AM -0400, Jan-Willem Maessen wrote:
Though, to be fair, an awful lot of Prelude code didn't work in pH
unless it was re-written to vary slightly from the specification. So
the assumption of laziness was more
What other libraries should Haskell' support, and what are their
requirements?
useful initiative! will your collection be available anywhere?
may I suggest that you (a) ask on the main Haskell and library lists
for better coverage (I would have thought that the alternative Num
prelude
On Thu, Apr 13, 2006 at 05:10:36PM -0700, Iavor Diatchki wrote:
I understand the reduction steps. Are you saying that the problem is
that the two sets are not syntactically equal? To me this does not
seem important: we just end up with two different ways to say the same
thing (i.e.,
John Meacham writes:
On Tue, Apr 11, 2006 at 11:35:09AM +0100, Simon Marlow wrote:
On 11 April 2006 11:08, Ross Paterson wrote:
On Tue, Apr 11, 2006 at 11:03:22AM +0100, Simon Marlow wrote:
This is a rather useful extension, and as far as I can tell it
doesn't have a ticket yet:
Thank you oleg.
Sulzmann et al use guards in CHR to turn overlapping heads (instances) into
non-overlapping. Their coherence theorem still assumes non-overlapping.
I agree that what you described is the desirable behaviour when overlapping,
that is to defer the decision when multiple
Coherence (roughly) means that the program's semantics is independent
of the program's typing.
In case of your example below, I could type the program
either use the first or the second instance (assuming
g has type Int-Int). That's clearly bound.
Guard constraints enforce that instances are
I believe that GHC's overlapping instance extensions
effectively uses inequalities.
Why do you think that 'inequalities' model 'best-fit'?
instance C Int -- (1)
instance C a-- (2)
under a 'best-fit' instance reduction strategy
we would resolve C a by using (2).
'best-fit' should
| I believe that GHC's overlapping instance extensions
| effectively uses inequalities.
I tried to write down GHC's rules in the manual:
http://haskell.org/ghc/dist/current/docs/users_guide/type-extensions.htm
l#instance-decls
The short summary is:
- find candidate instances that match
- if
Thank you Martin.
Coherence (roughly) means that the program's semantics is independent
of the program's typing.
In case of your example below, I could type the program
either use the first or the second instance (assuming
g has type Int-Int). That's clearly bound.
If g has type Int-Int, it
It seems that the subject is a bit more complex, and one can force GHC
to choose the less specific instance (if one confuses GHC well
enough): see the example below.
First of all, the inequality constraint is already achievable in
Haskell now: TypeEq t1 t2 False is such a constraint. One can
one can force GHC to choose the less specific instance (if one
confuses GHC well enough): see the example below.
your second example doesn't really do that, though it may look that way.
class D a b | a - b where g :: a - b
instance D Int Bool where g x = True
instance TypeCast Int b = D a b
Sorry to respond to my own message, but I found a much more
satisfactory way to solve this problem. ghc is able to specialize it
so that
data Test1 = Foo | Bar | Baaz | Quux deriving (Enum, Bounded)
sizeTest1 :: (Set Test1) - Int
sizeTest1 = sizeB
compiles into a call directly to
Hello David,
Thursday, April 13, 2006, 12:55:05 AM, you wrote:
Yes, especially curious since the algorithm is taken from AMD's
optimization guide for the Athlon and Opteron series. I'm not good
enough at reading core syntax to be able to see what GHC is doing
with it.
optimization for
On 13 Apr 2006 03:27:03 -, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
Creighton Hogg wrote:
No instance for (MatrixProduct a (Vec b) c)
arising from use of `*' at interactive:1:3-5
Probable fix: add an instance declaration for (MatrixProduct a
(Vec b) c)
In
On 2006-04-13, Martin Sulzmann [EMAIL PROTECTED] wrote:
I believe that GHC's overlapping instance extensions
effectively uses inequalities.
Why do you think that 'inequalities' model 'best-fit'?
instance C Int -- (1)
instance C a-- (2)
under a 'best-fit' instance reduction
I grabbed the source code to Haddock, but GHC doesn't like the #if's
and the #endif's. What can I do with these?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 4/13/06, Jason Dagit [EMAIL PROTECTED] wrote:
Try using passing -cpp to ghc when you compile.
Jason
Thanks. Will do.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Creighton Hogg posed the following problem. Given a rather
straightforward matrix multiplication code
-- The elements and the size
data Vec a = Vec (Array Int a) Int deriving (Show,Eq)
type Matrix a = (Vec (Vec a))
class MatrixProduct a b c | a b - c where
(*) :: a - b - c
instance
Hi,
I'm about to start playing with HWS-WP (web server + plugins). It
relies on RuntimeLoader:
http://www.algorithm.com.au/wiki/hacking/haskell.ghc_runtime_loading
I grabbed the example and built it (only one minor tweak to imports
to get it to build) but it doesnt quite work:
$
51 matches
Mail list logo
