#1241: Functional dependencies not checked.
-+--
Reporter: guest| Owner:
Type: bug | Status: new
Priority: normal |
#1241: Functional dependencies not checked.
-+--
Reporter: guest| Owner:
Type: bug | Status: new
Priority: normal |
#1236: System.Mem.Weak breaks referential transparency
--+-
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: closed
Priority: normal| Milestone:
#1241: Functional dependencies not checked.
-+--
Reporter: guest| Owner:
Type: bug | Status: new
Priority: normal |
#1245: Turn tuples into syntactic sugar for heterogeneous lists
+---
Reporter: [EMAIL PROTECTED] | Owner:
Type: feature request | Status: new
Priority: normal
#609: Useful optimisation for set-cost-centre
--+-
Reporter: simonpj | Owner:
Type: task | Status: new
Priority: normal| Milestone: 6.8
#764: DESTDIR Makefile variable
-+--
Reporter: guest| Owner: igloo
Type: feature request | Status: closed
Priority: low | Milestone: 6.6.1
Component:
#956: improving error messages #1
-+--
Reporter: Bulat Ziganshin [EMAIL PROTECTED] | Owner: simonpj
Type: feature request | Status: new
Priority: normal
#1119: openBinaryFile: does not exist (No such file or directory) i386-unknown-
linux
--+-
Reporter: guest | Owner: simonmar
Type: bug | Status: new
Priority:
#1095: make boot under includes/ doesn't run make depend
--+-
Reporter: kirsten | Owner: simonmar
Type: bug | Status: new
Priority: low | Milestone: 6.6.1
#1096: More make boot / make depend problems
--+-
Reporter: kirsten | Owner: simonmar
Type: bug | Status: new
Priority: low | Milestone: 6.6.1
Component:
#1246: = operators get compiled worse than ==
-+--
Reporter: duncan| Owner:
Type: bug | Status: new
Priority: normal| Milestone:
Component: Compiler |
On Tue, Mar 27, 2007 at 12:41:30AM -, GHC wrote:
Now we get {{{ case n =# 0# of { True - ...; False - ...} }}}. We might
hope that this gives us equivalent code in the backend but sadly it
doesn't, the simple version is slower.
We should be able to do better since at the cpu level
On Mon, Mar 26, 2007 at 09:15:35PM -0700, John Meacham wrote:
actually, this is not true for the specific case of testing against zero
on x86 at least. there is a 'zero flag' that is set whenever the result
of an operation is zero. whereas for compares, you actually need to load
zero into a
On Mon, Mar 26, 2007 at 09:23:13PM -0700, Stefan O'Rear wrote:
On Mon, Mar 26, 2007 at 09:15:35PM -0700, John Meacham wrote:
actually, this is not true for the specific case of testing against zero
on x86 at least. there is a 'zero flag' that is set whenever the result
of an operation is
On Mon, Mar 26, 2007 at 09:31:41PM -0700, John Meacham wrote:
On Mon, Mar 26, 2007 at 09:23:13PM -0700, Stefan O'Rear wrote:
On Mon, Mar 26, 2007 at 09:15:35PM -0700, John Meacham wrote:
actually, this is not true for the specific case of testing against zero
on x86 at least. there is a
#1247: Text.XHtml version is out of date?
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal| Milestone:
#1247: Text.XHtml version is out of date?
--+-
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal| Milestone:
#1247: Text.XHtml version is out of date?
--+-
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: normal| Milestone:
Hello list,
I am a student at the IT University of Copenhagen doing my final thesis
on Domain Specific Languages implemented as embedded languages in Ruby.
As you might know Ruby uses a somewhat lax form of typing compared to
Haskell which is apparently highly utilized for creating embedded
Diversity is generated by mutations.
This is hardly a revelation.
My point was that you need two competing components in relative balance to
grow something meaningful.
Cancer growth is based solely on mutation!
Also I was not theological. It is the advice to multiply Prelude and use
time to
You may find the following comment interesting.
The mythos of type systems is that they help the programmer. But the
reality is compiler and hardware design. Not simply that a fantasy
type system is harder to implement, but that a restricted language is
easier to implement.
page 189
Casey Hawthorne wrote:
You may find the following comment interesting.
The mythos of type systems is that they help the programmer. But the
reality is compiler and hardware design. Not simply that a fantasy
type system is harder to implement, but that a restricted language is
easier to
On 3/26/07, Jacob Atzen [EMAIL PROTECTED] wrote:
This lead me to the question: Are there any scientific empirical studies
of the values of static / stronger type systems as found in Haskell, C#
or Java in real world settings? Or any studies comparing weaker type
systems in terms of programmer
As far as published studies, I have found many through the Psychology of
Programming Interest Group, which has a web site
http://www.ppig.org/
and an archived mailing list
http://www.mail-archive.com/discuss%40ppig.org/
with a fairly high density of reports on (formal) empirical studies on
[Probably [EMAIL PROTECTED] is the right list for this message, so I'm fwding
your message below, and will reply there.]
| -Original Message-
| From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Benjamin
| Franksen
| Sent: 23 March 2007 22:56
| To: haskell-cafe@haskell.org
|
| Why, then, are we so paranoid about introducing breaking changes in
| the development branch of haskell? Why are we stuck without the class
| system extension proposal? Why is Num so still so horribly mangled?
| Why can I not 'map' over a Set? Why must I use lists of characters if
| I desire
Andrew Wagner wrote:
The time has come! Calling all Haskell programmers interested in AI!
I've established a new home base at
http://www.haskell.org/haskellwiki/AI .
I have added a link to the Google Summer of Code ticket for a machine
learning library, which I hope is approriate to categorize
Hi,
I am trying to do something like the following:
{-# OPTIONS -fglasgow-exts -fallow-undecidable-instances #-}
module TestCase where
data Any root = forall pos sel . T root pos sel = ANY pos
class T root pos sel | pos - root, root - sel where
f :: pos - sel - Bool
instance T root
What you want to do is perfectly reasonable -- but it cannot be translated into
System F and that's why GHC rejects it.
GHC now has a richer intermediate language that *can* handle this; see our
paper http://research.microsoft.com/~simonpj/papers/ext-f.
Manuel and Martin and I are now working
On Mon, 26 Mar 2007 09:20:59 +0100
Simon Peyton-Jones [EMAIL PROTECTED] wrote:
| [Conjecture 1 (2007). Haskell Mathematical Prelude and
Mathematicians] If | Haskell had a mathematically sound prelude then
more mathematicians would | use Haskell.
A mathematically sound Prelude would be
Hi,
thanks for your quick answer. Do you have any predictions when System
F_c in GHC will be available for usage?
Regards,
Jean-Marie
Simon Peyton-Jones wrote:
What you want to do is perfectly reasonable -- but it cannot be translated
into System F and that's why GHC rejects it.
GHC now
Haskell is rather a Darwinian sort of place.
With whole respect. You need two components for evolution to work: the
survival of the fitness and Generator Of Diversity (GOD).
Now, Haskell attracts originality and easily accommodates changes but nobody
burns tires in testing anything so that
-Ursprüngliche Nachricht-
Von: Andrzej Jaworski [EMAIL PROTECTED]
Gesendet: 26.03.07 15:00:47
An: Simon Peyton-Jones [EMAIL PROTECTED]
CC: Haskell-Cafe@haskell.org
Betreff: Re: [Haskell-cafe] What ever happened to Haskell 98 as a
stablebranch?
Haskell is rather a Darwinian sort
| thanks for your quick answer. Do you have any predictions when System
| F_c in GHC will be available for usage?
Somewhere between 2 and 4 months is my guess
Simon
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Please see my questions inside comments {-- --} :
Thanks!
---
module Parser where
import Data.Char
type Parse a b = [a] - [(b, [a])]
{--
Newbie: a parser for a list of objects?
I am working with the section 17.5 Case study: parsing expressions of the
book Haskell The Craft of Functional
I didn't understand what you meant, so I'll withdraw the Darwinian analogy.
All I mean is: if you think the Prelude is inadequate, an excellent strategy is
to write a better one. If it's better, people may start to use it, and your
good ideas will spread.
Simon
| -Original Message-
I'm trying to figure out how to write a simple parser in Parsec to
tokenize a subset of RTF.
The problem is that I haven't been able to come up with a way of
writing the parser that doesn't try consuming all of the input just
to return the first token.
The 'many' primitive's implementation uses
Daniel Fischer has cared to inform me that:
Diversity is generated by mutations.
With due respect, but this is hardly a revelation.
My point was that you need two competing components in relative balance to
grow something meaningful.
Cancer growth is based solely on mutation!
Also I was not
-Ursprüngliche Nachricht-
Von: Dmitri O.Kondratiev [EMAIL PROTECTED]
Gesendet: 26.03.07 16:44:12
An: haskell-cafe@haskell.org
Betreff: [Haskell-cafe] Newbie: a parser for a list of objects?
Please see my questions inside comments {-- --} :
Thanks!
---
module Parser where
David Brown [EMAIL PROTECTED] wrote:
Does anyone know of any existing Parser parsers that don't consume
their entire input, or am I probably best off making my own parser.
http://www.cs.york.ac.uk/fp/polyparse
In particular, the module Text.ParserCombinators.PolyLazy.
Regards,
Malcolm
-Ursprüngliche Nachricht-
Von: Andrzej Jaworski [EMAIL PROTECTED]
Gesendet: 26.03.07 18:34:00
An: [EMAIL PROTECTED]
Betreff: Re: [Haskell-cafe] What ever happened to Haskell 98 as a
stablebranch?
Hi,
I apologize for mistakenly resending my answer to two lists.
Well, I can
Accidentally sent to haskell@haskell.org instead of the cafe:
Diversity is generated by mutations.
This is hardly a revelation.
It was, looong ago.
My point was that you need two competing components in relative balance to
grow something meaningful.
And I'd think the Haskell community
David Brown [EMAIL PROTECTED] writes:
Does anyone know of any existing Parser parsers that don't consume
their entire input, or am I probably best off making my own parser.
Thomas Zielonka published his Parsec combinator lazyMany on this list
a couple of times, Google for it. Here is my
Jean-Philippe Bernardy wrote:
Please look at
http://darcs.haskell.org/packages/collections/doc/html/Data-Collections.html
for an effort to make most common operation on bulk types fit in a
single framework.
The last time I looked at this (shortly after you started the project) I
wasn't sure if
Wagner Ferenc wrote:
David Brown [EMAIL PROTECTED] writes:
Does anyone know of any existing Parser parsers that don't consume
their entire input, or am I probably best off making my own parser.
Thomas Zielonka published his Parsec combinator lazyMany on this list
a couple of times, Google
Jean-Marie Gaillourdet wrote
I am trying to do something like the following:
{-# OPTIONS -fglasgow-exts -fallow-undecidable-instances #-}
module TestCase where
data Any root = forall pos sel . T root pos sel = ANY pos
class T root pos sel | pos - root, root - sel where
f :: pos
47 matches
Mail list logo
