On Fri, Feb 08, 2013 at 02:28:20PM +, Simon Marlow wrote:
[..]
So I think, if anything, there's pressure to have fewer major
releases of GHC. However, we're doing the opposite: 7.0 to 7.2 was
10 months, 7.2 to 7.4 was 6 months, 7.4 to 7.6 was 7 months. We're
getting too efficient at
On Wed, Jan 02, 2013 at 11:27:15PM +, Simon Peyton-Jones wrote:
I made a second mistake. I meant (LinSolvRing (UPol k)). Apologies.
| I don't know why 7.4 accepts it, but I'm not inclined to investigate...
| looks like a bug in 7.4.
|
| ghc-7.4.1 may use a special trick, but is
This is copying to the list my reply to Simon:
On Thu, Jan 03, 2013 at 12:57:02PM +, Simon Peyton-Jones wrote:
OK I have tested with today's GHC 7.6.2, which is very slightly later
than the release candidate.
When I add (EuclideanRing (UPol k)) to the signature for cubicExt, the
whole
' EuclideanRing k from Field k
?
Regards,
--
Sergei
| -Original Message-
| From: glasgow-haskell-bugs-boun...@haskell.org [mailto:glasgow-haskell-
| bugs-boun...@haskell.org] On Behalf Of Serge D. Mechveliani
| Sent: 21 December 2012 18:46
| To: Simon Peyton-Jones
| Cc: glasgow
On Wed, Jan 02, 2013 at 08:23:37PM +, Simon Peyton-Jones wrote:
| The solution is to add (EuclideanRing k) to the type sig of cubicExt.
| Then it compiles all the way up to the top.
|
| But the DoCon declares
|class (EuclideanRing a, FactorizationRing a) = Field a
On Thu, Dec 20, 2012 at 07:57:45PM +, Simon Peyton-Jones wrote:
| It looks like http://hackage.haskell.org
|
| is not valid now. Is this due to the recently announced e-mail lists
| reorganization?
It's working fine for me. No reorganisation there.
Simon
Today it is
On Wed, Jun 20, 2012 at 04:56:01PM +, Simon Peyton-Jones wrote:
Serge
I hope you are well.
I'm making a significant simplification to the type inference engine,
which will have a small knock-on effect in DoCon.
I implemented a VERY DELICATE HACK to solve your problem before, but it
On Fri, Dec 21, 2012 at 10:12:38AM +, Simon Peyton-Jones wrote:
I would not use -XMonoLocalBinds for all modules -- that will force you to do
more work.
Instead use it just for the offending Pol3_ module, via {-# LANGUAGE
MonoLocalBinds #-}
Or, probably better, give a type signature
On Fri, Dec 21, 2012 at 11:26:30AM +, Simon Peyton-Jones wrote:
I think you need to remove the 'forall a' on the type signature for dP'.
The 'a' you mean is the 'a' from the instance declaration, not a
completely fresh 'a'.
This looks reasonable.
Moreover I don't think you need the
change things in it according to the corresponding
points in d212-pre-asBug.
But I hoope d212-pre-asBug will do.
The responsible module is Pol3_.hs.
Regards,
--
Sergei
| -Original Message-
| From: Serge D. Mechveliani [mailto:mech...@botik.ru]
| Sent: 21 December 2012 11:48
On Fri, Dec 21, 2012 at 01:45:04PM +, Simon Peyton-Jones wrote:
OK, do this
* {-# LANGUAGE ScopedTypeVariables, MonoLocalBinds #-}
* import Categs( Domains1 )
* Add type sig for dP'
dP' :: (LinSolvRing (Pol a), CommutativeRing a) = Domains1 (Pol a)
Then it compiles.
You
On Wed, Jun 20, 2012 at 04:56:01PM +, Simon Peyton-Jones wrote:
Serge
I hope you are well.
I'm making a significant simplification to the type inference engine,
which will have a small knock-on effect in DoCon.
I implemented a VERY DELICATE HACK to solve your problem before, but it
Please,
how to correctly set an explicit type for a local value in the body of
a polymorphic function?
Example (tested under ghc-7.6.1):
data D a = D1 a | D2 a (a - a)
f :: Eq a = D a - a
f (D1 x) = x
f (D2 x g) = let -- y :: Eq a = a
y = g x
in if
On Wed, Oct 17, 2012 at 07:00:38PM +0300, Roman Cheplyaka wrote:
* Serge D. Mechveliani mech...@botik.ru [2012-10-17 19:37:38+0400]
But it is generally difficult for me to admit that sometimes it is
desirable to use strinctess annotation.
I programmed DoCon for 6 years, and it does
On Thu, Oct 18, 2012 at 01:54:45PM -0400, Albert Y. C. Lai wrote:
On 12-10-18 05:24 AM, Serge D. Mechveliani wrote:
And concerning this example: I am not even sure now that it worths to
setting $! there.
Because I deliberately program qRem as returning a pair (quot, rem),
and do
People,
consider the following contrived program for division with remainder:
qRem :: Int - Int - (Int, Int)
qRem m n = if m 0 || n = 0 then error \nwrong arguments in qRem.\n
else qRem' 0 m
On Wed, Oct 17, 2012 at 06:17:28PM +0300, Roman Cheplyaka wrote:
* Serge D. Mechveliani mech...@botik.ru [2012-10-17 19:02:37+0400]
People,
consider the following contrived program for division with remainder:
qRem :: Int
On Wed, Jun 20, 2012 at 04:55:59PM -, GHC wrote:
#4361: Typechecker regression
-+--
Reporter: igloo | Owner: simonpj
Type: bug |
Correction to my last letter:
Run on the second terminal./iface
--
Run on the second terminal./a.out
--
Sergei
mech...@botik.ru
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
People,
can anybody explain what incorrect may happen with the following
program which uses exchange through two Unix pipes and
unsafePerformIO ?
The pipes are created by the Unix commands
mkfifo toA; mkfifo fromA
gcc iface.c compiles the C program to
Who can tell, please, how read string :: Integer
is implemented in ghc-7.4.1 ?
Is it linked from the GMP (Gnu Multi-Precision) library?
It is suspiciosely fast :-)
In my test on 10^5 strings of length l = 5, 20 it shows the cost order
in l less than 1, as if it was O(log(l)), or
On Mon, Feb 06, 2012 at 02:33:53PM +0100, Karel Gardas wrote:
[..]
I would recommend to start here:
http://hackage.haskell.org/trac/ghc/wiki/Building/Unregisterised
Thank you.
Probably, there is something like an error on
http://hackage.haskell.org/trac/ghc/wiki/Building/Unregisterised
Dear GHC team,
For some reason ghc-7.4.1-unregisterised cannot build random-1.0.1.1
-- unlike ghc-7.4.1-default.
This is for ghc-7.4.1 built from source by ghc-7.4.1 on
Debian Linux, i386-uknown.
1. I build ghc-7.4.1 from source under the default flags,
by ghc-7.4.1, under
Dear GHC team,
I have compared for performance on DoCon of
ghc-7.4.1 registerised and unregisterised,
both made from source by ghc-7.4.1
(Debian Linux, GenuineIntel, Intel(R) Core(TM)2 CPU),
DoCon and its test compiled under -O
(-O2 is not better than -O).
Dear GHC team,
I cannot understand why do you remove the C stage in GHC.
To my mind: let the result be 3 times slower, but preserve the C code.
Because it works everyhere, and there is no real need to rewrite
the same program separately for all the existing processors
(which number may become,
On Sun, Feb 05, 2012 at 09:09:58PM +0100, Krzysztof Skrz??tnicki wrote:
GHC code still depends on RTS code (written in C by the way) which has to
be ported to a specific platform first. Native code generator offers
'registered' and 'unregistered' builds. The first are aware of specific
Dear GHC team,
I have tested ghc-7.4.0.20120126 on Linux Debian, i-386-like
by the following tests.
1. Making it by ghc-7.4.0.20111219.
2. Making it by itself.
3. Making random-1.0.1.1.
4. Making and running the DoCon-2.12 test.
5. Making and running an example under DoCon-2.12 under -prof
On Fri, Jan 27, 2012 at 11:15:46PM +, Ian Lynagh wrote:
We are pleased to announce the first release candidate for GHC 7.4.1:
http://www.haskell.org/ghc/dist/7.4.1-rc2/
The first candidate or the second?
(for the date is Jan 27).
Is ghc-7.4.0.20111219 the first candidate?
To my
Dear GHC team,
I am testing the IO operations of GHC with the Unix named pipes
[..]
Albert Y. C. Lai writes on 19 Jan 2012
Main.hs does not open fromA at all. (fromA_IO is dead code.) This causes
fifo2.c to be hung whenever it opens fromA. From the man page of mkfifo(3)
on Linux:
Dear GHC team,
I am testing the IO operations of GHC with the Unix named pipes
(in ghc-7.01 under Debian Linux).
In the below example,
the pipe pair are created bymkfifo toA
mkfifo fromA,
`main' in Main.hs opens toAfor writing,
To my question about safety of
toA_IO = openFd toA WriteOnly Nothing defaultFileFlags
fromA_IO = openFd fromA ReadOnly Nothing defaultFileFlags
toA = unsafePerformIO toA_IO
fromA = unsafePerformIO fromA_IO
axiomIO :: String - IO String
axiomIO str = do
fdWrite toA str
On Fri, Jan 13, 2012 at 12:19:34PM -0800, Donn Cave wrote:
Quoth Serge D. Mechveliani mech...@botik.ru,
...
Initially, I did the example by the Foreign Function Interface for C.
But then, I thought But this is unnatural! Use plainly the standard
Haskell IO, it has everything.
So, your
On Fri, Jan 13, 2012 at 12:19:34PM -0800, Donn Cave wrote:
Quoth Serge D. Mechveliani mech...@botik.ru,
...
Initially, I did the example by the Foreign Function Interface for C.
But then, I thought But this is unnatural! Use plainly the standard
Haskell IO, it has everything.
So, your
On Fri, Jan 13, 2012 at 04:34:37PM +0100, Chadda?? Fouch?? wrote:
On Thu, Jan 12, 2012 at 7:53 PM, Serge D. Mechveliani mech...@botik.ru
wrote:
People,
(I wonder: is this for beginn...@haskell.org ?)
I don't think so.
I need to organize a string interface for a Haskell
I thank people for the notes.
People write that the example without unsafePerformIO is desirable.
So I present the improved question and improved, pure code.
--
I need to organize a string interface for a Haskell function
, Serge D. Mechveliani mech...@botik.ruwrote:
On Fri, Jan 13, 2012 at 04:34:37PM +0100, Chadda?? Fouch?? wrote:
Now that seems interesting, but just to be clear : did you choose
this solution (and why won't you use the FFI instead) or is this just
to see how to work it out ?
Because
On Fri, Jan 13, 2012 at 10:08:04AM -0800, Donn Cave wrote:
Quoth Serge D. Mechveliani mech...@botik.ru,
[ ... why in Haskell instead of FFI ... ]
Because it is a direct and the simplest approach. Why does one need a
foreign language, if all the needed functions are in the standard
On Fri, Jan 13, 2012 at 04:34:37PM +0100, Chadda?? Fouch?? wrote:
On Thu, Jan 12, 2012 at 7:53 PM, Serge D. Mechveliani mech...@botik.ru
wrote:
[..]
I need to organize a string interface for a Haskell function
Main.axiom and a C program
fifoFromA.c
via
People,
(I wonder: is this for beginn...@haskell.org ?)
I need to organize a string interface for a Haskell function
Main.axiom and a C program
fifoFromA.c
via a pair of named pipes (in Linux, UNIX).
The pipes are created before running, by the commands
People,
GHC provides some extensions for kinds.
Does this make possible different kinds, for example, for `*' ?
Prelude.Num has * :: a - a - a.
And mathematicians also like to denote as `*'
(\cdot in TeX)
a multiplication of a vector v by a coefficient r. It is expressed by the
declaration
On Sun, Jan 01, 2012 at 07:51:39AM -0500, Ryan Newton wrote:
I haven't entirely followed this and I see that it's been split over
multiple threads.
Did cabal install random actually fail for you under
ghc-7.4.0.20111219? If so I'd love to know about it as the maintainer
of the random
Dear GHC team,
I have tested ghc-7.4.0.20111219 on Debian Linux by
1) making it from source,
2) making it by itself,
3) making DoCon-2.12 and running its test.
It looks all right.
In installing DoCon, there appears a new point of installing the package
Random, because Random has
People,
I have ghc-7.4.0.20111219 made from source and tested it on the
DoCon-2.12 application -- thanks to people for their help!
It looks all right.
This was -- with skipping the module Random.
Now it remains to add the Random package.
I have taken AC-Random Version 0.1 from hackage.
Its
Dear GHC team,
The archive
http://botik.ru/pub/local/Mechveliani/ghcBugs/ghc741candQuest.zip
contains the source of the docon-2.12 application.
ghc-7.0.1 compiles it and runs the test successfully.
ghc-7.4.0.20111219 cannot compile it.
1. It requires to add Show a to Integral a in
пDear GHC team,
ghc-7.0.1 assumes that Integral includes Show, and
ghc-7.4.0.20111219 does not assume this.
Which one agrees with Haskell-2010 ?
Regards,
--
Sergei
mech...@botik.ru
___
Glasgow-haskell-users mailing list
Dear GHC developers,
This is on ghc-7.4.0.20111219.
Compiling
---
{-# OPTIONS -fno-warn-duplicate-exports #-}
module DExport
(module DPrelude,module Categs, module SetGroup,
module RingModule, module Z, module DPair,
Dear GHC team,
ghc-7.4.0.20111219 puts the following problem of build-depends.
docon.cabal of the DoCon project has
build-depends: haskell2010, containers
And ghc-7.4.0.20111219 reports
DExport.hs:28:8:
Could not find module `Random'
It is a member of the hidden package
On Thu, Dec 22, 2011 at 09:48:06AM -0800, J. Garrett Morris wrote:
On Thu, Dec 22, 2011 at 9:44 AM, Serge D. Mechveliani mech...@botik.ru
wrote:
And ghc-7.4.0.20111219 reports
DExport.hs:28:8:
Could not find module `Random'
It is a member of the hidden package `haskell98
People,
is it possible to arrange a connected output and input (with something
like a socket) in a middle of the Haskell function?
Consider the example of sorting an integer list:
sortInt :: [Int] - [Int]
sortInt js =
let callString = sortForeign( ++ (show js) ++ )
Dear Haskell implementors,
I suggest the following small extension to the instance declaration in
the language. So far -- for Haskell + glasgow-ext.
I think that they are easy to implement.
This is the instance union proposal.
It is needed to write shorter several `old' instance declarations.
The general idea of my recent instance union proposal is that
for a single polymorphic type T, sometimes it is natural to define
several instances by a single `instances' declaration.
--
Sergei
___
Glasgow-haskell-users mailing list
Dear GHC developers,
There is a computer algebra library called DoCon and written in
Haskell (+GHC).
And I am considering the possibility to extend it with many new methods
by joining some open libraries written in C, C++, and in
Gnu Common Lisp (GCL).
1. I have seen somewhere the announcement
Simon,
thank you.
Currently, DoCon works under ghc-7.0.1.
And as I understand, the next release which is going to support DoCon
(with its heavy use of overlapping instances) will be ghc-7.2.
Regards,
Serge Mechveliani, mech...@botik.ru
On Wed, Jun 22, 2011 at 11:01:53AM -,
Simon,
thank you.
Currently, DoCon works under ghc-7.0.1.
And as I understand, the next release which is going to support DoCon
(with its heavy use of overlapping instances) will be ghc-7.2.
Regards,
Serge Mechveliani, mech...@botik.ru
On Wed, Jun 22, 2011 at 11:01:53AM -,
Dear GHC team,
I am testing the 7.02 candidate of ghc-7.0.1.20110217
-- compiled from source, compiled by itself, on Debian Linux,
i386-family.
On my DoCon program, it reports the following.
1. It requires `-fcontext-stack=_' to increase a certain stack:
...
[67 of 83] Compiling Pfact__
Dear GHC team,
I am testing the 7.02 candidate of ghc-7.0.1.20110217
-- compiled from source, compiled by itself, on Debian Linux,
i386-family.
On my DoCon program, it reports the following.
1. It requires `-fcontext-stack=_' to increase a certain stack:
...
[67 of 83] Compiling Pfact__
This is to add to my last letter.
It is curious that this 7.02 candidate stucks at оverlapping instances
only when compiling the test:
T_cubeext.hs:143:9:
Overlapping instances for LinSolvRing (UPol k)
arising from a use of `ct'
...
In earlier versions, if any of them stuck at
People,
I define, for example,
tuple42(_, y, _, _) = y,
setTuple42 (x, _, z, u) y = (x, y, z, u),
mapTuple42 f (x, y, z, u) = (x, f y, z, u).
But it looks natural to have such functions for tuples in the library.
As Haskell-2010 has zip3, zip4 ..., where are the library functions
Dear administration of www.haskell.org,
(I am sorry for not finding a more appropriate list for this letter)
In old days, my program system DoCon
(computer algebra written in Haskell) had its copy on
www.haskell.org/docon/
-- if I remember
On Mon, Dec 13, 2010 at 10:33:47AM -0800, Don Stewart wrote:
mechvel:
Dear administration of www.haskell.org,
(I am sorry for not finding a more appropriate list for this letter)
In old days, my program system DoCon
(computer algebra written in Haskell) had its copy on
In ghc-7.0.1, to import `partition', it is sufficient the line
import List (partition),
but to import `intercalate', it is needed
import Data.List (intercalate).
Does Haskell-2010 differ between List and Data.List
Looking into the on-line Haskell-2010 definition,
I see in the Library definition
20.4.3 ...
iteratef (instead of iterate f),
repeatx (instead of repeat x).
Regards,
-
Serge Mechveliani
mech...@botik.ru
On Tue, Oct 26, 2010 at 09:41:58PM +0200, John Smith wrote:
In the case of overlapping instance declarations, GHC currently requires
the less specific instance to be compiled with OverlappingInstances for the
more specific instance to be usable. This means that, for example, if you
write
zu Siederdissen wrote:
The change should not affect working programs, as it just allows you to
define further places where you say that you want an overlapping
instance.
Gruss,
Christian
* Serge D. Mechveliani mech...@botik.ru [16.11.2010 16:47]:
On Tue, Oct 26, 2010 at 09:41:58PM +0200
Dear GHC developers,
I am testing this fresh ghc-7.0.0.20101028
on Debian Linux, i386-family.
Making it from source by ghc-6.12.3 is all right.
Then, making it from source by itself reports
(here I abbreviate the messages by inserting `...')
People,
what is, in short, the relation between www.haskell.org and
new-www.haskell.org ?
Which one do I need to use for looking for the Haskell materials,
for GHC materials?
Regards,
-
Serge Mechveliani
mech...@botik.ru
___
Dear GHC developers,
I am testing this fresh ghc-7.0.0.20101028
on Debian Linux, i386-family.
Making it from source by ghc-6.12.3 is all right.
Then, making it from source by itself reports
(here I abbreviate the messages by inserting `...')
Simon P. Jones wrote recently about that ghc-6.12 takes in
account the elliplis in MkT {t1 = x, ..} when reporting about
unused bindings.
Now, here is the example:
module TT where
data T = T {t1, t2 :: Int}
f d = x where
T {t1 = x, ..} = d
ghc-6.12.2 warns about
Of Serge D. Mechveliani
| Sent: 14 October 2010 11:01
| To: Antoine Latter
| Cc: glasgow-haskell-users@haskell.org
| Subject: Re: un-used record wildcards
|
| On Wed, Oct 13, 2010 at 01:47:11PM -0500, Antoine Latter wrote:
| On Wed, Oct 13, 2010 at 1:02 PM, Serge D. Mechveliani mech
Simon P. Jones wrote recently about that ghc-6.12 takes in
account the elliplis in MkT {t1 = x, ..} when reporting about
unused bindings.
Now, here is the example:
module TT where
data T = T {t1, t2 :: Int}
f d = x where
T {t1 = x, ..} = d
ghc-6.12.2 warns about
On Wed, Oct 13, 2010 at 01:47:11PM -0500, Antoine Latter wrote:
On Wed, Oct 13, 2010 at 1:02 PM, Serge D. Mechveliani mech...@botik.ru
wrote:
Dear GHC developers,
I use the language extension of RecordWildcards, for example,
f (Foo {foo1 = n, foo2 = m
I have the two notes on the GHC library.
The docs show that
1. Map has the function for the Map inclusion relation,
and Set does not have such for sets.
2. notMember looks unnecessary, because one can write
not . Map.member k.
Regards,
-
Serge Mechveliani
On Thu, Oct 14, 2010 at 05:27:52PM +0200, Christian Maeder wrote:
Am 14.10.2010 15:44, schrieb Serge D. Mechveliani:
I have the two notes on the GHC library.
The docs show that
1. Map has the function for the Map inclusion relation,
and Set does not have such for sets.
Which
Dear GHC developers,
I use the language extension of RecordWildcards, for example,
f (Foo {foo1 = n, foo2 = m, ..}) = ...
But the complier warns about un-used values of foo3, foo4,
probably, due to the extension of
Foo {foo1 = n, foo2
Dear GHC developers,
http://botik.ru/pub/local/Mechveliani/ghcBugs/ghc701preBug.zip
contains a bug report on ghc-7.0.0.20100924
tested on Debian Linux, i386-family.
Its essence is as follows. At the fragment of
On Thu, Sep 30, 2010 at 02:13:49AM +, Simon Peyton-Jones wrote:
| (2) ghc-6.12.2 compiles docon-2.11
| (download it via http://haskell.org/ghc/docon/
| and follow install.txt
| )
I get Not found when following http://haskell.org/ghc/docon
Simon
Sorry, it is
Dear GHC developers,
http://botik.ru/pub/local/Mechveliani/ghcBugs/ghc701preBug.zip
contains a bug report on ghc-7.0.0.20100924
tested on Debian Linux, i386-family.
Its essence is as follows. At the fragment of
Dear GHC developers,
I have tested ghc-7.0.0.20100924
on Debian Linux, i386-family
on making it by ghc-6.12.3, on the DoCon test,
-- with skipping profiling.
There are visible the following changes in GHC:
(1) Usage of ./Main +RTS .. -RTS needs linking with -rtsopts
Dear people and GHC team,
I have a naive question about the compiler and library of ghc-6.12.3.
Consider the program
import List (genericLength)
main = putStr $ shows (genericLength [1 .. n]) \n
where
n = -- 10^6, 10^7, 10^8 ...
(1) When it is compiled under -O,
Dear GHC developers,
I have tested ghc-6.12.3-candidate of 6.12.2.20100521 on
Debian Linux, i386-family
on making it by ghc-6.12.2, on making it by itself
on the DoCon test,on the Dumatel test
-- with skipping profiling.
It looks all right.
-
Serge
I am sorry, please withdraw my last letter (about -M, -K):
For the test compiled under -O, 2300k in ./Main +RTS -K2300k -RTS
is the minimal memory option of this kind for the test to finish without
break.
[..]
I have confused -M...k with -K...k.
Regards,
-
Serge
Dear GHC developers,
I have tested ghc-6.12.1.20100330 on Debian Linux, i386-family,
on the DoCon test, without profilig.
It looks all right.
-
Serge Mechveliani
mech...@botik.ru
___
Glasgow-haskell-users mailing list
:
On Sun, Feb 07, 2010 at 11:39:31AM +0300, Serge D. Mechveliani wrote:
On Sat, Feb 06, 2010 at 08:24:07PM +, Ian Lynagh wrote:
On Sun, Jan 31, 2010 at 10:09:42PM +0300, Serge D. Mechveliani wrote:
I have a suggestion:
is it better for GHC to report an error on the source of kind
On Sun, Feb 07, 2010 at 01:22:07PM +0100, Daniel Fischer wrote:
Am Sonntag 07 Februar 2010 13:06:14 schrieb Serge D. Mechveliani:
I am sorry,
indeed, ghc-6.12.1 warns of Unrecognised pragma on {-# foo #-}.
I have just missed this warning.
The next question is: why it is a warning
In my last letter I wrote about the prossibility for the GHC
developers to require a keyword in any pragma, for future.
I thought that pragma is a matter of the GHC language extension.
But if it is of the Haskell standard, then, again I am sorry!
Regards,
-
Serge Mechveliani
To my
It looks like ghc-6.12.1 reports erroneous time profiling --
when the Main module of the project is made under -O.
[..]
This is for ghc-6.12.1 made from source for Debian Linux and
i386-like.
[]
The key combination
ghc $dmCpOpt -prof --make Main
shows
Dear GHC team,
It looks like ghc-6.12.1 reports erroneous time profiling --
when the Main module of the project is made under -O.
This is for ghc-6.12.1 made from source for Debian Linux and
i386-like.
Main.main calls for Complete.complete, `complete' calls for
eLoop inside its
Dear GHC team,
It looks like ghc-6.12.1 reports erroneous time profiling --
when the Main module of the project is made under -O.
This is for ghc-6.12.1 made from source for Debian Linux and
i386-like.
Main.main calls for Complete.complete, `complete' calls for
eLoop inside its
To my
Dear GHC team,
It looks like ghc-6.12.1 reports erroneous time profiling --
when the Main module of the project is made under -O.
[..]
This is for ghc-6.12.1 made from source for Debian Linux and
i386-like.
Main.main calls for Complete.complete, `complete' calls
I have a suggestion:
is it better for GHC to report an error on the source of kind
{-# foo #-}
(entered by a typo instead of {-# SCC foo #-}) ?
Currently, GHC makes the program under (-prof) in which, the foo center
occurs skipped. This
Dear GHC team,
this is on tracing in ghc-6.12.1
(made from source on Debian Linux i-386-like machine).
I wonder what is the reason for this tracing message
(starting with `Step1 ...' ):
...
equations calc =
[j i - true,
m = p - true,
p = q - true,
q = n - true,
On Thu, Jan 28, 2010 at 02:39:56PM +, Simon Marlow wrote:
On 28/01/2010 14:27, Serge D. Mechveliani wrote:
Dear GHC team,
this is on tracing in ghc-6.12.1
(made from source on Debian Linux i-386-like machine).
I wonder what is the reason for this tracing message
(starting
Dear GHC team,
I have tested ghc-6.12.0.20091121
by
1) installing its binary and making and running the DoCon and Dumatel
programs,
2) making it from source by its binary,
making and running on it the DoCon and Dumatel programs.
It looks all right.
I skipped profiling.
Regards,
Dear GHC team,
I have tested ghc-6.12.0.20091121
by
1) installing its binary and making and running the DoCon and Dumatel
programs,
2) making it from source by its binary,
making and running on it the DoCon and Dumatel programs.
It looks all right.
I skipped profiling.
Regards,
Dear GHC team,
I tried ghc-6.12.0.20091010-src.tar.bz2
on Linux, Debian, i386-*
And it cannot compile my Dumatel project. It fails at the segment:
module Bug where compose :: [a - a] - a - a
compose = foldr (.) id
class Compose a where compose1
I have downloaded ghc-6.12.0.20091010-src.tar.bz2.
But where to read the release notes?
ANNOUNCE shows ``version 6.10.1'', and lists the old features.
What is the difference of 6.12.1 w.r.to 6.10.4 ?
Regards,
-
Serge Mechveliani
mech...@botik.ru
On Sun, Oct 11, 2009 at
Dear GHC team,
I tried ghc-6.12.0.20091010-src.tar.bz2
on Linux, Debian, i386-*
And it cannot compile my Dumatel project. It fails at the segment:
module Bug where compose :: [a - a] - a - a
compose = foldr (.) id
class Compose a where compose1
People,
I need to convert Char - Int in a possibly _standard_ way for
Haskell -- and also in an efficient way. In particular, it must not
spend 100 comparisons in a look through the listing of Char.
I use ord :: Char - Int and chr :: Int - Char.
Is this all right?
Thank you in
People,
I have data DBit = Bit0 | Bit1 deriving (Eq, Ord, Enum)
data BNatural = BNat [DBit] deriving (Eq)
and want to apply things like fmap reverse (bn :: BNatural).
GHC reports an error on this usage of fmap.
It also does not allow
instance Functor BNatural
On Tue, Aug 04, 2009 at 09:12:37AM +0100, Simon Marlow wrote:
I suggest not using Haskell for your list. Put the data in a file and
read it at runtime, or put it in a static C array and link it in.
On 03/08/2009 22:09, G?nther Schmidt wrote:
Hi Thomas,
yes, a source file with a single
1 - 100 of 391 matches
Mail list logo
