#1043: Weird Number crashes GHCi (and Hugs) when integer-divided by -1
---+
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal
#921: Floating point with -O and -fasm is broken
+---
Reporter: guest | Owner: igloo
Type: bug | Status: closed
Priority: normal | Milestone:
#1043: Weird Number crashes GHCi (and Hugs) when integer-divided by -1
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: closed
Priority: normal
#1044: library docs on web have broken link
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal| Milestone:
On Wed, Dec 06, 2006 at 03:21:23PM +, Kirsten Chevalier wrote:
On 12/6/06, Serge D. Mechveliani [EMAIL PROTECTED] wrote:
What may consitute this strange CAF cost of 96% ?
Kirsten Chevalier [EMAIL PROTECTED]
wrote
I didn't look at your code all that carefully, but did you build the
Title: throwTo block statements considered harmful
This is a short essay to prove that the current GHC concurrency
implementation has a critical flaw.
And this is on the wiki at:
http://haskell.org/haskellwiki/GHC/Concurrency#throwTo_.26_block_statements_considered_harmful
The key problem is,
The key problem is, at least in the presence of block/unblock, that
Exceptions are never reliably delivered.
Never? Even in a function which is in a blocking state?
The implementation of asynchronous signals, as described by the paper
Asynchronous exceptions in Haskell
Simon Marlow,
Hello Cat,
Friday, December 8, 2006, 5:00:46 PM, you wrote:
The implementation of asynchronous signals, as described by the paper
Asynchronous exceptions in Haskell
Simon Marlow, Simon Peyton Jones, Andy Moran and John Reppy, PLDI'01.
is fatally inconsistent with the implementation in
| I want to make ByteArray# and MutableByteArray# parameterized over
| their element types. ByteArray# would have kind # - #, and
| MutableByteArray#, * - # - # . indexByteArray# would have the type
| (in pseudo haskell) forall (e::#). ByteArray# e - Int# - e.
Probably a bad idea. The point is
| And why isn't C a b equivalent to C a b1?
|forall a b . C a b = a - a
| and
|forall a b1 . C a b1 = a - a
| look alpha convertible to me.
You may say it's just common sense:
a) I have a dictionary of type (C a b) provided by the caller
b) I need a dictionary of type (C a
| | Also, is there a way to do something similar but for 'lazy' rather than
| | 'seq'? I want something of type
| |
| | type World__ = State# RealWorld
| |
| | {-# NOINLINE newWorld__ #-}
| | newWorld__ :: a - World__
| | newWorld__ x = realWord# -- ???
| |
| | except that I need
On Fri, Dec 08, 2006 at 03:48:22PM +, Simon Peyton-Jones wrote:
| I want to make ByteArray# and MutableByteArray# parameterized over
| their element types. ByteArray# would have kind # - #, and
| MutableByteArray#, * - # - # . indexByteArray# would have the type
| (in pseudo haskell)
Program A and B got word wrapped by mistake...damn it.
Program A
loop = block (print alive) loop
main = do tid - forkIO loop
threadDelay 1
killThread tid
the above print alive forever while killThread stays blocked.
Program B
loop = block (print alive) loop yield
There may be a heuristic that would help more programs to go through... but
I prefer asking the programmer to make the desired behaviour explicit.
Simon
How can the user make this explicit?
With the
class C a b where
op :: a - a
instance C Int Int where
op a = -a
test d = op d
Rene de Visser wrote:
There may be a heuristic that would help more programs to go through... but
I prefer asking the programmer to make the desired behaviour explicit.
Simon
How can the user make this explicit?
With the
class C a b where
op :: a - a
instance C Int Int where
On Fri, Dec 08, 2006 at 08:55:28AM +0100, Sven Panne wrote:
Am Donnerstag, 7. Dezember 2006 11:37 schrieb Christian Maeder:
The archive
http://www.haskell.org/ghc/dist/6.6/ghc-6.6-src-extralibs.tar.bz2
does not contain the files ControlPoint.hs and Domain.hs from directory
Hello Haskellers,
The final version of Visual Haskell 0.2 is ready:
http://www.haskell.org/visualhaskell
This is the first version that is:
- available for both VStudio 2003 and VStudio 2005
- distributed with a stable GHC version (6.6)
- the plugin itself is much more stable than its
Taral wrote:
On 12/7/06, Chris Kuklewicz [EMAIL PROTECTED] wrote:
Small clarification: You don't need a safepoint in your code. But
unblock
yield is the right code for a safepoint; the unblock (return ())
suggested by
the published paper *does not work* in my small test, while unblock
yield
I'm pleased to announce the first standalone release of ftphs.
ftphs is an FTP client and server library for Haskell.
Its features include:
* Easy to use operation
* Full support of text and binary transfers
* Optional lazy interaction
* Server can serve up a real or a virtual
hslogger 1.0.0 has been released.
hslogger is a logging framework for Haskell. Here are some of its
features:
* Each log message has a priority and a source associated with it
* Multiple log writers can be on the system
* Configurable global actions based on priority and source
Hi,
I'm pleased to announce version 1.0.0 of ConfigFile.
ConfigFile is a parser and writer for handling sectioned config files
in Haskell.
The ConfigFile module works with configuration files in a standard
format that is easy for the user to edit, easy for the programmer
to work with, yet
AnyDBM 1.0.0 has been released today.
AnyDBM is a generic DBM-type interface. It provides a generic
infrastructure for supporting storage of hash-like items with
String-to-String mappings. It can be used for in-memory or on-disk
storage.
Two simple backend drivers are included with this
I'm pleased to announce release 0.18.0 of MissingH.
This release implements the first part of the MissingH transition
discussed on haskell-cafe. Detail on the planned changes can be found
at http://software.complete.org/missingh/wiki/TransitionPlanning.
Note that not all of those changes have
Version 0.99.1 of hpodder is out. This version has been altered to be
compatible with the new MissingH, ConfigFile, and hslogger packages. It
also contains some minor bugfixes.
hpodder has a new homepage:
http://software.complete.org/hpodder
___
The following observations are not new, insightful, or gracious, but I
was lusting after the innocent +,-,* operators for my own evil ends and
was mildly curious why...
Num is such a fat and greedy class. If you want to marry Cinderella, you
have to take her ugly stepsisters too.
1) Groups
Oops, sorry. I meant to send this to haskell-cafe. My bad!
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Oh, come on. It's not that bad. Just start every module with
import Prelude()
import MyPrelude
that's what I do. There's nothing sacred about the Prelude (except a
few things used for special syntax). It just happens to be in scope.
-- Lennart
On Dec 8, 2006, at 15:04 , Dan
Motivated by some recent discussion, I thought I would explore the
possibilty of formalizing the haskell layout rule without the dreaded
parse-error clause, as in, one that can be completly handled by the
lexer.
motivated by that I have written a little program that takes a haskell
file with
On Fri, Dec 08, 2006 at 03:26:30PM +, Ian Lynagh wrote:
On Fri, Dec 08, 2006 at 02:33:47AM -0800, John Meacham wrote:
Motivated by some recent discussion, I thought I would explore the
possibilty of formalizing the haskell layout rule without the dreaded
parse-error clause, as in, one
I did see that one on the wiki; but it doesn't seem to support the
open intervals (i.e. (-inf, 3)) and I'd really like those.
That is the leading candidate right now though...
There was also this one:
http://www.dinkla.net/fp/cglib.html
It mentions rangetrees but I'm not sure if that's the
On 12/8/06, Nicolas Frisby [EMAIL PROTECTED] wrote:
I did see that one on the wiki; but it doesn't seem to support the
open intervals (i.e. (-inf, 3)) and I'd really like those.
Oh, it does. See BoundaryAboveAll and BoundaryBelowAll.
--
Taral [EMAIL PROTECTED]
You can't prove anything.
--
The time $ evaluate (sum (doTest wordList2 wordList2))
works fine for me... ...and the :set +s is gorgeous as well!
Thanks for the help!
Lennart
Lemmih wrote:
On 12/7/06, Lennart [EMAIL PROTECTED] wrote:
Hi,
with the following code, I want to measure the time being needed to
execute the
Hi Haskell'ers,
I'm trying, more as a first excercise in Haskell than anything else, to
code a simulation framework in Haskell. A simulation is a bunch of
simulation state consisting of constituents (e.g. physical entities like a
ball or properties like temperature), on which agents (e.g.
Dear Kurt,
I'm trying, more as a first excercise in Haskell than anything else,
to code a simulation framework in Haskell.
I don't have the time to respond to your mail in detail right now,
but you might want to have a look at the work on Fran (functional
reactive animation), FRP (Functional
Since the MissingH discussion took place on this list, I thought I
should update you all on the status.
First off, MissingH now has a new Trac-based homepage, complete with
wiki, Darcs repository information, source browser, bug tracker, etc.
It's at http://software.complete.org/missingh
On 12/7/06, J. Garrett Morris [EMAIL PROTECTED] wrote:
foo :: ErrorT String IO Int
Since ErrorT String IO Int is not the same as IO, you can't use IO
operations directly. In this case, you want:
a - lift getLine
You want:
r - runErrorT foo
Wow! I found your help terrific!
Title: throwTo block statements considered harmful
This is a short essay to prove that the current GHC concurrency
implementation has a critical flaw.
And this is on the wiki at:
http://haskell.org/haskellwiki/GHC/Concurrency#throwTo_.26_block_statements_considered_harmful
The key problem is,
Hello Krasimir,
Friday, December 8, 2006, 11:12:26 AM, you wrote:
The final version of Visual Haskell 0.2 is ready:
- distributed with a stable GHC version (6.6)
how about bundlng it with up-to-date GHC 6.6 build (which've fixes a lot of
problems) or, better, allow to use it with
It is already bundled with slightly newer version of GHC-6.6. There
was a bug that had to be fixed in order to have working Visual
Haskell. Visual Haskell is dependent of GHC API and you can't simply
use it with different GHC version.
Cheers,
Krasimir
On 12/8/06, Bulat Ziganshin [EMAIL
Hello Krasimir,
Friday, December 8, 2006, 4:30:31 PM, you wrote:
It is already bundled with slightly newer version of GHC-6.6. There
was a bug that had to be fixed in order to have working Visual
Haskell. Visual Haskell is dependent of GHC API and you can't simply
use it with different GHC
You can replace just libHSrts.a in your Visual Haskell directory and
it should work. I will release a new VSHaskell after GHC-6.6.1
release. If the .hi format is still the same in the last GHC-6.6
revision then you should safely replace everything.
Cheers,
Krasimir
On 12/8/06, Bulat Ziganshin
Hello Kurt,
Friday, December 8, 2006, 1:11:35 PM, you wrote:
I'm trying, more as a first excercise in Haskell than anything else, to
class Activity a c where
seems like your goes from OOP world? :) type classes are pretty rare birds
in Haskell programs. There are other ways to implement such
Hello Krasimir,
Friday, December 8, 2006, 4:42:48 PM, you wrote:
You can replace just libHSrts.a in your Visual Haskell directory and
it should work. I will release a new VSHaskell after GHC-6.6.1
release. If the .hi format is still the same in the last GHC-6.6
revision then you should
| Mmm.lhs:15:1:
|Contexts differ in length
|When matching the contexts of the signatures for
| foo :: forall (m :: * - *). (Monad m) = Thing - m Int
| goo :: Thing - (Maybe Int - Int) - Int
|The signature contexts in a mutually recursive group should all be
| identical
|
|
On 12/8/06, Kurt Schelfthout [EMAIL PROTECTED] wrote:
Hi Haskell'ers,
snip
class Activity a c where
start :: c - a - Time --start of the activity (this isn't
actually dependent on c, I guess)
end :: c - a - Time --end of the activity
delta :: a - Time - c
Program A and B got word wrapped by mistake...damn it.
Program A
loop = block (print alive) loop
main = do tid - forkIO loop
threadDelay 1
killThread tid
the above print alive forever while killThread stays blocked.
Program B
loop = block (print alive) loop yield
Fantastic!
Just another bit of evidence that Haskell Cafe + one night's sleep can
save a great deal of work. :)
Thanks for pointing that out,
Nick
On 12/8/06, Taral [EMAIL PROTECTED] wrote:
On 12/8/06, Nicolas Frisby [EMAIL PROTECTED] wrote:
I did see that one on the wiki; but it doesn't
The following observations are not new, insightful, or gracious, but I
was lusting after the innocent +,-,* operators for my own evil ends and
was mildly curious why...
Num is such a fat and greedy class. If you want to marry Cinderella, you
have to take her ugly stepsisters too.
1) Groups may
On Fri, Dec 08, 2006 at 12:06:05PM -0800, Dan Weston wrote:
Would it not make sense to put each of these operators (division too)
into their own individual superclasses that Num inherits? My (obviously
naive) philosophy about type classes is that operations should be
bundled only when they are
something like the attached vim script might work for small sources
(ignores all layout rules and keywords, just records increase/decrease
of indentation stack; builds up a rather large pattern of positions for
highlighting via :match).
(don't assume that this is the only, let alone the right
50 matches
Mail list logo
