For those in Vancouver, a short announcement about the recently created
Haskell Programmers Group and a meeting scheduled for next Monday, July
21st.
http://groups.google.com/group/hugvan
Future group announcements will be posted on this Google Groups site, so
feel free to join the group
I have reached an impasse in designing a Haskell API for the google's
protocol-buffers data language / format. (
http://code.google.com/apis/protocolbuffers/docs/overview.html )
The messages in protobuf are defined in a namespace that nests in the usual
hierarchical OO style that Java
And there is no way ghc can compile these in separate modules.
I may be being redundant here, but you may not know that GHC actually
can compile mutually recursive modules. See
http://www.haskell.org/ghc/docs/latest/html/users_guide/separate-compilation.html#mutual-recursion
. Of course, this is
I have a problem with applying a type constraint in the
constructor of a GADT...I wrote some type level code for sets
using empty types and fundeps, along the lines of Conrad Parker's
Instant Insanity and Oleg's Lightweight Static Resources. At this
level things works OK so I have empty types
Hello,
data LSet t where
Nil :: LSet Nil
--either add the new element or do nothing
Ins :: (Member a t b
, If b (LSet t) (LSet (a ::: t)) r)
= L a - LSet t - r
The constructor Ins needs to return an LSet. Maybe try replacing
occurrences of r with (LSet r).
At Tue, 15 Jul 2008 09:43:40 -0400,
Jeff Polakow wrote:
Hello,
Hi Jeff,
data LSet t where
Nil :: LSet Nil
--either add the new element or do nothing
Ins :: (Member a t b
, If b (LSet t) (LSet (a ::: t)) r)
= L a - LSet t - r
The constructor Ins
Hello,
data LSet t where
Nil :: LSet Nil
--either add the new element or do nothing
Ins :: (Member a t b
, If b (LSet t) (LSet (a ::: t)) r)
= L a - LSet t - r
The constructor Ins needs to return an LSet. Maybe try replacing
occurrences of
At Tue, 15 Jul 2008 10:02:23 -0400,
Jeff Polakow wrote:
[...]
Type classes are open so there is nothing to prevent you from adding another
instance for If, perhaps in a different module, which returns some arbitrary
type.
I see what you mean...so I tried to make Ins return an LSet of
Hello,
data LSet t where
Nil :: LSet Nil
Ins :: (Member a t b
, If b t (a ::: t) r)
= L a - LSet t - LSet r
Try replacing both original occurrences of r, i.e. (untested)
Ins :: (Member a t b, If b t (a ::: t) (LSet r)) = L a - LSet t -
LSet r
-Jeff
Ah, a teachable moment. One of us is not entirely correct about what GHC can do
with this example. Hopefully I am wrong, but my experiments...
Max Bolingbroke wrote:
And there is no way ghc can compile these in separate modules.
I may be being redundant here, but you may not know that GHC
Thanks for the fix. I have gotten the darcs version and I am compiling...
Niklas Broberg wrote:
Hi all,
I'm pleased to report that haskell-src-exts is now updated to
understand Template Haskell syntax (it used to understand pre-6.4 TH,
but now it works with the current version). At least I
On Tue, 15 Jul 2008, Chris Kuklewicz wrote:
Consider these 3 files:
A.hs:
module A(A) where
import B(B)
data A = A B
B.hs
module B(B) where
import A(A)
data B = B A
Main.hs
module Main where
import A
import B
main = return ()
Sooner or later you want generalize your datatypes. Then
Chris Kuklewicz wrote:
There is no way to create a A.hs-boot file that has all of
(1) Allows A.hs-boot to be compiled without compiling B.hs first
(2) Allows B.hs (with a {-# SOURCE #-} pragma) to be compiled after
A.hs-boot
(3) Allows A.hs to compiled after A.hs-boot with a consistent
What about generating the verbose accessor/single module code, and
then creating a hierarchical module space as well, all importing your
Base module, and reexporting the data types you want as well as less
verbosely named accessor functions? Of course, this will break record
update syntax,
On Wed, Jul 16, 2008 at 12:54 AM, Henning Thielemann
[EMAIL PROTECTED] wrote:
Sooner or later you want generalize your datatypes. Then you can define
data A b = A b
and you do not need to import B any longer. I do not know if this is a
generally applicable approach, but it helped me in some
Is there a library out there that will allow me to remote-control the
firefox or mozilla browsers, e.g. change the current page, open a new
tab?
--
I try to take things like a crow; war and chaos don't always ruin a
picnic, they just mean you have to be careful what you swallow.
-- Jessica
Selenium (http://selenium.openqa.org/) might do what you want.
The bindings were announced on this list a little while ago
(http://tinyurl.com/se-bindings)
On Tue, Jul 15, 2008 at 3:12 PM, Jefferson Heard
[EMAIL PROTECTED] wrote:
Is there a library out there that will allow me to remote-control
jefferson.r.heard:
Is there a library out there that will allow me to remote-control the
firefox or mozilla browsers, e.g. change the current page, open a new
tab?
Yeah, use the haskell selenium bindings, on hackage.haskell.org
--- Don
___
Thanks, Rahul, Don. These work...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
And what if writing new application? Has anybody experience with enterprise
application in functional language? Is it really clearer? I can see a
advantage in using Scala but it doesn't have some features from Haskell or
CAL or requires more code to write. Or better has anybody experience with
fero wrote:
And what if writing new application? Has anybody experience with enterprise
application in functional language? Is it really clearer? I can see a
advantage in using Scala but it doesn't have some features from Haskell or
CAL or requires more code to write. Or better has anybody
How are anchor references in Haddock supposed to work?
When I use Dir.Mod#foo, the resulting HTML contains:
A HREF=Dir-Mod#foo.html
instead of the more desirable:
A HREF=Dir-Mod.html#foo
User error or bug?
thanks,
-m
___
Haskell-Cafe mailing
On Tue, Jul 15, 2008 at 12:21:16PM +0100, Chris Kuklewicz wrote:
I have reached an impasse in designing a Haskell API for the google's
The messages in protobuf are defined in a namespace that nests in the usual
hierarchical OO style that Java encourages.
To avoid namespace conflicts, I made a
Greetings
I am trying to import some functions from a windows DLL. I am getting
strange errors. (This used to work with previous versions of GHC. 6.6
I think.).
This is my import statement:
foreign import stdcall ace.h AdsConnect adsConnect' :: CString -
Ptr CInt - IO CInt
This is the build
On 2008.07.15 13:59:32 -0700, Mike Gunter [EMAIL PROTECTED] scribbled 0.2K
characters:
How are anchor references in Haddock supposed to work?
When I use Dir.Mod#foo, the resulting HTML contains:
A HREF=Dir-Mod#foo.html
instead of the more desirable:
A HREF=Dir-Mod.html#foo
User
John Meacham [EMAIL PROTECTED] wrote:
Chris Kuklewicz wrote:
I have reached an impasse in designing a Haskell API for the
google's The messages in protobuf are defined in a namespace
that nests in the usual hierarchical OO style that Java
encourages.
To avoid namespace conflicts, I
For the purpose of experimenting with NDP I went through the
process of getting the GHC head from darcs.haskell.org. As
specified in the developer wiki[1], using darcs get is basically
not possible because there're so many patches. So I downloaded
On 2008 Jul 15, at 20:45, Austin Seipp wrote:
For the purpose of experimenting with NDP I went through the
process of getting the GHC head from darcs.haskell.org. As
specified in the developer wiki[1], using darcs get is basically
not possible because there're so many patches. So I downloaded
On Tue, 2008-07-15 at 19:45 -0500, Austin Seipp wrote:
For the purpose of experimenting with NDP I went through the
process of getting the GHC head from darcs.haskell.org. As
specified in the developer wiki[1], using darcs get is basically
not possible because there're so many patches. So I
Dear Group,
I've spend the last few days figuring out the solution to Euler Problem 201 in
haskell. I first tried a relatively elegant approach based on Data.Map but
the performance was horrible. I never actually arrived at the answer. I then
rewrote the same algorithm using STUArrays and it
30 matches
Mail list logo
