On Thu, Dec 2, 2010 at 4:39 PM, Antoine Latter aslat...@gmail.com wrote:
On Thu, Dec 2, 2010 at 3:29 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Yes, it's me. And yes, I come with yet more questions.
With Haskell 98 (or, indeed, Haskell 2010) it is impossible to define a
polymorphic
Hi,
I've encountered an interesting issue with GHC 6.12.1 and 2 in which a
small program compiles quickly without using loads of memory with
optimization turned off, but with optimization (-O1) turned on, GHC's
memory usage becomes very high (and compilation takes much much
longer).
$ time ghc
Pending an explicit response from the SFLC, I decided to ask the FSF
themselves what they thought of the Hackage/cabal situation.
Specifically, I asked this:
There is a website, 'Hackage' (http://hackage.haskell.org) that hosts
source code packages for Haskell libraries and programs. The site
Before taking any action with respect to cabal or hackage, etc., I'd
think people would want to see their explicit response.
On Thu, Mar 4, 2010 at 12:34 PM, Tom Tobin korp...@korpios.com wrote:
After politely pestering them again, I finally heard back from the
Software Freedom Law Center
Perhaps not exactly what you're after, but at least in the same vein:
http://hackage.haskell.org/package/hspread
http://www.spread.org/
On Fri, Feb 12, 2010 at 8:19 AM, Rick R rick.richard...@gmail.com wrote:
I am preparing to embark on some serious cluster oriented coding (high
availability,
On Fri, Feb 12, 2010 at 2:11 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
OK, well in that case, I'm utterly puzzled as to why both forms exist in the
first place. If TFs don't allow you to do anything that can't be done with
ATs, why have them?
My head hurts...
I think the question
What Ryan said, and here's an example of addition with ATs,
specifically (not thoroughly tested, but tested a little). The
translation to TFs sans ATs is straightforward.
class Add a b where
type SumType a b
instance Add Zero Zero where
type SumType Zero Zero = Zero
instance Add (Succ
On Wed, Feb 10, 2010 at 2:29 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
OK, so I sat down today and tried this, but I can't figure out how.
There are various examples of type-level arithmetic around the place. For
example,
http://www.haskell.org/haskellwiki/Type_arithmetic
(This
The *splicing* of patterns is considered tricky, see:
http://hackage.haskell.org/trac/ghc/ticket/1476
Implementing pattern quotations might be less tricky, but I would
imagine to make them useful, you'd have to allow splicing things
*into* them, which requires implementing pattern splicing.
I like (1) quite a lot. If radical suggestions for QQ noise reduction
are being entertained, here's another:
quotations of the form [| |] (i.e. no 'language' specified) will
use an implicit parameter* ('quasi', say) of type QuasiQuoter, if in
scope. Otherwise, they will behave as they
A variant of your suggestion would be: for any quote [|..blah..|] behave as
if the programmer had written [quasiQuoter| ...blah...|]. That is, simply
pick up whatever record named quasiQuoter is in scope. Then you'd say
import Pads( quasiQuoter )
and away you go. But you can only
Now that type-splicing works in TH, and TH has type-family support, I
was wondering if the following example should compile (with 6.12.1):
{-# LANGUAGE TemplateHaskell, MultiParamTypeClasses, TypeFamilies,
FlexibleInstances, OverlappingInstances #-}
module Sample where
import
On Wed, Jan 13, 2010 at 4:56 AM, Martin Coxall pseudo.m...@me.com wrote:
On 13 Jan 2010, at 09:51, Peter Verswyvelen wrote:
On Sun, Nov 1, 2009 at 2:57 AM, Gregory Collins g...@gregorycollins.net
wrote:
Doing OO-style programming in Haskell is difficult and unnatural, it's
true (although
On Mon, Dec 21, 2009 at 2:32 PM, Bulat Ziganshin
bulat.zigans...@gmail.comwrote:
Hello glasgow-haskell-users,
i compile my program for linux using ghc 6.6.1 (32-bit)
user of my program asks: any plans of making a static build for
linux? that one does not work under x86-64 due to
On Mon, Dec 21, 2009 at 2:49 PM, Robert Greayer robgrea...@gmail.comwrote:
On Mon, Dec 21, 2009 at 2:32 PM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello glasgow-haskell-users,
i compile my program for linux using ghc 6.6.1 (32-bit)
user of my program asks: any plans of making
On Mon, Dec 21, 2009 at 6:03 AM, Bas van Dijk v.dijk@gmail.com wrote:
Hello,
In my usb-safe[1] library I make extensive use of the ViewPatterns[2]
language extension. However I get strange warnings when using them.
See for example the following function:
resetDevice ∷ (pr `ParentOf`
sigh -- to the list this time.
On Wed, Dec 9, 2009 at 9:16 AM, Tom Tobin korp...@korpios.com wrote:
On Wed, Dec 9, 2009 at 4:59 AM, Ketil Malde ke...@malde.org wrote:
Tom Tobin korp...@korpios.com writes:
If it turns out that Hakyll *is* okay to be BSD3 licensed so
long as neither any
On Tue, Dec 8, 2009 at 4:46 PM, Tom Tobin korp...@korpios.com wrote:
On Tue, Dec 8, 2009 at 3:30 PM, Ben Franksen ben.frank...@online.de
wrote:
Ketil Malde wrote:
Your contributions could still be licensed under a different license
(e.g. BSD), as long as the licensing doesn't prevent
On Tue, Dec 8, 2009 at 5:13 PM, Robert Greayer robgrea...@gmail.com wrote:
The crux here is that the source code of hakyll, released on hackage, is
not a derivative of Pandoc (it contains, as far as I understand it, no
Pandoc source code). A compiled executable *is* a derivative of Pandoc
On Tue, Dec 8, 2009 at 7:38 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
Apologies, Robert, for you getting this twice: I forgot to CC the list
as well.
Robert Greayer robgrea...@gmail.com writes:
The crux here is that the source code of hakyll, released on hackage
On Mon, Dec 7, 2009 at 4:37 PM, Andrew Coppin
andrewcop...@btinternet.comwrote:
And I have no problem with needing to install a Haskell compiler. If I had
to install a seperate C compiler to make FFI to C work, that wouldn't seem
unreasonable either. (As it happens, GHC has a C backend, so
On Tue, Dec 1, 2009 at 8:01 PM, Michael P Mossey m...@alumni.caltech.eduwrote:
Perhaps someone could either (1) help me do what I'm trying to do, or (2)
show me a better way.
I have a problem that is very state-ful and I keep thinking of it as OO,
which is driving me crazy. Haskell is
On Tue, Dec 1, 2009 at 9:01 PM, Robert Greayer robgrea...@gmail.com wrote:
On Tue, Dec 1, 2009 at 8:01 PM, Michael P Mossey
m...@alumni.caltech.eduwrote:
Perhaps someone could either (1) help me do what I'm trying to do, or (2)
show me a better way.
I have a problem that is very state
On Wed, Nov 18, 2009 at 3:10 PM, levi greenspan.l...@googlemail.com wrote:
On Nov 18, 8:18 pm, Luke Palmer lrpal...@gmail.com wrote:
You know, another solution to the records problem, which is not quite
as convenient but much simpler (and has other applications) is to
allow local modules.
On Wed, Nov 18, 2009 at 8:15 PM, Daniel Fischer daniel.is.fisc...@web.dewrote:
Am Donnerstag 19 November 2009 01:07:37 schrieb Henning Thielemann:
Kapil Hari Paranjape schrieb:
Hello,
On Sat, 14 Nov 2009, Jaco van Iterson wrote:
Only installation with 'cabal install yi' in a Cygwin
Due to overwhelming popular demand*, BlogLiterately (version 0.2) has been
released on Hackage.
It's a simple tool for uploading posts written in markdown and (optionally)
literate Haskell to web logs. It relies heavily on Pandoc for markdown
processing, but adds a few twists like syntax
Fairly late to the party on this discussion, but this captured my attention:
On Tue, Sep 29, 2009 at 11:35 AM, Curt Sampson
c...@starling-software.comwrote:
This may be somewhat anecdotal evidence, but I disagree with both
of your statements here. I've rarely known anybody to use Java
On Mon, Aug 24, 2009 at 5:24 PM, Don Stewartd...@galois.com wrote:
I notice hoauth is packaged as LGPL. Since we use static linking in GHC,
this makes it in practice GPL. Is that the intent?
-- Don
I don't think this is 100% true -- the requirement is to allow the end
user the ability to
On Thu, Jul 16, 2009 at 2:34 PM, Andrew
Coppinandrewcop...@btinternet.com wrote:
I've been working hard this week, and I'm stumbled upon something which is
probably of absolutely no surprise to anybody but me.
Consider the following expression:
(foo True, foo 'x')
Is this expression
On Wed, Jul 15, 2009 at 2:18 PM, Max Rabkinmax.rab...@gmail.com wrote:
On Wed, Jul 15, 2009 at 7:33 PM, Cristiano
Pariscristiano.pa...@gmail.com wrote:
fib = 1:1:fib `plus` (tail fib) where plus = zipWith (+)
...
...
This indicates that you think tying the knot should be impossible in
It’s tempting to say, we should
use the original English, which is British English.
Some suggest the original English remained in Britain when the North
American colonies were founded; others claim it was brought to the
Americas by the British settlers, leaving a pale imitation back in
Britain.
I'm sure there's some important historical reason... but why isn't ''
used in something more prominent than the fgl package? I understand
why it's not used for bitwise AND in Data.Bits (I assume because the
corresponding bitwise '|' operator isn't available), but all the other
single-character
You can use QuasiQuotation, where your bracketing syntax looks like:
[$foo| blah blah blah |]
and 'foo' represents a quasi-quoter, and the stuff inside the brackets
is any arbitrary syntax recognized by it.
Meant this to go to the list...
-- Forwarded message --
From: Robert Greayer robgrea...@gmail.com
To: Ashley Yakeley ash...@semantic.org
For anyone concerned the Hackage icon
(http://hackage.haskell.org/favicon.ico) is still the old blue lambda,
not the sparkling new icon (http
On Mon, May 18, 2009 at 4:00 PM, Norman Ramsey n...@eecs.harvard.edu wrote:
P.S. The exhaustiveness checker does need improvement...
Is it documented somewhere what deficiencies the exhaustiveness
checker has (where it can report problems that don't exist or fails to
report problems that do...),
Xiao-Yong Jin xj2...@columbia.edu wrote:
Edward Kmett ekm...@gmail.com writes:
I find a hard 80 character line length limit to be
somewhat ridiculous in this
day and age. I've long since revised my personal
rule of thumb upwards towards
132, if only because I can still show two
wren ng thornton w...@freegeek.org wrote:
There is a deeper reason. Much work in typography has shown
that humans read text best when it's around 76
characters wide; if things get narrower than that then
cohesion is lost, if things get wider then it takes a long
time to acquire the
wren ng thornton wrote:
Using the FFI complicates the build process for Hugs; details are noted in
the INSTALL file. It may also complicate building on Windows (due to ccall vs
stdcall), though I'm not familiar with Windows FFI and don't have a machine
to test on.
On XP with GHC 6.10.1
Andrew Coppin wrote:
| Is there some reason why you can't have antiquoting with normal TH?
|
| I'm just trying to make sure I've understood QQ correctly...
With TH, it might not be necessary (depending on the situation)...
{-# OPTIONS_GHC -XTemplateHaskell #-}
module QT where
import
With some more context:
foo = ($expr 1 + 2)
v.
bar = [$expr| 1 + 2]
In the first example (assuming TH is enabled), $expr is a splice, which happens
at compile time. 'expr' is some value of type Q Exp (the AST for a Haskell
expression, in the quotation monad). The application of $expr to
Henning Thielemann lemm...@henning-thielemann.de wrote:
The usual example against clear separation of exceptions and errors is the
web server which catches 'error's in order to keep running.
However, the web server starts its parts as threads, and whenever one thread
runs into an 'error',
Colin Paul Adams wrote:
But IF there is no difference between LGPL and GPL for Haskell
programs, then the licensing of gtk2hs as LGPL is just a smokescreen -
it is effectively GPL, so you have to license your program as GPL.
Which I'm all in favour of :-)
I actually don't think this is 100%
-- John A. De Goes wrote:
Adding information cannot remove a contradiction from the information
set available to the compiler.
But it can and often does, for example, for [] or 4. What's the type of
either expression without more information?
[] :: [a]
4 :: Num a = a
Do I win something?
I'm sure this isn't the solution you are looking for, but when I had to do
something similar (integrate an Eclipse plugin to Haskell code) the simplest
approach I found was to simply invoke the Haskell in a separate process,
binding the stdin/stdout of the Haskell process to Java output/input
- Original Message
From: Andrew Coppin andrewcop...@btinternet.com
Which is why I personally prefer HiddenTypeVariables. (This has the advantage
of using only pronouncible English
words, which means you can use it when speaking out loud.)
Existential - English, easy to pronounce
- Original Message
From: John A. De Goes j...@n-brain.net
On Jan 15, 2009, at 9:31 AM, John Goerzen wrote:
AFAIK, the only language where that sort of wheel reinvention is
popular is Java. But then Java seems to encourage wheel reinvention
anyhow ;-)
The Java reinventions look
Raeck said:
Hi, how can I make the following code work? (show all the possible values of
a type 'a')
showAll :: (Eq a, Bounded a, Enum a) = a - [a]
showAll a = [minBound..maxBound]::[a]
What you are really looking for, I think, is a polymorphic value of type [a],
where a is some
I've recently built 6.10.1 on fairly archaic RHEL servers, both 64 and 32 bit,
and the incantation that worked most seamlessly for me was to grab a really old
binary release (in my case 6.2 worked) that installs without intervention, and
then build up to the latest version (6.10.1) in steps --
How does Hackage run 'haddock' on uploaded packages? I had assumed it directly
runs the cabal 'haddock' target, e.g.
runhaskell Setup.hs haddock
but it appears to perhaps be more complex than that.
Some backrgound --
haddock doesn't seem to like quasiquotation - running haddock on a source
--- On Tue, 11/11/08, Dave Tapley [EMAIL PROTECTED] wrote:
So I should clarify I'm not a troll and do see
the Haskell light. But
one thing I can never answer when preaching to others is
what does
Haskell not do well?
'Hard' real-time applications? I don't know that there couldn't be a
--- On Fri, 10/24/08, Derek Elkins [EMAIL PROTECTED] wrote:
Just what is the concise, compelling, unembellished
claim regarding
Haskell's inherent robustness?
The concise, compelling, unembellished claim is: if your
pure* Haskell
program segfaults (or GPFs) then it's the
--- On Fri, 10/17/08, Achim Schneider [EMAIL PROTECTED] wrote:
declarations = [d|
foo = bar
bar = foo
|]
-fth doesn't make a difference here, I'm using
-XTemplateHaskell with
ghc 6.8.3
The following lines, verbatim, pasted into a file, work for me with 6.8.3 with
no
On Thu, 2008-10-16 at 15:02 +1300, Richard O'Keefe
wrote:
On 16 Oct 2008, at 12:09 pm, Jonathan Cast wrote:
I am not sure how say in a Java language a
constructor can conjure
up
a value of an unknown type.
Well, that's the point. It can't, in
Haskell or in Java. If you
--- On Thu, 10/16/08, Jonathan Cast [EMAIL PROTECTED] wrote:
Can I have HashSetInteger? Could I construct
HashSet?, if I did?
Yes:
HashSet? blah = (HashSet?) hashSetClass.newInstance();
... compiles, and won't throw an exception if hashSetClass truly is the class
object for HashSet.
--- On Thu, 10/16/08, Jonathan Cast [EMAIL PROTECTED] wrote:
But I can't say new HashSet?()?
No... but you can say 'new HashSetT()' where T is a type variable, and then
put a value of type T into your set, which is probably generally what you want.
HashSet? is a set of unknown (at
--- On Thu, 10/16/08, Jonathan Cast [EMAIL PROTECTED] wrote:
So if I say
void wrong(List? foo, List? bar)
I get two /different/ type variables implicitly filled in?
If I declare a generic class, and then have a method, is
there a way, in
that method's parameter list, to say `the type
--- On Thu, 10/2/08, Andrew Coppin [EMAIL PROTECTED] wrote:
I'm lost...
(What does liftM have to do with fmap?)
They're (effectively) the same function.
i.e.
liftM :: (Monad m) = (a - b) - m a - m b
fmap :: (Functor f) = (a - b) - f a - f b
liftM turns a function from a to b into a
--- On Thu, 9/18/08, Creighton Hogg [EMAIL PROTECTED] wrote:
If this makes anyone cringe or cry
you're doing it wrong, I'd
actually like to hear it.
Just to make everyone cry:
main = getArgs = \(x:_) - system (wc -l ++ x)
___
--- On Fri, 9/12/08, Bruce Eckel [EMAIL PROTECTED] wrote:
OK, let me throw another idea out here. When Allen Holub
first
explained Actors to me, he made the statement that Actors
prevent
deadlocks. In my subsequent understanding of them, I
haven't seen
anything that would disagree with
--- On Wed, 8/27/08, Dan Weston [EMAIL PROTECTED] wrote:
Failure to handle a null pointer is just like using
fromJust and results
in the same program termination (undefined).
Dan
Well, not (IMHO) 'just like': 'fromJust Nothing' turns into a 'catchable'
exception in the IO Monad, but a
--- On Sat, 8/16/08, Andrew Coppin [EMAIL PROTECTED] wrote:
Although it is possible to hide packages by GHC options, we should not
do this, because several libraries might use different Hash tables and
it would not be possible to write a program which uses many of these
libraries.
--- On Sat, 8/16/08, wren ng thornton [EMAIL PROTECTED] wrote:
Personally, I have major qualms with the Java package
naming scheme. In
particular, using domain names sets the barrier to entry
much too high
for casual developers (e.g. most of the Haskell user base).
Yes, DNs are
cheap and
In messing around with TH, I noticed (what I consider
to be an) odd wrinkle in the handling of list types
within TH's syntax meta-data. For example, given the
program at the end of this email, which prints out the
TH representation of the types 'Ints' and '[Int]',
where 'Ints' is just a
--- Eric [EMAIL PROTECTED] wrote:
Hi all,
I've written the following program to connect to a
submit an HTTP GET
request to a server and print the response:
module Main where
import Network
import System.IO
main = withSocketsDo go
go = do putStrLn Connecting...
64 matches
Mail list logo
