Am 12.05.20 um 23:29 schrieb Henning Thielemann:
> A stack overflow sounds like unlimited recursion and thus like a
> programming error.
Perhaps it was just one recursion to many? Computer memory is limited.
Heap overflow is also quite possible even with a program that is
provably terminating. I
Am 31.08.2018 um 11:57 schrieb Sven Panne:
> Am Fr., 31. Aug. 2018 um 11:11 Uhr schrieb Sam Halliday <
> sam.halli...@gmail.com>:
>
>> [...] It would make a lot of sense for the
>> "unregistered" sources to be made available as an optional download
Note that the term is "unregisterized" which
ested. I probably failed to reproduce easily, and then forgot.
> But it still definitely happens.
>
> On Wed, Mar 22, 2017 at 3:59 PM, Ben Franksen <ben.frank...@online.de> wrote:
>> This is what I get after removing a file from the working tree and also
>> from the cabal f
Sorry for late comment.
Am 12.06.2016 um 14:24 schrieb Joachim Breitner:
> Am Samstag, den 11.06.2016, 12:12 -0700 schrieb Michael Burge:
> I propose allowing an optional single extra comma at the end in module
> declarations, record declarations, record constructors, and list
> constructors:
>
I just noted that code like
my_config = default_config {..} where
name = my project
description = some longer text
gives me a syntax error, even if I have NamedFieldPuns and RecordWildCards
extensions enabled. It seems that these extensions only work for record
constructors and not for
Brandon Allbery wrote:
On Mon, Feb 23, 2015 at 12:59 PM, Andrew Farmer afar...@ittc.ku.edu
wrote:
I'm guessing the problem is that its not Haskell 98/2010? I think GHC
has a policy to do only what the spec says by default. Is that still
true now that AMP is implemented?
I think the
in the existing record syntax.
This deserves a fully fleshed-out proposal for Haskell' IMO.
Cheers
--
Ben Franksen
() ascii ribbon campaign - against html e-mail
/\ www.asciiribbon.org - against proprietary attachm€nts
___
Glasgow-haskell-users
ROTFL!
Ben
Gershom B wrote:
The records discussion has been really complicated and confusing. But
I have a suggestion that should provide a great deal of power to
records, while being mostly[1] backwards-compatible with Haskell 2010.
Consider this example:
data A a = A{a:a, aa::a, aaa
Simon Marlow wrote:
On 12/10/2009 09:04, Serge D. Mechveliani wrote:
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 ?
Release notes here,
Brent Yorgey wrote:
What's the canonical way to install a version of ghc but not have it
be the default? i.e., I'd like to try testing this release candidate
but I want to have to call it explicitly; I want 'ghc', 'ghc-pkg'
etc. to still be aliases to ghc-6.10.4, instead of being overwritten
Chris Kuklewicz wrote:
And really folks, the waitQSem(N) and signalQSem(N) should be exception
safe and
this is not currently true. They should all be using the modifyMVar_
idiom — currently an exception such as killThread between the take and put
will leave the semaphore perpetually empty
This is the code:
{-# OPTIONS -fglasgow-exts #-}
import Foreign
type X u = Ptr ()
foreign import ccall bla :: (forall u. X u) - IO ()
I know of course that I must not use fancy types in foreign imports. I
forgot for a moment and instead of an error message got:
b...@sarun ghci Bug3
GHCi,
Hi
the attached module is a much reduced version of some type-level assurance
stuff (inspired by the Lightweight Monadic Regions paper) I am trying to
do. I am almost certain that it could be reduced further but it is late and
I want to get this off my desk.
Note the 4 test functions, test11 ..
My ghc(i) crashes when using STM data invariants. This little piece of code
demonstrates the problem:
module Bug where
import Control.Concurrent.STM
test = do
x - atomically $ do
v - newTVar 0
always $ return True -- remove this line and all is fine
return v
atomically (readTVar
Brandon S. Allbery KF8NH wrote:
On 2008 Jun 12, at 16:58, Dominic Steinitz wrote:
Ok but doesn't that rebuild everything not just the bits that have
changed?
Enough stuff usually changes that it's necessary (and for whatever
reason dependencies don't catch enough of it).
Recursive Make
David Leuschner wrote:
If I write simple program just printing a non-ASCII string to the terminal
or to a file I'd expect that I can read it on the screen or using my
favorite text editor without having change anything -- neither in my
terminal nor in my program. When I run the program on my
16 matches
Mail list logo
