If you need an update of a package to make it build/run on GHC 6.12.1,
or if you have modified someone else's package to do so, please feel
free to use this wiki page to coordinate:
http://haskell.org/haskellwiki/Patches_and_forks_for_GHC_6.12
I suggest that those who have patches to contribute a
At Thu, 10 Dec 2009 12:07:32 +,
Magnus Therning wrote:
> As I understand it it all started with laziness. I don't know if
> laziness is impossible without purity
More or less.
Haskell is a language where anything can be evaluated lazily by
default. Unlike say Scheme, where if you want someth
Some packages will need modifications to build or work with GHC
6.12 (in some cases, just modifications to the .cabal file).
I've created this wiki page to track work people have done on
that which hasn't yet been included into official packages or
repositories:
http://haskell.org/haskellwiki/Patc
This is not in any way specific to Haskell, but I know a number of
packages on Hackage have executables with command-line options, so:
The non-Haskell program get_iplayer has an excellent idea for
command-line options parsing. Rather than having to remember two
separate syntaxes, one for command l
At Thu, 15 Oct 2009 10:15:46 +0400,
Eugene Kirpichov wrote:
> but I don't know in what respect these two packages differ and why Don
> decided to create 'judy' despite the existence of HsJudy.
HsJudy doesn't compile against the latest judy library (as Don knew) -
presumably he had a good reason to
On Wed, 12 Aug 2009 08:34:28 -0500
Derek Elkins wrote:
> On Tue, Aug 11, 2009 at 3:51 PM, Robin Green
> wrote:
> > On Wed, 12 Aug 2009 11:37:02 +0200
> > Peter Verswyvelen wrote:
> >
> >> Yes, sorry.
> >>
> >> But I think I already found the
On Wed, 12 Aug 2009 11:37:02 +0200
Peter Verswyvelen wrote:
> Yes, sorry.
>
> But I think I already found the answer to my own question.
>
> DDC functions that are lazy don't allow side effects:
> http://www.haskell.org/haskellwiki/DDC/EvaluationOrder
>
> Anyway it would be cool if the DDC Eff
And even if you don't agree with that, it would likely lead to
accidental use of GPL software in proprietary software, which is not a
good thing.
--
Robin
On Wed, 5 Aug 2009 09:33:34 -0700
"John A. De Goes" wrote:
>
> Tom is exactly right here. GPL is the kiss of death in the
> commercial worl
On Wed, 5 Aug 2009 11:03:55 -0500
Tom Tobin wrote:
> On Wed, Aug 5, 2009 at 10:46 AM, Colin Paul
> Adams wrote:
> >> "Tom" == Tom Tobin writes:
> >
> > >> This can surely be tackled by cabal, as it already has the
> > >> license information.
> >
> > Tom> I don't see this as a real s
less hacky way.
--
Robin
On Sun, 19 Jul 2009 23:35:34 +0100
Robin Green wrote:
> I'm pleased to announce the first public release of cautious-file:
>
> http://hackage.haskell.org/package/cautious-file
___
Haskell-Cafe mailing list
Haske
On Mon, 20 Jul 2009 10:03:56 +0100
Magnus Therning wrote:
> On Mon, Jul 20, 2009 at 9:26 AM, Vasili I.
> Galchin wrote:
> > Hello,
> >
> > It seems to me that Hackage doesn't provide version control,
> > e.g. check out and check in. Am I incorrect?
>
> Hackage is, AFAIU, a repository where
While rewriting cautious-file to use ByteStrings and FFI just now, I
came across this potential problem:
Why does the FFI specification define CStringLen as (Ptr CChar, Int)?
As the FFI specification itself notes, Haskell 98 implementors are
allowed to have a quite small range for Int (only up to
I'm pleased to announce the first public release of cautious-file:
http://hackage.haskell.org/package/cautious-file
This library currently provides a writeFile function that is intended to
have three advantages over Prelude.writeFile:
1. There was a controversy a few months ago about the new Lin
I really like tuple sections and I've wanted them for years. I never use
comprehensions though, so I abstain from the other vote.
--
Robin
On Sun, 19 Jul 2009 08:18:48 -0700
Thomas Hartman wrote:
> I vote for tuple sections. Very nice!
>
> I don't really see immediate places where I would use
On Fri, 10 Jul 2009 10:44:51 +0200
Wolfgang Jeltsch wrote:
> PASCAL
> uses “program”, not “programme”,
The word program (as in computer program) is spelled program in both
British and American English.
--
Robin
___
Haskell-Cafe mailing list
Haskell-Ca
This announcement will only be of interest to Haskell programmers
using, or thinking of using, Template Haskell.
I am very pleased to announce a new release (2009.6.23.3) of ZeroTH
(also known as zeroth), a tool for preprocessing Haskell code to run
splices and remove Template Haskell dependencies
I would like to use the HsJudy bindings to the Judy high-performance
trie library (on hackage), but unfortunately they have bitrotted. I can
have a go at mending them but I have no experience with FFI. Any tips?
--
Robin
___
Haskell-Cafe mailing list
Ha
On Sun, 17 May 2009 23:10:12 +0400
Eugene Kirpichov wrote:
> Is there any research on applying free theorems / parametricity to
> type systems more complex than System F; namely, Fomega, or calculus
> of constructions and alike?
Yes. I did some research into it as part of my master's thesis, the
On Wed, 13 May 2009 15:37:52 +0400
Bulat Ziganshin wrote:
> Hello Duncan,
>
> Wednesday, May 13, 2009, 3:33:13 PM, you wrote:
>
> > I think it should remain deprecated and we should work on the
> > replacement so that TH can switch its dependency.
>
> TH isn't high-performance package and i th
On Wed, 15 Apr 2009 23:31:50 -0700
Michael Mossey wrote:
> I was thinking that it might be useful to have a Google-like "do you
> mean this?" feature. If the field name is //customer=, then the
> parser might recognize a huge list of variants
> like //ustomer=, //customor=, etc...
You could redu
I am writing some code for citation support in gitit, and all the
#ifdefs I'm using to do conditional compilation are a bit tiresome.
Suppose you have the requirement that a certain feature of your
software be disable-able at compile time, to avoid having to pull in
certain dependencies (which may
On Wed, 25 Mar 2009 08:25:40 -0700
Jonathan Cast wrote:
> Define
>
> swap (a, b) = (b, a)
By the way, if you want to be "too smart", there's a generalised
version of swap in Control.Category.Braided in the category-extras
package.
That might be a bit overkill though.
--
Robin
hranker is a fun little command-line utility I have written to help a
user rank a list of items (of any type implementing Show, Eq and Ord).
I hope the code is sufficiently clear that it could also serve as an
educational piece of code, especially for people wanting to learn how
to use the HCL libr
Firstly, apologies to everyone for sending the same message to the list
five times, yesterday! The mailserver I use kept timing out, and I had
thought that my mail client would handle attempts to resend an email
appropriately, but apparently not. Time to put a paper bag over my head!
On Wed, 18 Ma
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler wrote:
> Hi,
>
> > Even worse, the buttons for moving items up and down are buggy - at
> > least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
> > reorder my other votes! Even assuming that the list box code is not
> > buggy (whic
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler wrote:
> Hi,
>
> > Even worse, the buttons for moving items up and down are buggy - at
> > least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
> > reorder my other votes! Even assuming that the list box code is not
> > buggy (whic
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler wrote:
> Hi,
>
> > Even worse, the buttons for moving items up and down are buggy - at
> > least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
> > reorder my other votes! Even assuming that the list box code is not
> > buggy (whic
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler wrote:
> Hi,
>
> > Even worse, the buttons for moving items up and down are buggy - at
> > least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
> > reorder my other votes! Even assuming that the list box code is not
> > buggy (whic
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler wrote:
> Hi,
>
> > Even worse, the buttons for moving items up and down are buggy - at
> > least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
> > reorder my other votes! Even assuming that the list box code is not
> > buggy (whic
I am also concerned that the default behaviour of the buttons will
lead to arbitrary preference rankings favouring those with entries
that start more towards the top or bottom of the list. You shouldn't
have to go to a lot of extra effort to create a tie between several
entries, if you can't decide
On Tue, 17 Mar 2009 16:11:54 +0100
Thomas Davie wrote:
> I have to agree that the UI for voting is not the best I've ever
> seen. On the other hand, it's pretty easy to select the few logos
> that you like, and push them all to the top, select the ones you'd
> accept, and push them up just
On Tue, 17 Mar 2009 15:24:28 +0100
Heinrich Apfelmus wrote:
> A simple majority vote is clearly inadequate for this vote, but I'm
> afraid that without assisting technology (instant and visual
> feedback), the voting process will more or less deteriorate to that
> due to the difficulty of creatin
On Fri, 13 Mar 2009 14:32:23 +
Ross Paterson wrote:
> On Fri, Mar 13, 2009 at 03:18:15PM +0100, Martijn van Steenbergen
> wrote:
> > Are there any functors f for which no point/pure/return :: a -> f a
> > exists?
>
> No. Choose an arbitrary element shape :: f () and define
>
> poin
For most functors, that is equivalent to
point x = undefined
But by that logic, everything is a member of every typeclass...
--
Robin
On Fri, 13 Mar 2009 17:35:31 +0300
Eugene Kirpichov wrote:
> 'An arbitrary element' means 'undefined will suffice'
>
> point x = fmap (const x) undefined
>
>
The concept of "design pattern" tends not to be used by Haskell
programmers - it brings a lot of baggage with it (like being formally
documented in a particular way, being "proven" by being used in
production several times, etc.) and it doesn't seem to be particularly
useful for us in this heavywei
On Sat, 07 Mar 2009 17:30:43 +
Colin Paul Adams wrote:
> > "Svein" == Svein Ove Aas writes:
>
> >> Preprocessing library game-tree-1.0.0.0... Building
> >> game-tree-1.0.0.0...
> >>
> >> Data/Tree/Game/Negascout.hs:31:0: Unrecognised pragma [1 of 2]
> >> Compiling
On Thu, 26 Feb 2009 14:30:17 +
Hugo Pacheco wrote:
> Hi all,
>
> Under gitit 0.5.3 I always get "Prelude.read: no parse" when trying to
> load a configuration file.
> My previous file goes attached, but the sample config file from
> http://github.com/jgm/gitit/tree/master does not work also.
On Fri, 20 Feb 2009 15:17:14 +0100
Achim Schneider wrote:
> Conal Elliott wrote:
>
> > DRAFT version ___ comments please
> >
> Conal, please, PLEASE, never, EVER again use the word "meaning" if you
> actually mean "denotation". It confuses the hell out of me, especially
> the (I guess unintende
On Fri, 13 Feb 2009 15:52:48 +0100
"Henk-Jan van Tuyl" wrote:
>
> Yesterday I saw Haskell mentioned for the first time in a magazine,
> Bits & Chips. It is a magazine for professionals, about hardware and
> software; the article was about the domain specific language Cryptol
> from Galois.
>
>
On Mon, 9 Feb 2009 14:18:18 +
Edsko de Vries wrote:
> Hi,
>
> Is there a nice way to write
>
> down :: Focus -> [Focus]
> down p = concat [downPar p, downNew p, downTrans p]
>
> in point-free style?
I think this should work:
down = concat . swing map [downPar, downNew, downTrans]
swing
On Mon, 09 Feb 2009 15:10:22 +0100
Peter Padawitz wrote:
> A simplied version of Example 5-16 in Manna's classical book
> "Mathematical Theory of Computation":
>
> foo x = if x == 0 then 0 else foo (x-1)*foo (x+1)
>
> If run with ghci, foo 5 does not terminate, i.e., Haskell does not
> look fo
For low-level or obscure questions about GHC such as this, it might be
better to use glasgow-haskell-us...@haskell.org. There are one or two
people who don't read haskell-cafe because it's so busy (and they're so
busy).
--
Robin
On Wed, 4 Feb 2009 22:54:15 +0100
Deniz Dogan wrote:
> Hi
>
> I'm
On Tue, 3 Feb 2009 19:58:51 -0200
"rodrigo.bonifacio" wrote:
> Hi all,
>
> I'm trying to use the Funsat library. One of its data types is CNF:
>
> data CNF = CNF {
> numVars :: Int
> numClauses :: Int
> clauses :: Set Clause
> }
>
> I have a list of clauses, but I'm getting an error when co
Colin,
I really don't see the point of putting your own name at the
front of the subject line. It is redundant because it's already in the
email headers. Perhaps this was a technical glitch?
--
Robin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.or
Have you tried processing the file with lhs2tex first, to unlit it? (Or
is that what you are doing? It's unclear from your email.)
--
Robin
On Fri, 30 Jan 2009 16:02:08 +0300
Pavel Perikov wrote:
> Hi, list!
>
> I have a file:
>
> \begin{code}
> module Main where
> import MyModule
>
> main=d
On Fri, 30 Jan 2009 15:21:05 +0800
Evan Laforge wrote:
> Is there a description somewhere of what the
> critical flaws have been and are, and what the current problems are to
> solve before we can finally have a practical declarative and
> compositional UI library?
In *theory*, that should be in
On Sat, 24 Jan 2009 07:23:04 -0800 (PST)
Grzegorz Chrupala wrote:
> So GHC installs but when I try to run it is fails with: error while
> loading shared libraries: libedit.so.0: cannot open shared object
> file: No such file ordirectory
> I tried setting LIBRARY_PATH and LD_RUN_PATH to $HOME/lib
On Mon, 19 Jan 2009 17:36:30 +
"Thomas DuBuisson" wrote:
> On Mon, Jan 19, 2009 at 4:48 PM, Robin Green
> wrote:
> > What guidelines should one follow to make Haskell code least-strict?
>
> There was a great Cafe discussion started by Henning on just th
Is anyone else interested in forming a Haskell WikiProject on Wikipedia,
to collaborate on improving and maintaining the coverage and quality of
articles on Haskell-related software and topics (broadly defined)? Not
just programming topics specific to Haskell, but also ones of interest
to the Haske
What guidelines should one follow to make Haskell code least-strict?
--
Robin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Sun, 18 Jan 2009 08:51:10 +0100
david48 wrote:
> On Sat, Jan 17, 2009 at 11:19 PM, Dan Piponi
> wrote:
> > On Sat, Jan 17, 2009 at 1:47 AM, david48
> > wrote:
>
> >> why would I
> >> need to write a running count this way instead of, for example, a
> >> non monadic fold, which would probabl
On Mon, 12 Jan 2009 21:04:35 +0100 (CET)
Henning Thielemann wrote:
>
> On Mon, 12 Jan 2009, Andrew Coppin wrote:
>
> > Off the top of my head, try this:
> >
> > convert b 0 = []
> > convert b n = n `mod` b : convert b (n `div` b)
> >
> > (Takes a number and yields the radix-B representation of
On Mon, 12 Jan 2009 19:43:00 +0100
"Bas van Dijk" wrote:
> On Mon, Jan 12, 2009 at 6:47 PM, Max Bolingbroke
> wrote:
> > GHC should indeed be doing so. I'm working (on and off) to work out
> > some suitable heuristics and put the transformation into ghc -O2.
> > There are a few wrinkles that sti
On Mon, 5 Jan 2009 07:27:13 +0100
Achim Schneider wrote:
> Achim Schneider wrote:
>
> > [...]
> >
> Hmmm... I seem to have left out the academics definition of bogosity.
> I bet that others are much more qualified to elaborate on this, but my
> working assumption has been (and still is) that it
In my opinion, in Haskell, you don't need coroutines because you have
lazy evaluation.
You example below is simply an example of a heterogenous list being
read. The simplest way to implement a heterogenous list in Haskell is
to use a tuple. Or you could use the HList package.
--
Robin
On Thu, 18
It occurs to me that garbage collection can be seen as some kind of
dual of laziness. Laziness means deferring the creation of values until
later in the future (or even never). Garbage collection means eagerly
destroying data created in the past, and reclaiming the memory used by
it, before some ot
On Mon, 3 Nov 2008 22:16:14 +0100
"Alberto G. Corona " <[EMAIL PROTECTED]> wrote:
> I need to backup my ubuntu-VMWare image frequently (5 GBits) . I
> need to know if exist such a utility (in haskell or not) for single
> file syncronization.
Why don't you just run rsync inside the virtual machi
7;ve tried lots, I always hit some kind
of PostScript or TeX error. My Haskell file is attached.
I asked about it on the tex-live mailing list, and I got this
response, advising me to speak to the author:
From: Taco Hoekwater <[EMAIL PROTECTED]>
To: Robin Green <[EMAIL PROTECTED]>
CC: [EM
On Tue, 30 Sep 2008 03:27:09 -0600
"Luke Palmer" <[EMAIL PROTECTED]> wrote:
> But I *want* to do something like that with Coq (I prefer it to Agda
> for little more than personal taste). In particular, I'd like to see
> a reasoning framework for partial functions, so you could state and
> prove
On Wed, 17 Sep 2008 15:28:35 +0100
"John Lato" <[EMAIL PROTECTED]> wrote:
> I just noticed that the "Simply Efficient Functional Reactivity" paper
> has been updated since I last looked; I'll have to read it again now.
>
> Is the library/code mentioned in the paper released or available
> anywher
On Mon, 15 Sep 2008 13:05:11 -0300
"Rafael C. de Almeida" <[EMAIL PROTECTED]> wrote:
> I do not know. I'm not experienced on the field and I was under the
> impression you'd write your code then get a pen and a paper and try to
> prove some property of it.
In fairness, that's how it's often done i
On Mon, 15 Sep 2008 10:32:44 -0400
Stefan Monnier <[EMAIL PROTECTED]> wrote:
> > A more difficult question is: how do I know that the formal
> > specification I've written for my program is the right one? Tools
> > can fairly easily check that your programs conform to a given
> > specification,
On Mon, 07 Jul 2008 12:30:34 +0200 (CEST)
Henning Thielemann <[EMAIL PROTECTED]> wrote:
> Actually the type system of Haskell is also logic programming. I
> have implemented a simple kind of logic programming using lazy peano
> numbers: http://darcs.haskell.org/unique-logic/
There is also Curry
Is there any work on combining effect typing with extended static
checking or full-blown formal verification (e.g. proof-carrying code)?
My hunch would be that an impure functional language like this (OCaml is
another example) makes optimisation easier, compared to Haskell - but at
the expense of m
On Fri, 30 May 2008 15:23:46 +0100
Andrew Butterfield <[EMAIL PROTECTED]> wrote:
> Robin Green wrote:
> > I have been thinking about to what extent you could cleanly do I/O
> > without explicit use of the I/O monad, and without uniqueness types
> > (which are the ma
I have been thinking about to what extent you could cleanly do I/O
without explicit use of the I/O monad, and without uniqueness types
(which are the main alternative to monads in pure functional
programming, and are used in the Concurrent Clean programming language).
Suppose you have a main event
On Wed, 30 Jan 2008 13:15:41 +
Jules Bean <[EMAIL PROTECTED]> wrote:
> Neil Mitchell wrote:
> > For a start, its probably a good idea to mention that cos is an
> > abbreviation of cosine (most people will know, but its handy to
> > state it). Secondly, and much more importantly, it should stat
On Thu, 24 Jan 2008 10:29:23 -0600
Derek Elkins <[EMAIL PROTECTED]> wrote:
> Doing it in the IDE would a) require much more from most IDEs and b)
> be almost entirely useless. Most IDEs don't even get as far as
> parsing the code, even the the best rarely know much about the actual
> semantics of
I am proving various statements relating to applicative functors, using
the Coq proof assistant (I am considering only Coq terms, which always
terminate so you don't have to worry about _|_). However, I'm not sure
how to go about proving a certain conjecture, which, translated back
into Haskell and
On Mon, 17 Dec 2007 16:04:24 -0500
"Brandon S. Allbery KF8NH" <[EMAIL PROTECTED]> wrote:
>
> On Dec 17, 2007, at 15:41 , Brent Yorgey wrote:
>
> > Yes, and in fact, you don't even need foldM. The only thing that
> > actually uses IO is the readFile, so ideally
>
> Actually, a quick check ind
On Sat, 15 Dec 2007 21:46:43 +0300
Bulat Ziganshin <[EMAIL PROTECTED]> wrote:
> you may believe in what you want. i prefer to say about real
> situation. if it will be possible to quickly write good Haskell
> compiler, it was be written many years ago
No-one is writing a commercial Haskell compile
On Sat, 01 Dec 2007 21:22:53 -0600
Derek Elkins <[EMAIL PROTECTED]> wrote:
> > There's also the issue of finding a more elegant way of threading
> > the Store through my evaluator, but I'm not concerned too much
> > about that at this point. I can probably define a state-carrying
> > monad like P
On Tue, 13 Nov 2007 13:51:13 -0800
"Dan Piponi" <[EMAIL PROTECTED]> wrote:
> Up until yesterday I had presumed that guards only applied to
> functions. But I was poking about in the Random module and discovered
> that you can write things like
>
> a | x > 1 = 1
> | x < -1 = -1
> | otherwise =
On Mon, 5 Nov 2007 21:37:16 + (GMT)
"C.M.Brown" <[EMAIL PROTECTED]> wrote:
> Is there a way to give lookup0 and lookup1 explicit type signatures
> without passing in m0 and m1 as parameters? (So their definitions are
> the same as in the first example) If ghc can infer the type, surely
> it mu
On Fri, 2 Nov 2007 05:11:53 -0500
"Nicholas Messenger" <[EMAIL PROTECTED]> wrote:
> -- Many people ask if GHC will evaluate toplevel constants at compile
> -- time, you know, since Haskell is pure it'd be great if those
> -- computations could be done once and not use up cycles during
> -- runtime
On Wed, 31 Oct 2007 14:17:13 +
Jules Bean <[EMAIL PROTECTED]> wrote:
> Specifically, clean's uniqueness types allow for a certain kind of
> zero-copy mutation optimisation which is much harder for a haskell
> compiler to automatically infer. It's not clear to me that it's
> actually worth it
You neglected a ) - remember to count your parentheses in future when
you get an error directly after a parenthesised expression.
--
Robin
On Thu, 31 May 2007 08:09:23 -0700 (PDT)
Akijmo <[EMAIL PROTECTED]> wrote:
>
> Hi everyone.
> I am new to this Forum, Haskell and i am german, so i am sorr
On Tue, 29 May 2007 19:28:02 -0400
Isaac Dupree <[EMAIL PROTECTED]> wrote:
> Luckily, Haskell's laziness means that doing an extra "postprocessing
> pass" doesn't necessarily yield two traversals requiring the whole
> file to be stored in memory, nor worse hacks. (For grammars that
> aren't too wi
The following Haskell 98 module implements a generalisation of
Prelude.ShowS for any type. Should be pretty easy to incorporate this
into code which currently uses the list monad non-trivially, and get
better performance - but can this be right? Surely someone would have
published this before if th
On Fri, 25 May 2007 19:39:19 +0100
"Neil Mitchell" <[EMAIL PROTECTED]> wrote:
> http://darcs.haskell.org/darcsweb/darcsweb.cgi?r=yhc;a=summary - most
> things on haskell.org have a darcsweb, thats the one for Yhc.
>
> Plus I suspect that darcs will be discussed in the book, for building
> a librar
On Tue, 22 May 2007 15:05:48 +0100
Duncan Coutts <[EMAIL PROTECTED]> wrote:
> On Tue, 2007-05-22 at 14:40 +0100, Claus Reinke wrote:
>
> > so the situation for mailing lists and online docs seems to have
> > improved, but there is still the wiki indexing/rogue bot issue,
> > and lots of fine tuni
On Thu, 17 May 2007 14:41:33 +0100
Eric <[EMAIL PROTECTED]> wrote:
> H|i,
>
> Does anyone know of a simple and straightforward way to use global
> variables in Haskell?
>
> E.
Another alternative, for "write-once variables", is implicit parameters.
--
Robin
__
The Haskell wiki[1] says "Recent content is available under a simple
permissive license". But this is unilluminating - recent? how recent,
exactly? - and will become increasingly understated as time goes by.
Wouldn't it be slightly more helpful to say "Content added after " ...
/MM/DD ... " is
On Fri, 04 May 2007 14:42:53 +0300
Ilya Tsindlekht <[EMAIL PROTECTED]> wrote:
> Does the definition of monad silently assume that if f and f' are
> equal in the sense that they return the same value for any argument o
> correct type then m >>= f = m >>= f'
How could it be otherwise? How are you g
On Sat, 28 Apr 2007 14:06:21 +0100
Eric <[EMAIL PROTECTED]> wrote:
> In imperative languages one can test the type of a variable and
> downcast if necessary. Here's an example in Pseudojava:
>
> T v := ... ;
> if (v instanceof T') T' v' := (T')v
In object-oriented languages you can achieve the s
As a workaround, you could try to use zeroTH to preprocess the template
haskell. (I have a patched version of zeroTH that works better but it
currently requires a patched version of GHC - ask me if you want it.)
ZeroTH darcs repo: http://darcs.haskell.org/~lemmih/zerothHead/
Original announcement
On Fri, 27 Apr 2007 07:00:26 -0300
"Fernando Cassia" <[EMAIL PROTECTED]> wrote:
> But just think about it... is it easier to DOCUMENT the problem or
> just include a workaround in the make install code?
It's easier to document the problem.
> IF {library not available} then
> echo "you need to ge
On Fri, 27 Apr 2007 00:40:33 +0100
"Neil Mitchell" <[EMAIL PROTECTED]> wrote:
> > If it's too annoying to wait for that inevitability, try commenting
> > the hell out of it until it has a respectable number of lines.
>
> Comments are for people who can't sense what their code does from the
> inde
On Tue, 24 Apr 2007 14:23:47 +0100
Joel Reymont <[EMAIL PROTECTED]> wrote:
> I'm finding myself dealing with several large abstract syntax trees
> that are very similar in nature. The constructor names would be the
> same or one type may be a small extension of another.
>
> This is something
On Mon, 26 Feb 2007 17:28:59 -0800 (PST)
[EMAIL PROTECTED] wrote:
> The problem with GADTs and other run-time based evidence is just
> that: _run-time_ based evidence and pattern-matching. In a non-strict
> system, checking that the evidence is really present is the problem on
> and of itself.
Th
On Sat, 10 Feb 2007 23:37:04 +0100
Bjorn Bringert <[EMAIL PROTECTED]> wrote:
> I've also recently changed the version number scheme on most of the
> packages I maintain (which includes most of the packages required by
> Hope) from a date-based one to a major.minor scheme. This has the
> unfor
On Mon, 8 Jan 2007 08:51:40 -0500
"Jim Apple" <[EMAIL PROTECTED]> wrote:
> The Terminating datatype takes three parameters:
> 1. A term in the untyped lambda calculus
> 2. A sequence of beta reductions
> 3. A proof that the result of the beta reductions is normalized.
>
> Number 2 is the hard part
On Sun, 4 Jun 2006 11:21:23 +0200
Niels Van Och <[EMAIL PROTECTED]> wrote:
> However, I'd love to know what you think. Furthermore, do you think
> I should include an example on the usage of Haskell, and if so, which?
I have an idea. Find some real code in another language which uses
lots of state
On Wed, 29 Mar 2006 12:50:02 +0100
Jon Fairbairn <[EMAIL PROTECTED]> wrote:
> There are some observations I'd like to make, and a
> proposal. Since the proposal relates (in a small way) to
> concurrency and is, I think worthwhile, I've cc'd this
> message to haskell-prime.
>
> 1) choosing the opti
> > Cheers everyone - if i have blatantly
> > missused this mailing list just email me some abuse.
Perhaps you should be asking your teacher this question? I'm sure s/he'd
be very happy with you using the list to get other people to do parts of
your homework for you.
--
Robin
Miles Sabin <[EMAIL PROTECTED]> wrote:
> Can someone explain to me why decidability is of any practical
> interest at all? procedure which might never terminate and one which might
> take
> 1,000,000 years to terminate? Actually, why push it out to 1,000,000
> years: in the context of a compiler
On Fri, 3 Feb 2006 19:33:12 -
"Brian Hulley" <[EMAIL PROTECTED]> wrote:
> I've been thinking along these lines too, because it has always
> seemed to me that laziness is just a real nuisance because it hides a
> lot of inefficiency under the carpet as well as making the time/space
> behaviour o
Lennart Augustsson wrote:
Robin Green wrote:
2. Dependent types: By programming in a dependently-typed functional
programming language such as the research language Epigram, it is
possible to write functional programs whose types force them to be
correct. See for example "Why Dependent
Abigail wrote:
Hi,
I have been searching papers about tha raltionship
between formal methods in software engineering and
functinal programmming, but i haven't found enough
information.
Functional programming in pure functional languages like Haskell can
help to make programs easier to reason a
David F. Place wrote:
Hi All,
Is there a program for expanding 'do' notation? I am trying to
understand why the following code (from the Fannkuch entry) doesn't
hold onto the list 'p' causing a space leak.
You can desugar (i.e. expand) the do notation relatively easily, but
that won't te
1 - 100 of 111 matches
Mail list logo
