Great! Are there any chances of getting support for non-Win32
platforms with Mono?
On Fri, Oct 10, 2008 at 2:12 PM, Andrew Appleyard
[EMAIL PROTECTED] wrote:
I'd like to announce the first release of Salsa, an experimental Haskell
library that allows Haskell programs to access .NET libraries.
Great! Are there any chances of getting support for non-Win32
platforms with Mono?
On Fri, Oct 10, 2008 at 2:12 PM, Andrew Appleyard
[EMAIL PROTECTED] wrote:
I'd like to announce the first release of Salsa, an experimental Haskell
library that allows Haskell programs to access .NET libraries.
On Tue, Oct 7, 2008 at 9:50 PM, David Barton [EMAIL PROTECTED] wrote:
OK, I suspect this is a real newbie error, but please have mercy. I have
downloaded and installed cabal (at least it responds to the --help command
from the command line). Yet when I do, say (to give a real example):
On Thu, Oct 9, 2008 at 8:55 PM, Duncan Coutts
[EMAIL PROTECTED] wrote:
* ForSyDe-3.0
Uses the copyDest field from CopyFlags. These record types now use an
equivalent of Maybe so they can be empty rather than always containing a
default value. It's useful, but also kind of annoying in
On Thu, Oct 9, 2008 at 3:08 PM, Mauricio [EMAIL PROTECTED] wrote:
I want to use a few libraries from hackage
and have already download and built them. Can
I install those libraries somewhere in my
home dir (I want to avoid installing as root)
so that ghc can find them?
Sure, just write:
cabal install --reinstall
On Thu, Oct 9, 2008 at 6:42 PM, Anatoly Yakovenko [EMAIL PROTECTED] wrote:
is the a way to reinstall a package with cabal install? I want to add
profiling support to a libarary.
Thanks,
Anatoly
___
Haskell-Cafe mailing
On Wed, Oct 8, 2008 at 1:10 PM, Jean-Philippe Bernardy
[EMAIL PROTECTED] wrote:
I'm pleased to announce the 0.5 release of the Yi editor.
I've just tested it and seems to work nicely, thanks.
* Unix Console front-end (Gtk2Hs frontend is not supported in this release)
What ever happened to the
ghc-pkg hide {pkg-id}
On Thu, Oct 9, 2008 at 5:53 AM, Jason Dusek [EMAIL PROTECTED] wrote:
I don't know anything about how to do that. Is this a Cabal
thing? A GHC package registration thing?
--
_jsn
___
Haskell-Cafe mailing list
On Wed, Oct 1, 2008 at 7:38 PM, Don Stewart [EMAIL PROTECTED] wrote:
Awesome, native packages now available,
http://aur.archlinux.org/packages.php?ID=20422
Thanks Don!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi everyone,
I am glad to announce the 3.0 release of ForSyDe's implementation, now
available from HackageDB.
The ForSyDe (Formal System Design) methodology has been developed with
the objective to move system design (e.g. System on Chip, Hardware and
Software systems) to a higher level of
Hi everyone,
I am glad to announce the 3.0 release of ForSyDe's implementation, now
available from HackageDB.
The ForSyDe (Formal System Design) methodology has been developed with
the objective to move system design (e.g. System on Chip, Hardware and
Software systems) to a higher level of
:; ghc -e '10e4'
10e4 = 10*10^4 = 10^5 = 1e5 = 10.0
10.0
It seems to be OK.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Sep 23, 2008 at 6:36 PM, Wolfgang Jeltsch
[EMAIL PROTECTED] wrote:
Pattern matching against the data constructor GADT specializes a to (). Since
Class uses a functional dependency, it is clear that b has to be ().
True, but it wont work if you provide () as the result and b in the
On Wed, Sep 17, 2008 at 1:03 AM, Brandon S. Allbery KF8NH
[EMAIL PROTECTED] wrote:
On 2008 Sep 16, at 10:30, Mauricio wrote:
I would like to write a Haskell pretty-printer,
using standard libraries for that. How can I
check if the original and the pretty-printed
versions are the same? For
On Sun, Sep 14, 2008 at 3:29 AM, John MacFarlane [EMAIL PROTECTED] wrote:
Some highlights of this release:
+ New GNU Texinfo writer (contributed by Peter Wang)
+ New OpenDocument XML writer (contributed by Andrea Rossato)
+ New ODT (OpenOffice document) writer
+ New MediaWiki markup writer
On Fri, Sep 12, 2008 at 9:47 PM, Jason Dusek [EMAIL PROTECTED] wrote:
I'd like to use template Haskell to include as a string in a
Haskell file. How do I do it?
I presume you mean Include a string from the outside world with a IO
action (a file, keyborad, etc ...)
--
module EmbedStr
I haven't tried to run the code, but my first bet is that, due to the
rank-2 polymorphism of ST, you should use parenthesis instead of $ in
the case of runST.
On Sun, Aug 24, 2008 at 3:25 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
colour_grid :: (Particle - IO ()) - Grid ph - IO ()
colour_grid
We'll soon (before september, hopefully) relase a deep-embedded
version of ForSyDe[1] which, among other things, has a VHDL backend
(with specific support for Altera's Modelsim and Quartus).
ForSyDe's new implementation is internally based upon the same concept
as Lava (Observable Sharing).
Hi Pablo,
On Mon, Jul 7, 2008 at 10:07 AM, Pablo Nogueira
[EMAIL PROTECTED] wrote:
GHCi infers it has type (up to renaming):
(From a1 (s (a1 x)) x, Bifunctor s, To a2 (s (a2 y)) y) = (x - y)
- a1 x - a2 y
But if I cut and paste the type into the code I get type errors:
Could not
Inspired in Oleg's ideas, I implemented the packages type-level and
parameterized-data (which includes number-parameterized vectors).
To get an idea about how they work you might want to read their
haddock documentation in hackage:
On Wed, Jun 18, 2008 at 5:41 PM, Duncan Coutts
[EMAIL PROTECTED] wrote:
And isn't 100 columns a bit non-standard for a default? I thought 80
columns had more traction? I know that's what my terminals are at...
Yeah. I'd vote for 80. That's what we use in pretty printing messages in
Cabal.
Hi,
Can anyone give a good explanation of what ribbonsPerLine means?
Maybe it would be better to simply ask for the meaning of ribbon in
this context. The documentation is totally meaningless to me:
reibbonsPerLine: Ratio of ribbon length to line length.
I asked at #haskell and frankly, I was
On Thu, May 29, 2008 at 5:15 AM, Peter Gavin [EMAIL PROTECTED] wrote:
Has anyone else tried implementing type-level integers using type families?
When I started to work on thetype-level and parameterized data
packages, I considered using type-families and GADTs, but I found
quite a few problems
On Fri, May 23, 2008 at 5:11 PM, Thomas Hartman [EMAIL PROTECTED] wrote:
I am assuming this used to work, but something changed, either in TH
itself or switching from ghc6.6 to ghc6.8.
The deriving rules of 6.8 are more restrictive in some cases.
However, the same result can be obtained in
Hi all,
GHC's documentation page [1] only points to hierarchical-libraries
documentation generated by haddock-0.8 [2].
I need the 2.0 version in order to get links in the documentation of
the project I'm working on (which needs haddock 2.0 due to the use of
quite a few GHC extensions).
Before I
On Tue, May 13, 2008 at 7:39 PM, Jules Bean [EMAIL PROTECTED] wrote:
One thing which you can't obviously do is write Read or Show instances
for Dynamic. So can we pass Dynamic data over the wire? If not,
Dynamic is limited to the context of within a single program, and
can't be used over
On Wed, May 7, 2008 at 7:47 AM, Jules Bean [EMAIL PROTECTED] wrote:
Alfonso Acosta wrote:
It would certainly be difficult map any Haskell type to VHDL, so, by
now we would be content to map enumerate algebraic types (i.e.
algebraic types whose all data constructors have arity zero, e.g
for this problem? (maybe using
some other function from Data.Generics different to dataTypeOf?)
Thanks in advance,
Alfonso Acosta
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
[EMAIL PROTECTED] wrote:
On Tue, May 6, 2008 at 12:34 PM, Alfonso Acosta
[EMAIL PROTECTED] wrote:
| So, the question is. Is there a way to figure out the arity of data
| constructors using Data.Generics ?
| I'm totally new to generics, but (tell me if I'm wrong) it seems that
| Constr
Although you could use gcc to link the code I wouldn't recommend it
(mainly for the problems you are currently having)
SImply call GHC to compile both the C and Haskell code. It will take
care of finding the headers and supplying the necessary linker
arguments.
ghc -ffi -c foo.hs myfoo_c.c
Not so long ago, I had difficulties to understand functional dependecies.
Due to the (sometimes well-grounded) prejudgement of considering
research papers as an unfriendly and obscure source of information, I
stupidly ruled out reading Mark P Jones original paper. Then I learned
I was totally
type MyState a = StateT FilePath IO a
Is there any way in which I can do without IORef in tabHandler and
commandLoop (written in red and bold, if you can see)?
How about keeping the IORef but storing it inside the state?
type MySate a = StateT (IORef FilePath) IO a
Hopefully, accessing the instance environment from Tempalte Haskell
will be possible in next GHC's release:
http://hackage.haskell.org/trac/ghc/ticket/1835
2008/3/31 jeff p [EMAIL PROTECTED]:
Hello,
Is it possible in Haskell + GHC extensions to use reflection
techniques to determine
On 3/17/08, Chris Kuklewicz [EMAIL PROTECTED] wrote:
I used both ghc-6.6.1 and macports to create a working ghc-6.8.2 on OS X
10.5.2
on a powerpc G4 laptop.
Great!
It would be awsome if a PPC/Lepoard installation package was made
available from GHC's page.
On Fri, Mar 14, 2008 at 9:58 PM, Wolfgang Jeltsch
[EMAIL PROTECTED] wrote:
Am Freitag, 14. März 2008 17:46 schrieben Sie:
I think that removing aliases completely is not a good idea. How about
generating much lower aliases for decimals (lets say until 1000),
I don't think, this is a good
On Fri, Mar 14, 2008 at 5:30 PM, Wolfgang Jeltsch
[EMAIL PROTECTED] wrote:
I have a feedback from my Grapefruit co-developer about those aliases in the
type-level package. He told me that on his machine, building this package
took about 15 minutes, obviously because the machine ran out of
Hi Emil,
Your problem is related to how are things evaluated not when. The
short answer is: if you want to make sure an expression is evaluated
before you lift it, don't use quasiquotes, call
Language.Haskell.TH.lift
On Thu, Mar 13, 2008 at 9:00 AM, Emil Axelsson [EMAIL PROTECTED] wrote:
On Thu, Mar 13, 2008 at 11:13 AM, Emil Axelsson [EMAIL PROTECTED] wrote:
I'm reading the following rule from your answer:
[|exp|] normally returns the unevaluated AST of exp. However, if exp contains
local variables, these are lifted using Language.Haskell.TH.lift (i.e.
evaluated
before
On Thu, Mar 13, 2008 at 1:35 AM, Jacob Schwartz [EMAIL PROTECTED] wrote:
I have two questions about using the Double data type and the
operations in the Floating typeclass on a computer that uses IEEE
floating point numbers.
I notice that the Floating class only provides log (presumably
On Mon, Mar 10, 2008 at 11:11 PM, Paulo J. Matos [EMAIL PROTECTED] wrote:
outputLines i = mapM (putStrLn . show) (take i $ iterate ((+) 1) 1)
However, this is in fact
outputLines :: Int - IO [()]
As others suggested you can use mapM_
Furthermore, you can simplify it a bit with some
On Mon, Mar 10, 2008 at 11:48 PM, Daniel Fischer
[EMAIL PROTECTED] wrote:
But print is (putStrLn . show), so what may be missing is (putStr . show).
That's what I meant sorry ..
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
This library provides an implementation of parameterized types using
type-level computations to implement the type parameters and emulate
dependent types.
Right now only fixed-sized vectors are provided (based on Oleg's
Number-parameterized types [1] and Frederik Eaton's Vectro library
[2])
A bit late, sorry, but you could use this:
http://www.wellquite.org/hinstaller/
On Thu, Feb 7, 2008 at 5:29 AM, Dave Bayer [EMAIL PROTECTED] wrote:
What is the best way to embed an arbitrary file in a Haskell program?
I would like to use GHC to compile command-line tools to be used with
OS
On Thu, Feb 28, 2008 at 11:23 PM, Matthew Sackman [EMAIL PROTECTED] wrote:
If however, you are as mad as I, and enjoy pushing the GHC type system
to the limit, then you may enjoy looking at the implementation in all
its glory. base10 numbers, lists, associative maps and a whole lot of
The goal of the Type-level library is to standardize and extend the
features offered by the multiple (and heterogeneous) type-level
programming implementations already around.
To date, type-level Booleans and arbitrary sized Naturals are supported.
I implemented a few things I didn't see in any
OK I'll include the module after I change the things mentioned.
BTW, I finally have an initial version of the parameterized-data package:
Darcs repository:
http://code.haskell.org/parameterized-data
Haddock documentation:
http://code.haskell.org/~fons/parameterized-data/doc/
Any
On Wed, Feb 20, 2008 at 11:26 AM, Wolfgang Jeltsch
[EMAIL PROTECTED] wrote:
Hello Fons,
why do you use the term vector? I'd say that this term is more or less wrong
for what this type is about. The distinguishing property of vectors compared
to lists is that there is addition and scalar
On Wed, Feb 20, 2008 at 10:17 PM, Bulat Ziganshin
[EMAIL PROTECTED] wrote:
Hello Alfonso,
Tuesday, February 12, 2008, 11:32:20 PM, you wrote:
Excuse me for the subject, but IMHO is absolutely true. Anyhow, the
of course, you are right, but for practical goals i may suggest just
to
On Feb 14, 2008 10:40 AM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
So we should parameterized for the package name.
That's the packagename I've been using. I'm done with a basic
implementation but I'd like to test some other things before showing
the code.
On the other hand, I think that the
2008/2/19 Wolfgang Jeltsch [EMAIL PROTECTED]:
Attached is just a quickly hacked Boolean module. Nothing very special. I'd
be happy if you could prettify this (choose better names, add documentation,
etc.). Thanks for any effort.
Thanks to you for the module. I have a few questions though.
I asked Oleg regarding the use of GADTs to emulate dependent types. My
conclusion is that I should forget about them. Here is the full
answer:
-- Forwarded message --
From: [EMAIL PROTECTED]
Date: Feb 12, 2008 8:49 AM
Subject: Re: GADTs to emulate dependent types?
To: [EMAIL
Hi Dan,
On Feb 10, 2008 6:08 PM, Dan Licata [EMAIL PROTECTED] wrote:
The ideal type for the function would be:
vector :: [a] - FSVec s a
Well, I probably didn't express myself properly when writing The
ideal type, the first type which comes to mind would have been more
accurate.
Thanks
On Feb 9, 2008 11:33 PM, Alfonso Acosta [EMAIL PROTECTED] wrote:
On Feb 8, 2008 4:10 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
example really applies here. Besides, you should be regarded :* as (,)
and not as a constructor which would take a number and a digit
Sorry for my lousy English
On Feb 9, 2008 4:08 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
So what would (D1 :* D1) :* (D2 :* D2) mean then?
Nothing. That value doesn't satisfy the Nat or Post class constraints
and should be taken into consideration.
Why should :* be provided a meaning? it is an unavoidable syntactical
On Feb 8, 2008 5:14 PM, Stefan Monnier [EMAIL PROTECTED] wrote:
How 'bout treating :+ as similar to `append' rather than similar to `cons'?
Basically treat :+ as taking 2 numbers (rather than a number and
a digit).
Interpreting it like that would certainly make make more sense. But
again, I
On Feb 8, 2008 4:10 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Am Donnerstag, 7. Februar 2008 16:31 schrieben Sie:
Even if () would be preferred from the programmers point of view (I'm
not sure how much we could reduce the number of instances though), it
makes the representation less
On Feb 9, 2008 12:28 AM, Tom Hawkins [EMAIL PROTECTED] wrote:
5) Forget embedding the DSL, and write a direct compiler.
In addition to the sharing problem, another shortcoming of Haskell
DSLs is they can not fully exploit the benefits of algebraic
datatypes. Specifically, pattern matching
Moving on to the implementation of fixed-sized vectors themselves ...
I have been trying to implement them as a GADT but I have run into
quite few problems. As a result, I'm considering to implement them
using the more-traditional phantom type-parameter approach. Anyhow,
I'd like to share those
On Feb 7, 2008 9:01 PM, Dan Weston [EMAIL PROTECTED] wrote:
This may be a GHC bug, but even though in the module
Data.TypeLevel.Num.Reps has the header
{-# LANGUAGE EmptyDataDecls, TypeOperators #-}
I still get an error with both ghc and ghci version 6.8.2 unless I throw
in the
On Feb 7, 2008 4:16 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Nat means all natural numbers except zero while Nat0 means all natural
numbers (including zero). Since in computer science, natural numbers
usually cover zero, we should use Pos instead of Nat and Nat instead of Nat0.
Sounds
On Feb 7, 2008 8:38 PM, Dan Weston [EMAIL PROTECTED] wrote:
I know that naming is arbitrary, but...
Digits in types seems ugly to me. In this case, it is also redundant.
Everyone but FORTRAN programmers counts from 0, not 1. Nat and Pos seem
clear. Nat0 could even mean Nat \ {0}, the opposite
As I pointed out a few days ago in another thread, you can benefit
from using Observable sharing [1]
Be warned that Observable sharing is a non-conservative extension of
Haskell and it breaks referential transparency.
[1] http://www.cs.chalmers.se/~koen/pubs/entry-asian99-lava.html
On Feb 8,
On Feb 6, 2008 4:32 AM, Bjorn Buckwalter [EMAIL PROTECTED] wrote:
Well, could you elaborate a little on joining efforts? The effort I
was planning to invest in my package consists mainly of creating a
.cabal file plus some logistics to get tarballs to where they have to
be.
I understand that
On Feb 7, 2008 2:30 AM, Bjorn Buckwalter [EMAIL PROTECTED] wrote:
Ok. Is this what people want -- one big hold-all library with
everything, as opposed to smaller more specialized packages? I guess I
can see advantages (real or perceived) to both approaches.
Apart from Dockins' typenats library
On Feb 5, 2008 4:10 PM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Fri, 1 Feb 2008, Aaron Denney wrote:
On 2008-02-01, Bjorn Buckwalter [EMAIL PROTECTED] wrote:
If Naturals had been sufficient for me I wouldn't have done my own
implementation (I'm unaware of any other implementation
On Feb 5, 2008 8:29 PM, Bjorn Buckwalter [EMAIL PROTECTED] wrote:
On Feb 5, 2008 2:16 PM, Alfonso Acosta [EMAIL PROTECTED] wrote:
On Feb 5, 2008 4:10 PM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Fri, 1 Feb 2008, Aaron Denney wrote:
On 2008-02-01, Bjorn Buckwalter [EMAIL
On Feb 4, 2008 12:36 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Am Samstag, 2. Februar 2008 14:54 schrieben Sie:
Again, if someone complains about the TH dependency, the aliases could
be generated by TH but saved statically in a module for each release.
Hmm, this could be a compromise
On Feb 4, 2008 8:27 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Am Montag, 4. Februar 2008 13:22 schrieben Sie:
I don't still know how many people would be interested in using the
type-level library so, again, I think it won't hurt to include the
TH-generated aliases and then change it if
On Feb 1, 2008 10:33 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Actually it would maybe be better to create common high-level
interface that could include unary, binary and decimal arithmetic so
that the library could be easily reused in other projects (people like
Bjorn, seem to be
On Feb 1, 2008 10:32 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Am Freitag, 1. Februar 2008 13:00 schrieb Alfonso Acosta:
On Jan 31, 2008 11:35 PM, Wolfgang Jeltsch [EMAIL PROTECTED]
This is essentially what I had in mind. While Oleg's implementation
needs a thrusted core, the GADT
On Feb 2, 2008 2:54 PM, Alfonso Acosta [EMAIL PROTECTED] wrote:
Just compare
f :: List (() :- D1 :- D0 :- D0 :- 1000) Int - List (() :- D1 :- D0
:- D0 :- D0) Int
I meant
f :: List (() :- D1 :- D0 :- D0 :- D0) Int - List (() :- D1 :- D0 :-
D0 :- D0) Int
sorry for the typo
On Jan 31, 2008 11:35 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Am Donnerstag, 31. Januar 2008 18:30 schrieb Dominic Steinitz:
Look at
http://sneezy.cs.nott.ac.uk/fun/feb-07/jeremy-slides.pdf
This is essentially what I had in mind. While Oleg's implementation needs
a thrusted core,
What about FixedVector for the vector library and DecTypArith (maybe
too long) or DecTypes for the type-level decimal arithmetic library?
Actually it would maybe be better to create common high-level
interface that could include unary, binary and decimal arithmetic so
that the library could be
You'd probably be interested to read
http://www.cs.chalmers.se/~koen/pubs/entry-asian99-lava.html
On Jan 31, 2008 9:56 PM, Jan-Willem Maessen [EMAIL PROTECTED] wrote:
On Jan 31, 2008, at 5:39 AM, Henning Thielemann wrote:
It seems that algorithms on graphs can be implemented particularly
Hi,
The EDSL implementation (system design) I'm working on would really
benefit from an implementation of fixed-sized vectors.
I thought this would be a generally desired ADT but it turned out I
wasn't able to find an implementation.
I was thinking about using datatype algebra plus GADTs to
On Jan 31, 2008 3:03 PM, Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Hello Fons,
interestingly, it occured to me yesterday that the graphics part of Grapefruit
would benefit from fixed sized vectors. I think we should implement some
small Cabal package which just provides this and upload it to
I remember that type-level arithmetic is already implemented somewhere,
certainly more than once, but certainly seldom in a nicely packaged form.
erm, here
http://www.haskell.org/haskellwiki/Type_arithmetic
Yep, there seem to be a few implementations around (decimal, binary,
peano) but
On Jan 31, 2008 5:47 PM, Bulat Ziganshin [EMAIL PROTECTED] wrote:
one more:
darcs get --partial --tag '0.1' http://www.eecs.tufts.edu/~rdocki01/typenats/
Thanks for the link, I had already checked this library, but using a
binary representation has the same problem as using peano numbers,
error
On Jan 19, 2008 2:36 PM, David Roundy [EMAIL PROTECTED] wrote:
Using ghc 6.6, but I've since isolated the bug as being unrelated to the
IORefs and threading, it was in an FFI binding that somehow never died
until I was testing this new code.
In case the you are creating a binding of haskell
On Jan 8, 2008 1:28 PM, David Waern [EMAIL PROTECTED] wrote:
Dear Haskell community,
I'm proud to announce the release of Haddock 2.0.0.0!
Great! I already tested a dracs spanshot before the release and seemed
to work well with TH code.
Any idea about when will hackage adopt this version to
On Jan 9, 2008 1:07 AM, Achim Schneider [EMAIL PROTECTED] wrote:
Beg pardon? Are you referring to the type of y being described with
'b' instead of 'a'?
Yes.
(a - a) - a and (b - b) - b are equivalent.
For some reason ghc uses b instead of a if you are picky about it,
just provide a
@ works as an aliasing primitive for the arguments of a function
f x@(Just y) = ...
using x in the body of f is equivalent to use Just y. Perhaps in
this case is not really useful, but in some other cases it saves the
effort and space of retyping really long expressions. And what is even
more
On Dec 28, 2007 12:21 PM, Nicholls, Mark [EMAIL PROTECTED] wrote:
So in the example given...
Is equivalent ?
Yes, it is
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi all,
dynApp allows to apply a Dynamic function to a Dynamic argument:
dynApp :: Dynamic - Dynamic - Dynamic
I don't seem to find a way (without modifying Data.Dynamic itself) to
code this function
import Data.Typeable
import Data.Dynamic
import Data.Foldable
dynApp1 :: (Typeable1
On Dec 19, 2007 9:13 PM, Neil Mitchell [EMAIL PROTECTED] wrote:
OK, If you managed to read until this point, you might have noticed
that, due to the monomorphism restriction implied by Data.Typeable, it
is impossible to build polymorphic processes.
Tom Shackell had similar issues with
of unsafe dynamics using unsafeCoerce
which allowed applying polymorphic functions to monomorphic values for
specific safe cases?
I would really appreciate any suggestions or remarks regarding my
problem/design.
Thanks in advance,
Alfonso Acosta
On Dec 19, 2007 9:13 PM, Neil Mitchell [EMAIL PROTECTED] wrote:
OK, If you managed to read until this point, you might have noticed
that, due to the monomorphism restriction implied by Data.Typeable, it
is impossible to build polymorphic processes.
Tom Shackell had similar issues with
On Dec 9, 2007 2:39 PM, pepe [EMAIL PROTECTED] wrote:
The typechecker in 6.6.1 gets confused by the ($) and loses track of
the 'freeness' of s (the thread variable) . The same code should work
fine in 6.8.1, or alternatively in 6.6.1 without the ($).
True. However, note that the release notes
True. However, note that the release notes of 6.8.1 encourage not to
rely in this new feature because it can change in the feature.
I obviously meant in the future, sorry.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I know there are some problems with Leopard (OSX 10.5) but, before
bothering compile the release, should it be expected to work on
Leopard/PPC or Leopard/Intel?
On Dec 7, 2007 1:58 PM, Ian Lynagh [EMAIL PROTECTED] wrote:
We are pleased to announce the Release Candidate phase for GHC 6.8.2.
That's good news. It also means you can set your own preferences (if
you did so with the guest account you ended up receiving mails related
to ticket you didn't create)
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
Hi all,
I don't know if this is the right place to ask but, since it's somehow
Haskell-related I decided to use haskell-cafe.
I'm cabalizing a library which, apart from my own code, has code taken
from others. As it could be expected, each piece has its own copyright
holder and (slightly)
The copyright field is free-form so you can list all the copyright
holders. You can use multiple lines. See for example:
http://hackage.haskell.org/packages/archive/bytestring/0.9.0.1/bytestring.cabal
Then for the license, use Other and specify a license file with all the
appropriate license
Hi,
Can someone shed some light on what's the state of GHC-Haddock? The
thread [1] mentions a haddock.ghc repository which doesn't exist
anymore.
Are there any plans of releasing it anytime soon?
I have a haddock-annotated library which makes massive use of TH,
making Haddock 0.8 fail
Can someone shed some light on what's the state of GHC-Haddock? The
thread [1] mentions a haddock.ghc repository which doesn't exist
anymore.
Forgot to add the reference
[1] http://www.mail-archive.com/[EMAIL PROTECTED]/msg20453.html
___
On Nov 19, 2007 10:35 AM, Simon Marlow [EMAIL PROTECTED] wrote:
pwd gives you the directory that the script was invoked *from*, not the
directory in which the script resides. This is a common problem on Unix:
there's no general way to find out the location of a binary.
Well, you can always
On Nov 19, 2007 10:51 AM, Alfonso Acosta [EMAIL PROTECTED] wrote:
Well, you can always combine the first argument of the script ($0) for
absolute paths and combine it with with pwd for relative ones.
I meant _use_ the first argument of the script ($0) for absolute paths
and combine it with pwd
on an
extended convention rather than hardcoding paths.
On Nov 19, 2007 11:40 AM, Simon Marlow [EMAIL PROTECTED] wrote:
Christian Maeder wrote:
Alfonso Acosta wrote:
On Nov 19, 2007 10:51 AM, Alfonso Acosta [EMAIL PROTECTED] wrote:
Well, you can always combine the first argument of the script ($0
On Nov 13, 2007 1:08 AM, Luke Palmer [EMAIL PROTECTED] wrote:
We want MaybeT!
I third this proposal. It would be nice having MaybeT included in mtl.
Besides, and although it's not exactly the same, you can emulate the
Maybe monad by using the Either monad (the instance is defined in
It seems you haven't the mtl package installed.
You can either get a custom package for your OS distribution or grab
it from hackage.
On Nov 11, 2007 2:29 PM, Hal Daume III [EMAIL PROTECTED] wrote:
Hi all --
Something weird just happened and I feel bad asking on the list for help
(because
1 - 100 of 171 matches
Mail list logo
