#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#4292: Windows installer (6.12.3) issues
-+--
Reporter: claus | Owner:
Type: bug | Status: new
Priority: normal| Component: None
#4293: Utility function for quasi-quoters: reading files
-+--
Reporter: jonasduregard | Owner:
Type: proposal | Status: new
Priority: normal
#4294: hClose003 test failes on Solaris/OpenBSD on i386/x86 host
-+--
Reporter: kgardas | Owner:
Type: bug | Status: new
Priority: normal
#4294: hClose003 test failes on Solaris/OpenBSD on i386/x86 host
-+--
Reporter: kgardas | Owner: igloo
Type: bug | Status: new
Priority: normal
#4290: hClose002 test fails on Solaris/x86 due to bad expected output
+---
Reporter: kgardas | Owner: igloo
Type: bug | Status: new
Priority: normal | Component: Test
#816: Weird fundep behavior (with -fallow-undecidable-instances)
--+-
Reporter: nibro| Owner:
Type: bug | Status: new
#816: Weird fundep behavior (with -fallow-undecidable-instances)
--+-
Reporter: nibro| Owner:
Type: bug | Status: new
#4295: Review impredicative types
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
#4295: Review impredicative types
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|Milestone:
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#4295: Review higher-rank and impredicative types
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|
#4295: Review higher-rank and impredicative types
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|
#816: Weird fundep behavior (with -fallow-undecidable-instances)
--+
Reporter: nibro
| Owner:
Type: bug
#4296: The dreaded SkolemOccurs problem
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
#4296: The dreaded SkolemOccurs problem
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#4295: Review higher-rank and impredicative types
-+--
Reporter: simonpj |Owner:
Type: bug | Status: new
Priority: normal|
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#3103: Compiling base with cabal fails.
-+--
Reporter: Lemmih|Owner:
Type: bug | Status: new
Priority: normal|Milestone:
#1409: Allow recursively dependent modules transparently (without .hs-boot or
anything)
-+--
Reporter: Isaac Dupree |Owner:
Type: feature request | Status: new
#2897: HsFFI.h is not in the default include path for hsc2hs
---+
Reporter: cjs | Type: bug
Status: new | Priority: normal
Milestone: 6.14.1|
#2897: HsFFI.h is not in the default include path for hsc2hs
---+
Reporter: cjs | Type: bug
Status: new | Priority: normal
Milestone: 6.14.1|
On Mon, Sep 6, 2010 at 2:53 AM, Simon Marlow marlo...@gmail.com wrote:
I think that should be fine - there should always be a worker thread in the
system available to handle the signal. You could probably block those
signals permanently for that thread.
Good to know, thanks.
But why does
Hi!
On Mon, Sep 6, 2010 at 9:37 AM, Simon Peyton-Jones
simo...@microsoft.com wrote:
Yes, I've spent most of the last month working on the new type checker, and
unless there's a major hiccup it'll be in GHC 7.0. We'll produce a release
candidate just before ICFP.
That's great news! So if I
Quoth Bryan O'Sullivan b...@serpentine.com,
...
That's right. There's unfortunately a ton of library code out there that was
written by people who don't know when EINTR can bite, and the mysql client
library happens to be the most prominent one that affects the Haskell
world.
I wouldn't bet
TLDI 2011
2nd CALL FOR PAPERS
The Sixth ACM SIGPLAN Workshop on
Types in Language Design and Implementation
Austin, Texas, USA
Tuesday, January 25, 2011
On Sun, Sep 5, 2010 at 9:34 PM, Jason Dagit da...@codersbase.com wrote:
The darcs project uses the Software Freedom Conservancy as a sort of
legal entity to hold on to funds and also to help in case anyone takes
legal action against darcs or darcs needs to take legal action.
I have only the
On Tue, 2010-09-07 at 02:15 +0200, Bas van Dijk wrote:
On Mon, Sep 6, 2010 at 11:55 PM, Maciej Piechotka uzytkown...@gmail.com
wrote:
Reference is class which generalizes references and monads they exists
in. It means that IORef, STRef and others can be accessed by common
interface.
That definitely makes more sense
On 07/09/2010 3:06 PM, Daniel Peebles pumpkin...@gmail.com wrote:
I was under the impression that the main reason GHC requires .hs-boot files
is that nobody has had the time or inclination to make it resolve circular
dependencies automatically, and not an
On 7 September 2010 16:09, Mathew de Detrich dete...@gmail.com wrote:
That definitely makes more sense
Well, the report (section 5.7) says you're allowed to request extra
info for mutually recursive modules...
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
I was under the impression that the main reason GHC requires .hs-boot files is
that nobody has had the time or inclination to make it resolve circular
dependencies automatically, and not an intentional design decision to encourage
good design.
Indeed. I’ve added some notes here
Mathew de Detrich deteego at gmail.com writes:
Haskell is still by far one of the best languages
to deal with concurrency/parallelism.
Sure, I fully agree.
I am using concurrency (with explicit forkIO, communication via Chan)
a lot (my Haskell application controls several external
Thanks for the clarification
On 07/09/2010 5:30 PM, Simon Peyton-Jones simo...@microsoft.com wrote:
I was under the impression that the main reason GHC requires .hs-boot files
is that nobody has had t...
Indeed. I’ve added some notes here
On Tuesday 07 September 2010 05:22:55, David Menendez wrote:
On Mon, Sep 6, 2010 at 10:22 PM, wren ng thornton w...@freegeek.org
wrote:
On 9/6/10 1:33 PM, David Menendez wrote:
For that matter, can you even describe what pure is intended to do
without reference to* or join?
As already
Looks like Applicative style. This is good, even while I don't really
know why we are seeing @ and # instead of $ and *.
How does Grempa compare with other parsing libraries/tools, such as
Parsec, Attoparsec and Happy, with regard to ease of use and
performance?
Cheers! =)
--
Felipe.
On 07/09/2010, at 6:11 PM, Johannes Waldmann wrote:
Mathew de Detrich deteego at gmail.com writes:
Haskell is still by far one of the best languages
to deal with concurrency/parallelism.
Sure, I fully agree.
I am using concurrency (with explicit forkIO, communication via Chan)
a
2010/9/7 Ben Lippmeier b...@ouroborus.net:
Though be warned you must use a recent GHC head build to get good
performance. After GHC 7.0 is out (in a few weeks) we'll be able to release a
properly stable version.
Pardon a probably stupid question, but did I miss something ?
2010/9/7 David Virebayre dav.vire+hask...@gmail.com:
2010/9/7 Ben Lippmeier b...@ouroborus.net:
Though be warned you must use a recent GHC head build to get good
performance. After GHC 7.0 is out (in a few weeks) we'll be able to release
a properly stable version.
Pardon a probably stupid
This is not stupid, but yes you missed something :)
http://www.reddit.com/r/haskell/comments/dad6j/unless_theres_a_major_hiccup_itll_be_in_ghc_70/
Oh, I saw that thread, but at the time it had vrey few comments, so I
definately missed something !
Thanks !
David.
2010/9/7 Ivan Lazar Miljenovic ivan.miljeno...@gmail.com
2010/9/7 Gábor Lehel illiss...@gmail.com:
*That said*, I actually have nothing at all against splitting the 'a
- f a' method out into a separate class if you think it's useful,
whether you call it Pointed or something else. (And
Are there any Haskell libraries that can call stored procedures in Oracle?
I've been looking at Takusen which I like, but I can't find a way to call a
stored procedure.
Thanks
Peter
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
2010/9/7 Peter Marks pe...@indigomail.net:
Are there any Haskell libraries that can call stored procedures in Oracle?
I've been looking at Takusen which I like, but I can't find a way to call a
stored procedure.
Don't you need to execute a SELECT query that calls the procedure, as in
select
From: Stephen Tetley stephen.tet...@gmail.com
On 6 September 2010 20:18, John Lato jwl...@gmail.com wrote:
Can you give an example of a Functor that doesn't have pure? I think
it's
Pointed Functors which are useful; not Functor by itself.
Strictly speaking is Pair one? The current
On 07/09/10 05:24, wren ng thornton wrote:
that other class would (most likely) be a subclass of pointed
functors. In
any case, it does mean there's something of a mismatch between
singleton vs
return/pure/point/unit.
Not quite sure what you mean by a mis-match
Of course, I'd expect
At first I regarded this as simply a bug in the Iteratee.map definition, but
like Ben, it's started to bother me a lot. I think this is precisely the
sort of issue a proper denotational semantics would fix.
Unfortunately the only general solution I see is to abandon chunking and
work strictly
Hello,
I had recently a really hard time splitting up my program into parts!
The natural, business-oriented split up drove me into a deadly circular
dependency.
I tried to solve it with:
- .hs-boot: It adds a lot of duplicated code and unecessary files, so I
gave up
- type variables: that too
corentin.dupont at ext.mpsa.com writes:
I had recently a really hard time splitting up my program into parts!
The natural, business-oriented split up drove me into a deadly circular
dependency.
perhaps you could post your code (enough of it to understand the problem)?
J.W.
Hi list,
I noticed that there are some libs / packages like atom and HJscript
which allow you to write a program in a haskell EDSL and that then
actually generates valid source code in another language. In the above
example that would be JavaScript and C.
I sure would love to be able to
A PureMT generator is immutable, so must be threaded through the monad in which
you are sampling. There are RandomSource instances provided for a few special
cases, including IORef PureMT in the IO monad. For example:
main = do
mt - newPureMT
src - newIORef mt
flips - runRVar
2010/9/7 Günther Schmidt gue.schm...@web.de:
Hi list,
I noticed that there are some libs / packages like atom and HJscript which
allow you to write a program in a haskell EDSL and that then actually
generates valid source code in another language. In the above example that
would be
Mathew de Detrich schrieb:
I had the same issue zonks ago, and I resorted to using the hs-boot file
method as well (which worked fine)
Which I guess brings me to my second point, is this something that GHC
should do automatically when it sees circular dependencies? When I asked
about it
That sort of code (stripped out):
In Game.hs:
data Game = Game { ...
activeRules :: [Rule]}
applyTo :: Rule - Game - Game
applyTo r gs = ...
In Rule.hs:
data Rule = Cond (Obs) Rule Rule
| many others..
deriving (Read, Show, Eq, Typeable)
data NamedRule
Simon Peyton-Jones schrieb:
I was under the impression that the main reason GHC requires .hs-boot
files is that nobody has had the time or inclination to make it resolve
circular dependencies automatically, and not an intentional design
decision to encourage good design.
Indeed. I’ve added
Hi,
Thanks to everybody who replied.
I see another solution: are there any hidden problems?
I found an interesting package, ChasingBottoms which contains a
function testing a value to be bottom and returning a Boolean (of
course it cannot be done without unsafePerformIO).
I borrowed the idea
I was compiling ghc-6.13.20100831 from source (*)
and then compiling repa-examples with that,
and the generated executable says (when called with +RTS -N2):
Most RTS options are disabled. Link with -rtsopts to enable them.
Where? How? When? (Did I make some error earlier?)
(*) that's the
corentin.dup...@ext.mpsa.com schrieb:
That sort of code (stripped out):
In Game.hs:
data Game = Game { ...
activeRules :: [Rule]}
applyTo :: Rule - Game - Game
applyTo r gs = ...
In Rule.hs:
data Rule = Cond (Obs) Rule Rule
| many others..
2010/9/7 Johannes Waldmann waldm...@imn.htwk-leipzig.de:
I was compiling ghc-6.13.20100831 from source (*)
and then compiling repa-examples with that,
and the generated executable says (when called with +RTS -N2):
Most RTS options are disabled. Link with -rtsopts to enable them.
Where?
Okay, I figured the immutability bit out and I got the IORef example
working, but I can't get it to work with state.
put (pureMT 0) = runRVar flipCoin
gives me two type errors: No instance for (MonadState PureMT m) and No
instance for (RandomSource m ())
runState $ put (pureMT 0) = runRVar
Henning Thielemann schlepptop at henning-thielemann.de writes:
As I see there is no cycle in the types. How about defining Game, Rule,
Obs in private modules, like Private.Game, Private.Rule, Private.Obs,
and implementing the functions in public modules like Game, Rule, Obs ?
I guess that
Yuras Shumovich shumovichy at gmail.com writes:
http://hackage.haskell.org/trac/ghc/ticket/3910
So what is the magic link-time flag to en/disable the RTS options?
It seems it would be needed for all things multi-core,
since you'd want to modify +RTS -Nx
J.W.
On Tue, 7 Sep 2010, Johannes Waldmann wrote:
Henning Thielemann schlepptop at henning-thielemann.de writes:
As I see there is no cycle in the types. How about defining Game, Rule,
Obs in private modules, like Private.Game, Private.Rule, Private.Obs,
and implementing the functions in public
Excerpts from Johannes Waldmann's message of Tue Sep 07 10:38:47 -0400 2010:
Yuras Shumovich shumovichy at gmail.com writes:
http://hackage.haskell.org/trac/ghc/ticket/3910
So what is the magic link-time flag to en/disable the RTS options?
As you mentioned earlier, -rtsopts.
It seems it
On Aug 31, 2010, at 1:57 PM, Alberto G. Corona wrote:
What happened in the first half of 2006? monads were high there!.
Wasn't that about the time Microsoft was previewing the Power Shell,
codenamed Monad?
-- James___
Haskell-Cafe
I was recently at IFL2010, where I gave a short presentation on my the
attempts to put together a local search library for Haskell.
This was reasonably well received, and I had a couple of requests for a
library.
After a couple of days sanitizing the code, and learning a bit about how
to
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/7/10 05:08 , David Virebayre wrote:
2010/9/7 Ben Lippmeier b...@ouroborus.net:
Though be warned you must use a recent GHC head build to get good
performance. After GHC 7.0 is out (in a few weeks) we'll be able to release
a properly stable
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/7/10 10:51 , Edward Z. Yang wrote:
Excerpts from Johannes Waldmann's message of Tue Sep 07 10:38:47 -0400 2010:
It seems it would be needed for all things multi-core,
since you'd want to modify +RTS -Nx
This is a good point: if RTS options
Dimitry Golubovsky schrieb:
Hi,
Thanks to everybody who replied.
I see another solution: are there any hidden problems?
I found an interesting package, ChasingBottoms which contains a
function testing a value to be bottom and returning a Boolean (of
course it cannot be done without
Hello Brandon,
Tuesday, September 7, 2010, 8:37:32 PM, you wrote:
I'd call this incomplete because programs compiled with RTS options enabled
are still insecure.
The correct fix is to ignore GHCRTS and die on +RTS *when setuid*. Since
i strongly agree
--
Best regards,
Bulat
On Sep 7, 2010, at 10:21 AM, Alex Rozenshteyn wrote:
Okay, I figured the immutability bit out and I got the IORef example working,
but I can't get it to work with state.
put (pureMT 0) = runRVar flipCoin
gives me two type errors: No instance for (MonadState PureMT m) and No
instance
That sort of code (stripped out):
In Game.hs:
data Game = Game { ...
activeRules :: [Rule]}
applyTo :: Rule - Game - Game
applyTo r gs = ...
Often, it helps to parameterize the types/functions (instead
of using recursive modules to hardcode the parameters).
Would
On Sep 7, 2010, at 5:23 AM, wren ng thornton wrote:
In particular, one of the primary complaints against the Monad class
is precisely the fact that it *fails* to mention the Functor class
as a (transitive) dependency. Why should we believe that making unit
independent from fmap will fare
Hi Dan,
This presentation is really nice.
I went over it a couple of times and I think this ppt will help me try
to use Haskell for things that I usually use Perl for :)
A quick question - import Process bombs on my GHCI(The Glorious
Glasgow Haskell Compilation System, version 6.12.3) -what do I
That's a separate module, based on System.Process --
http://code.haskell.org/~dons/code/cpuperf/Process.hs
ckkashyap:
Hi Dan,
This presentation is really nice.
I went over it a couple of times and I think this ppt will help me try
to use Haskell for things that I usually use Perl for :)
If you are using HDBC-mysql or HDBC-odbc to access MySQL databases, you may
have run into problems with your programs failing due to connection errors.
In this blog posting, I describe what's happening and how to work around it:
On Sun, Sep 5, 2010 at 9:34 PM, Jason Dagit da...@codersbase.com wrote:
The darcs project uses the Software Freedom Conservancy as a sort of
legal entity to hold on to funds and also to help in case anyone takes
legal action against darcs or darcs needs to take legal action.
I have only the
On Mon, Sep 6, 2010 at 22:49, Ben midfi...@gmail.com wrote:
Sorry to be late coming into this conversation.
Something that has bothered me (which I have mentioned to John Lato
privately) is that it is very easy to write non-compositional code due
to the chunking. For example, there is a
On Tue, 2010-09-07 at 02:15 +0200, Bas van Dijk wrote:
On Mon, Sep 6, 2010 at 11:55 PM, Maciej Piechotka uzytkown...@gmail.com
wrote:
Reference is class which generalizes references and monads they exists
in. It means that IORef, STRef and others can be accessed by common
interface.
Why not to define it for any monad, for example STM (TVars) and whatever?
2010/9/7 Maciej Piechotka uzytkown...@gmail.com
On Tue, 2010-09-07 at 02:15 +0200, Bas van Dijk wrote:
On Mon, Sep 6, 2010 at 11:55 PM, Maciej Piechotka uzytkown...@gmail.com
wrote:
Reference is class which
Good evening, cafe,
Having recently taken on maintenance of a package that depends on
template-haskell, I've been in some discussion with users and
dependencies of my package about how best to write a library that
works with multiple incompatible versions of a dependency. The two
main approaches
On Tue, 2010-09-07 at 20:36 +0200, Alberto G. Corona wrote:
Why not to define it for any monad, for example STM (TVars) and
whatever?
I'm really sorry but I fail to see what does 'it' refers to. reference
0.1 contains at this moment definitions for:
- Reference TVar STM
- Reference IORef IO
-
On 7 Sep 2010, at 18:46, Bryan O'Sullivan wrote:
If you are using HDBC-mysql or HDBC-odbc to access MySQL databases,
you may have run into problems with your programs failing due to
connection errors. In this blog posting, I describe what's happening
and how to work around it:
Do U like combinatory logic - or lambda calculus?
It still matters, or something.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Quoth Dimitry Golubovsky golubov...@gmail.com,
I see another solution: are there any hidden problems?
I found an interesting package, ChasingBottoms which contains a
function testing a value to be bottom and returning a Boolean (of
course it cannot be done without unsafePerformIO).
I
At long last and after much fruitful discussion on
librar...@haskell.org, Crypto-API is having its first release, version
0.0.0.1!
Crypto-API is a generic interface for cryptographic operations,
platform independent quality entropy acquisition, property tests and
known-answer tests (KATs) for
On 07.09.2010 20:51, Henning Thielemann wrote:
This solution looks very ugly to me. Catching 'error's is debugging, but
parser failure is kind of exception handling. I guess, the errors you
want to catch are caused by non-supported fail method, right? Can't you
use a monad transformer like
Very!
On Sep 8, 2010 4:45 AM, Jeff Rubard jeffrub...@gmail.com wrote:
Do U like combinatory logic - or lambda calculus?
It still matters, or something.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tue, Sep 7, 2010 at 2:45 PM, Dimitry Golubovsky golubov...@gmail.com wrote:
unThrow a = unsafePerformIO $ (E.evaluate a = return . Right) `E.catch`
(\e - return $ Left e)
-- or perhaps the right argument of catch could be just (return . Left)?
Quoth Donn Cave d...@avvanta.com,
...
I think it's very likely there's a simpler way to do this with
Data.Serial as written, I am just a little backwards with state
monads and that kind of thing.
OK, another look at it reveals that mplus can be used for this
application, so much more simply,
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/7/10 14:43 , Gaius Hammond wrote:
On 7 Sep 2010, at 18:46, Bryan O'Sullivan wrote:
If you are using HDBC-mysql or HDBC-odbc to access MySQL databases, you
may have run into problems with your programs failing due to connection
errors. In this
Thanks Don!
On Tue, Sep 7, 2010 at 10:51 PM, Don Stewart d...@galois.com wrote:
That's a separate module, based on System.Process --
http://code.haskell.org/~dons/code/cpuperf/Process.hs
ckkashyap:
Hi Dan,
This presentation is really nice.
I went over it a couple of times and I think
On 8 September 2010 02:37, Brandon S Allbery KF8NH allb...@ece.cmu.edu wrote:
A better fix would be to identify safe settings and only allow those (and
only via +RTS) when setuid. OTOH that's pretty much the system
configuration version of the Halting Problem :)
Or optionally, allow the
Henning,
On Tue, Sep 7, 2010 at 12:51 PM, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
This solution looks very ugly to me. Catching 'error's is debugging, but
parser failure is kind of exception handling. I guess, the errors you
want to catch are caused by non-supported fail
Hi Olle,
On Mon, Sep 6, 2010 at 12:45 PM, Olle Fredriksson
fredriksson.o...@gmail.com wrote:
There are a few other examples in the examples directory of the package,
most
notably a grammar and parser for a simple functional language similar to
Haskell.
It is possible to generate random input
Hi Ryan,
I see the generated C++ but where is the CnC front-end code?
Regards,
Vasili
On Thu, Sep 2, 2010 at 7:23 PM, Ryan Newton new...@mit.edu wrote:
Belated update:
The haskell-cnc distribution (if you grab it from darcs) now has a
front-end that parses the graph description
On Wed, Sep 1, 2010 at 12:29 PM, Daniel Fischer daniel.is.fisc...@web.dewrote:
I'm on Linux. I guess that's another point in favour of it:)
Do you happen to know why it's slower on a Mac?
I'd guess because of something to do with the system iconv.
So I tentatively believe most of the
98 matches
Mail list logo
