So there is a compatibility module in the new syb. Unfortunately,
that won't tell you about the moves and rationale. Most of the time,
you'll want Data.Data (check ghc -e ':browse Data.Data' or the
Haddock pages, or google for syb in the libraries@ archives):
$ ghc-pkg find-module
On 10/11/08, Niklas Broberg [EMAIL PROTECTED] wrote:
dons:
A breakdown of the remaing causes for DependencyFailed,
[...]
4 hsx-0.4.4
New version uploaded that works with both 6.8.3 and 6.10 rc1 (through
dark cpp magic). I doubt I need to show this trick to anyone else
since
dons:
A breakdown of the remaing causes for DependencyFailed,
[...]
4 hsx-0.4.4
---
src/hsx$ runhaskell Setup build
[snip warnings]
src\HSX\XMLGenerator.hs:71:0
Illegal type synonym family application in instance: XML m
In the instance declaration for
Could someone help me point out the problem here? The relevant code is:
instance XMLGen m = EmbedAsChild m (XML m) where
asChild = return . return . xmlToChild
class XMLGen m = EmbedAsChild m c where
asChild :: c - GenChildList m
class Monad m = XMLGen m where
type XML m
Btw, I also have problems with the haskell-src-exts that imports
Data.Generics.Instances (to generate Data and Typeable instances).
Where would these have moved to in the new base? And how would I make
the code work with both 6.8.3 and 6.10?
By having it use base-3 rather than 4.
On 10/11/08, David Menendez [EMAIL PROTECTED] wrote:
On Fri, Oct 10, 2008 at 8:40 PM, Niklas Broberg
[EMAIL PROTECTED] wrote:
src\HSX\XMLGenerator.hs:71:0
Illegal type synonym family application in instance: XML m
In the instance declaration for `EmbedAsChild m (XML m
This could be a game changer.
Great work Andrew!!
Totally agreed, on both accounts. Really interesting to see.
-- Don
What, no Arch Linux port? :-)
Cheers,
/Niklas
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
* the dependency on haskell-src-exts says any version should do, but
the one shipped in Debian Sid
(http://packages.debian.org/sid/libghc6-src-exts-dev) doesn't do, so
some extra versioning info seems to be required
Ouch, that one's pretty old. Don't the wheels of debian packaging spin
for each package you have to type (*) :
runhaskell Setup.hs configure
runhaskell Setup.hs build
sudo runhaskell Setup.hs install
(*) sometimes it'll be Setup.lhs, I'm annoyed that it's not always the
same name, can't rely on shell history :(
That's why you should always write e.g.
Hi Jean-Philippe,
Using cabal install:
cabal install yi-0.4.1
when I do this on my Windows machine, cabal-install tries to download
the unix-2.3.0.0 package, which clearly won't work. How do I get yi to
install on Windows?
Cheers,
/Niklas
___
Thanks, after installing gtk2hs and using the flags you told me I
managed to install it just fine. However...
$ yi -f pango
Launching custom yi: /home/dons/.yi/yi-x86_64-linux
yi: exception :: System.Glib.GError.GError
Anyone seen this?
Consistently on x64. The pango
The gtk frontend should not suffer from this:
yi -fgtk
C:\Documents and Settings\Niklas Brobergyi -fgtk
yi: exception :: System.Glib.GError.GError
:-(
Cheers,
/Niklas
ps. If I installed it with -f-vty -fgtk, shouldn't gtk be the default
when running? :-)
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 hope so, I
didn't have much TH code to try it on so if you find some bugs just
let me know. It wasn't
Can one represent the ''Type template Haskell syntax of
$( makeMergeable ''FileDescriptorProto )
in haskell-src.exts Language.Haskell.Exts.Syntax ?
And what are the HsReify data (e.g. HsReifyType and HsReifyDecl and
HsReifyFixity )?
I don't see any pretty print capability to
I don't think it makes sense to make a special case for requiring spaces
around $, as TH won't be in H'.
I agree, there's absolutely no need to treat $ differently in H'. The
situation will already be better than it is now, since by the special
treatment of . (and - and !, which I also agree
On 4/27/08, Paul Johnson [EMAIL PROTECTED] wrote:
I'm trying to write an AMQP framing layer. AMQP has two very similar union
types: there is a variant that contains a single item, and an array
which consists of a list of elements of the same type. So I thought I could
define a Unit type
Wow. A 10x slowdown for a very commonly used function that in 99.8% of
all use cases has no need for the extra laziness at all. No wonder
some people say Haskell is a toy language...
A toy language that is still much faster than many currently popular
languages so... Is
Hi Ben,
mapM2 :: Monad m = (a - m b) - [a] - m [b]
{-# INLINE mapM2 #-}
mapM2 fn lst = mapM2accum fn lst []
where mapM2accum _ [] accum = return accum
mapM2accum fn (x:xs) accum = do
r - fn x
mapM2accum fn xs (r:accum)
Not that it should matter for
2) Is there a reason to not use mapM3 above?
Yes, there certainly is. mapM3 is not equivalent to mapM; it is too strict:
*Main take 3 $ head $ mapM return [1,2,3,4,undefined]
[1,2,3]
*Main take 3 $ head $ mapM3 return [1,2,3,4,undefined]
[*** Exception: Prelude.undefined
So,
When I first saw this thread, my gut response was Aw gawds no, don't
touch my $ !! I love $, I use it all the time, it really helps making
code more readable and more nicely structured. I would really hate for
someone to take that away from me.
So when I came across this:
This wouldn't work,
An interesting question. What is the goal of Haskell'? Is it to, like
Python 3000, fix warts in the language in an (somewhat) incompatible
way or is it to just standardize current practice? I think we need
both, I just don't know which of the two Haskell' is.
I would hope it is both. Some
it's not refactoring! it's just adding more features - exception
handler, progress indicator, memory pool and so on. actually, code
blocks used as a sort of RAII for Haskell. are you wanna change all
those ';' when you add new variable to your C++ code?
bracketCtrlBreak
I'm very suspicious about the power/weight ratio of this change.
Normally, for simple value-level stuff like this, provide both options:
mapM / forM. = =
So how about, rather than break things, just provide an alternative to ($).
Alright, I'm not sure what the proper channel for doing
I'd love to see this functionality available cross-platform. Are there
plans for a unified library with a single API?
Yep, that's the plan (not too far) down the line, me and Lennart (who
wrote the hinotify bindings) have already discussed it to some extent.
I think the work order will be
-
Hi Emil,
On 4/17/08, Emil Axelsson [EMAIL PROTECTED] wrote:
Hello!
I'm trying to rewrite some FD classes to use associated types instead. The
Port class is for type structures whose leaves have the same type:
class Port p
where
type Leaf p
type Struct p
toList
Hi all,
I wanted to use hinotify, which gives notifications on file system
changes, but found (quite naturally) that it wouldn't run on my
windows machine (since it's a binding to the linux kernel). So I
started writing a library that would give similar functionality on
Windows. This is the first
how can I convince the Language.Haskell.Parser to accept GHC Haskell
(i.e., -fglasgow-exts, e.g. for existential types)
You use my haskell-src-exts package instead. :-)
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.3.3
Cheers,
/Niklas
* it's not exactly a drop-in replacement for Language.Haskell.* ?
(HsNewTypeDecl is different?)
* for the others, number of constructor arguments does not match, e.g.
`HsConDecl' should have 2 arguments, but has been given 3
Indeed it is like you say, these are pragmatic choices. The
Hi Niklas,
nice to meet you.
Likewise. :-)
I'm planning to extend shim to get a more featured ide (vim / emacs..
Maybe the Eclipse supporters do join as well?)
One thing I'd like to add is adding modules/ import statements to a
module.
Do you think your' parsers / resulting
Does your pretty-printer round trip?
Absolutely. I'd think a parser that can't parse what the
pretty-printer yields means you either have a broken parser or a
broken pretty-printer. :-)
Except for line numbering (it inserts but doesn't read line pragmas),
the AST should be preserved under f =
Except for line numbering (it inserts but doesn't read line pragmas),
the AST should be preserved under f = parse . pretty.
and what about (pretty . parse) = id :: String - String ?-)
Most certainly not I'm afraid. It doesn't handle pragmas at all
(treats them as comments), and by default
I would like to ask something that results in when I have the following
commands
data Color = Red | Green | Blue | Indigo | Violet deriving (Enum,Show,Read)
(read.show) x
interactive:1:1:
Ambiguous type variable `a' in the constraint:
`Read a' arising from a use of `read' at
Although I have tried to make sense what lexicographic order means I haven't
figured out. Maybe an example with a simple application of this would be
helpful. To be honest I can't understand what the symbol = really means.
= means less than or equal to.
Normally, lexicograpic order is the
HSP: big on dynamic pages. I don't want to make my webserver able
to compile Haskell code. Develop code, compile, test, make sure it's
right, then push to production every 6 months around here.
Being one of the main developers of HSP, I guess I should reply to this. :-)
HSP is indeed big
Greetings fellow Haskelleers,
I am very pleased to announce a new chapter in the Haskell Server
Pages saga. After a two-year long hiatus, while we in the team have
been busy with Other Stuff, we have resumed work on Project HSP, and
this release marks the first milestone.
=
===
Greetings fellow Haskelleers,
I am very pleased to announce a new chapter in the Haskell Server
Pages saga. After a two-year long hiatus, while we in the team have
been busy with Other Stuff, we have resumed work on Project HSP, and
this release marks the first milestone.
=
===
Hi all,
I'm getting a weird warning/error message from GHC that I don't understand:
=
$ runhaskell Setup build
Preprocessing library hsp-hjscript-0.3.4...
Building hsp-hjscript-0.3.4...
[1 of 1] Compiling HSP.HJScript ( HSP/HJScript.hs,
dist\build/HSP/HJScript.o )
It is supposed to work in 6.9. I am sorry, but type families are not
an officially supported feature in 6.8.x, and hence, any bug fixes
that requires invasive changes in the type checker will not be merged
into the 6.8 branch (and by now the 6.8 and 6.9 code bases diverged
quite a bit).
I'm pleased to announce a new release for the haskell-src-exts package.
Twice in two days even. :-)
haskell-src-exts 0.3.3 - now with support for type equality constraints.
cabal sdist:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.3.3
darcs repo:
I'm pleased to announce a new release for the haskell-src-exts package.
Twice in two days even. :-)
haskell-src-exts 0.3.3 - now with support for type equality constraints.
cabal sdist:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts-0.3.3
darcs repo:
Could this be used to add support for refactoring of source files
containing language extensions?
Because if I'm correct, the current most popular refactoring solution (I
forgot the name) for Haskell does not support extensions.
I supppose you're talking about HaRe, that Thomas Schilling
I haven't payed much attention to how much of type families is/should
be implemented for 6.8.2. What of equality constraints? The following
parses alright, but can't be used it seems.
module Foo where
class C a where
proof :: a
instance (a ~ Int) = C a
Hi all,
I'm pleased to announce a new release for the haskell-src-exts package.
haskell-src-exts 0.3.2
===
haskell-src-exts is a package for handling and manipulating Haskell
source code. It is based on the haskell-src package that is part of
the standard libraries, but
Hi all,
I'm pleased to announce a new release for the haskell-src-exts package.
haskell-src-exts 0.3.2
===
haskell-src-exts is a package for handling and manipulating Haskell
source code. It is based on the haskell-src package that is part of
the standard libraries, but
On 10/11/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
Niklas Broberg wrote:
Annotate the data type using a GADT:
data MyData a where
MyCon :: MyData a
The range of the data constructor MyCon is the entire type MyData a --
so the above data type is the regular algebraic data type, and can
| Thus I have a typical classes problem, in that I have several
| implementations of essentially the same function for different
| circumstances. The problem is, they must all operate on the same
| data type, so I cannot define them as seperate instances.
|
| Anyone got any ideas how to type
i definitely think that to rise up Haskell popularity we need now to
create web forum.
I disagree with this. I don't like web forums, I don't use web forums
if I can avoid it. They're way more work than mailing lists.
And I disagree with you. I don't like mailing lists, and I don't use
them
More potential than what we have already: URL:
http://dir.gmane.org/gmane.comp.lang.haskell.general ?
Yes. How could we use that to create subforums for particular projects
or subcommunities?
/Niklas
___
Haskell mailing list
Haskell@haskell.org
On 9/20/06, Aaron Denney [EMAIL PROTECTED] wrote:
And I disagree with you. Web forums are usenet reinvented poorly.
It's impossible to keep track of what's new, threading is either poor or
nonexistent. Mailing lists with searchable archives work well. gmane
provides a nice usenet interface to
The problem is that, when I run it with strings containing a number
more then 10 digit long, I get unexpected integers back:
*Main runP number1 1234567890 and the rest
[(1234567890, and the rest)]
*Main runP number1 12345678901 and the rest
[(-539222987, and the rest)]
This has nothing to do
Hi Lucius,
my Haskell Source eXtensions [1] (which Neil suggested earlier)
supports expressions, values and pattern matching as language
constructs, but not types.
WASH [2] supports expressions, values and (to a limited extent) types,
but not pattern matching.
XHaskell [3] has the support
c2Str c = c:[]
This function is often known as box, its much more general than char
to string, it puts any single element in a list like box
... or 'return', which is in the Prelude already, but which is even
more general, it puts any single element into any (dare I say it)
monad, where a
Hi Oleg,
Thanks a lot for your reply. I see now where my attempt went wrong and
why it couldn't work in the first place, the instances will indeed
overlap. I'm not completely satisfied with your solution though, but
seeing how you did it has lead me to the solution I want. Details
below. :-)
]
| It seems you might benefit from local functional dependencies, which
| are asserted per instance rather than for the whole class. They are
| explained in
|
| http://pobox.com/~oleg/ftp/Haskell/typecast.html
Unfortunately I come crawling back with a failure. Either my fu was
not strong
Note that there are many people who will not do work on a BSD project since a
company can just come along and take it. People are free to choose GPL or BSD
for their work and then other people are free to choose whether to derive work
from them.
But this is just the thing, isn't it? The GPL
Yes, this will surely do the trick, thanks a lot! :-)
I got as far as defining a TypeEq class myself in one of my attempts,
trying to trick the inference engine, but now seeing the full
ingenuity of the TypeCast class I realize how far from the solution I
really was. Again, thanks a million!
Hi fellow Haskelleers,
I have a tricky problem that I just can't seem to solve. The problem
is one of unresolved overloading, much like the (show . read) issue,
but unlike that particular problem I feel there should be a solution
to the one I'm wrestling with.
I've tried to strip away all the
If you want the non-labelledness to be guaranteed by the type system,
you could combine a GADT with some type level hackery. Note the flags
to GHC - they're not that scary really. :-)
In the following I've used the notion of type level booleans (TBool)
to flag whether or not an expression could
Oops, sorry, I think I'm getting too addicted to flags. ;-)
The module I wrote actually doesn't need neither overlapping nor
undecidable instances, so just -fglasgow-exts will do just fine.
/Niklas
On 8/3/06, Niklas Broberg [EMAIL PROTECTED] wrote:
If you want the non-labelledness
instance Or TFalse TFalse TFalse
instance (TBool x) = Or TTrue x TTrue
instance Or TFalse TTrue TTrue
Still no flags needed as there is no overlap between the instances.
And this time I've actually verified that it works. ;-)
/Niklas
On 8/3/06, Niklas Broberg [EMAIL PROTECTED] wrote:
Oops, sorry
On 8/3/06, Klaus Ostermann [EMAIL PROTECTED] wrote:
thanks for your suggestion. Can you explain how your solution is better than
the very simple one, i.e.,
data Exp e = Num Int | Add e e
data Labeled = L String e
newtype SimpleExp = Exp SimpleExp
newtype LabeledExp = Labelled (Exp LabeledExp)
I often find myself at odds with this choice. The reason is that I use
Haskell as a host for embedded languages, and these often come with
their own control flows. So I find myself wanting to write my own
definition of the if-then-else construct that works on terms of some
other type, e.g. tests
could even overload the
bool:
cond :: Boolean a = a - b - b
This could be done with a few hours work. But not a few minutes. Want
to put a feature request in Trac?
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Niklas
| Broberg
| Sent: 27
On 7/27/06, Doaitse Swierstra [EMAIL PROTECTED] wrote:
Given the ever increasing complexity of Haskell as understood by the
GHC, I think very
few people are looking forward to see further complications that do
not really add much.
We alreday are at a stage where first year students trying to
On 7/27/06, Niklas Broberg [EMAIL PROTECTED] wrote:
I would be happy to write up a trac-ticket for this - I could even try
to implement it in GHC. However, I'm surprised that you agree with it
so easily since it breaks some Haskell 98-ish stuff in un-nice ways.
:-)
I have now added a trac
On 7/27/06, David House [EMAIL PROTECTED] wrote:
How about we drop the idea of an auxilary cond function, and instead
just use a Boolean typeclass?
class Boolean b where
isTrue :: b - Bool
isFalse :: b - Bool
Then the semantics of if-then-else would change to something like this:
if b then
On 7/13/06, Jared Warren [EMAIL PROTECTED] wrote:
Haskell's type checking language is a logical programming language.
The canonical logical language is Prolog. However, Idealised Prolog
does not have data structures, and does Peano numbers like:
natural(zero).
natural(x), succ(x,y) :-
I encounter a strange behavior with functional dependencies. Assume we
have a class defined as
class Foo x y | x - y where
foo :: x - y
and another class
class Bar x y where
bar :: x - y - Int
and I want to write the instance declaration
instance (Foo x y, Bar y z) = Bar x z where
bar x z =
So here are some options:
1. the proposal as it is now, keeping exposed/hidden state in the
package database, don't support available
2. Add support for available. Cons: yet more complexity!
3. Drop the notion of exposed/hidden, all packages are available.
(except for
So here are some options:
1. the proposal as it is now, keeping exposed/hidden state in the
package database, don't support available
2. Add support for available. Cons: yet more complexity!
3. Drop the notion of exposed/hidden, all packages are available.
(except for
On 7/5/06, Joel Reymont [EMAIL PROTECTED] wrote:
Do you have examples of using Haskell as a DSL in an environment NOT
targeted at people who know it already?
Lava: http://www.cs.chalmers.se/~koen/Lava/
Lava is a hardware description language based upon the functional
programming language
Well, we did have a serious SoC suggestion about the industrial Hello
World application, by Isaac Jones. I guess the industrial noop would
be just as good.
/Niklas
On 6/30/06, Krasimir Angelov [EMAIL PROTECTED] wrote:
There was lots of suggestions for the future development of HNOP. Is
it too
On 6/28/06, David Roundy [EMAIL PROTECTED] wrote:
On Wed, Jun 28, 2006 at 11:52:51AM +0200, Joel Bjrnson wrote:
Hi. I came a cross the following phenomena which, at least to me,
occurs kind of awkward. The code below:
data MyData a where
DC1 :: (Show a ) = a - MyData a
GADTs don't yet
On 6/28/06, David Roundy [EMAIL PROTECTED] wrote:
On Wed, Jun 28, 2006 at 11:52:51AM +0200, Joel Bjrnson wrote:
Hi. I came a cross the following phenomena which, at least to me,
occurs kind of awkward. The code below:
data MyData a where
DC1 :: (Show a ) = a - MyData a
GADTs don't yet
On 4/27/06, Robin Bate Boerop [EMAIL PROTECTED] wrote:
But, this code:
class CC a
type C x = CC a = a x
f, g :: C a - Int
f _ = 3
g x = f $ x -- the only change
The problem is exactly the use of $. $ is an operator, not a built-in
language construct, and it has type (a - b) - a - b. No
Ehum, shameless plug. :)
On 3/6/06, Graham Klyne [EMAIL PROTECTED] wrote:
Cale Gibbard wrote:
Ah, neat, I knew about WASH, but somehow I'd missed the fact that
there was a server there :)
Interesting... at a casual glance, this looks as if it could be coming close
to
being a full stack
On 2/28/06, Ben Rudiak-Gould [EMAIL PROTECTED] wrote:
Simon Peyton-Jones wrote:
- A program that type checks can have its meaning changed by adding an
instance declaration
- Similarly adding import M() can change the meaning of a program (by
changing which instances are visible
-
Claus Reinke wrote:
most of us would be happy if instance contexts
would be required to uniquely determine the instance to be
chosen, a rather conservative extension of current practice.
I'm not so sure about the most of us, as you note yourself the
defaulting pattern is quite popular (and
On 2/10/06, Ross Paterson [EMAIL PROTECTED] wrote:
On Fri, Feb 10, 2006 at 05:20:47PM +0100, Niklas Broberg wrote:
- when looking at the definition of MonadWriter the Monoid constraint
is not strictly necessary, and none of the other mtl monads have
anything similar. Is it the assumption
Hi,
I'm playing around with associated type synonyms (ATS) [1] and the
PHRaC interpreter, trying to model existing uses of FDs. I really
enjoy working with ATS, but I've come across a situation that I don't
quite know how to handle, or indeed if it can be handled at all.
The scene is
hsp can be run in two different modes. Running the full-blown version
with runtime system will probably be hard on a professional site, you
would have to convince them to install hsp. But if you can do without
the fancier bits, in particular application-scoped data, you can run
hsp pages as
professional site to
install hsp, before I go to the cgi solution. If I want to do that, what
should I ask them to install to get a full working environment, with
access to SQL and other stuff?
Maurício
Niklas Broberg wrote:
hsp can be run in two different modes. Running the full-blown
Why is it that everything that OO steals from the functional
paradigm is always marketed as something new that will revolution the
way we program? Can't they at least give some credit where credit is
due? :-p
Regexps and XML are, IMHO, also must haves.
By the way, it should be possible to handle regular expressions in an
Haskell-like way.
Harp? :-)
http://www.cs.chalmers.se/~d00nibro/harp
/Niklas
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Why don't you use a small shell script for this?
These kinds of answers are all too abundant, no offense meant. :-)
There are lots of things that *can* be done already, that doesn't mean
that we can't improve them!
Using a shell script is a possible work-around, but certainly not
*the*
Cabal hides all packages when using GHC 6.5. Add 'base' to
build-depends in trhsx's cabal file and send a patch to the author.
Lemmih has it right, I haven't gone over and fixed this in my
packages. I guess I should...
Vadim, thanks for the patch.
/Niklas
Shameless plug warning.
From what I can tell, there are two problems with WASH:
1) Everything must be done the WASH way
2) WASH is mostly broken with GHC 6.4
Let me elaborate a bit on #1.
Let's say I have a CGI interface pre-defined; I take certain parameters
from a GET request and
I'm wondering if there is work done about discrete event simulation in
functional languages, and more specifically, Haskell DSLs. Any pointers?
Check out Yampa:
http://haskell.org/yampa/
/Niklas
___
Haskell mailing list
Haskell@haskell.org
I'm having problems building hspr from the darcs repo. The
HSPR.CGI.ErrorHandler module seems to be missing.
Indeed it was. Fixed now, thanks!
/Niklas
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
== Haskell Server Pages ==
Release early, release often. I know, I know, but better late than
never, so here it is:
Haskell Server Pages (HSP), a Haskell-based language for writing
dynamic web pages.
Webpage and darcs repo available at http://www.cs.chalmers.se/~d00nibro/hsp
Features:
*
Hi all,
when I try to use runghc to execute cgi scripts in apache (on redhat
linux), they all fail with with the message HOME: getEnv: does not
exist. I assume this means that GHC is trying to find the HOME dir of
the user for some reason, and fails since apache runs as nobody. Could
someone shed
Hi all,
I'm trying to use runghc (6.4 release version, redhat linux), but it
appears to be badly broken. It only processes the first argument given
to it, so while
---
runghc Foo.hs
hello
with Foo.hs being simply
main = putStrLn hello
---
works
I think runghc is acting like GHCi, and trying to read the file
$HOME/.ghci on startup.
Thanks, that may well be the case. Too bad you can't tell it not to,
see my other post about runghc and flags. :-(
/Niklas
___
Glasgow-haskell-users mailing list
when I try to use runghc to execute cgi scripts in apache (on redhat
linux), they all fail with with the message HOME: getEnv: does not
exist. I assume this means that GHC is trying to find the HOME dir of
the user for some reason, and fails since apache runs as nobody. Could
someone shed
when I try to use runghc to execute cgi scripts in apache (on redhat
linux), they all fail with with the message HOME: getEnv: does not
exist. I assume this means that GHC is trying to find the HOME dir of
the user for some reason, and fails since apache runs as nobody. Could
someone
I'm trying to use runghc (6.4 release version, redhat linux), but it
appears to be badly broken. It only processes the first argument given
to it...
[snip]
As a friend pointed out to me, some of this behavior may not be so
strange. Clearly, if you give arguments _after_ the specified source
Announcing haskell-src-exts 0.2:
http://www.cs.chalmers.se/~d00nibro/haskell-src-exts
haskell-src-exts (hsx) is an extension of the standard haskell-src
package, and handles most common syntactic extensions to Haskell,
including:
* Multi-parameter type classes with functional dependencies
*
1) Is Niklas Broberg's HSP. Niklas has said:
| Indeed, we have a working server that does runtime loading of HSP
| pages (i.e. Haskell apps) using hs-plugins. We'll be releasing a first
| version some time really soon, but if you want a preview just send me
| a mail. =)
I
I've just started experimenting with the new Cabal system, and I must
say it's really sweet. Thanks a lot to all involved!
After trying it on some simple tasks I have collected a few questions:
* What about 'setup uninstall'? Surely there should be an automatic
way of uninstalling packages and
-- Explicitly recursive continuation type
data C t a = forall t2 . C (C t2 a - IO t a)
If you write
data C t a = C (forall t2 . C t2 a - IO' t a),
it will compile (versions 6.2.2, 6.4). Whether that'll do exactly what you
want, I don't know :-(
Actually, I think it does. Originally
201 - 300 of 319 matches
Mail list logo
