Hello Ralf,
Saturday, October 15, 2005, 9:00:53 PM, you wrote:
RH> I wrote a book chapter on GADTs a while ago, called "Fun with
RH> phantom types", see
RH> http://www.informatik.uni-bonn.de/~ralf/publications.html#B4
thank you! i seen several articles about phantom types, including
you
Hello Lennart,
Saturday, October 15, 2005, 5:03:50 PM, you wrote:
LA> Alas, Haskell is more subtle than that. Which is why newtype exists.
LA> Try
LA> case A _|_ of A _ -> 1
LA> with the two versions of A to see the difference.
this have practical usage?? may be for such very special t
Hello Conor,
Saturday, October 15, 2005, 4:47:02 PM, you wrote:
>> Now lets consider using an algebraic datatype for regexps:
>>
>> data RegExp
>> = Empty | Single Char | RegExp :+: RegExp | RegExp :|: RegExpt
>> | Iter RegExp
btw, a year ago i written RE processing library,
On Sat, Oct 15, 2005 at 10:46:11AM +0400, Bulat Ziganshin wrote:
> 2) they all say that GADT is great, but i personally don't "feel"
> GADTs. can anyone write a paper about it for beginners like me,
> or may be just collect examples of using GADT in real programs?
If you want a somewhat brai
Hi Bulat,
> 2) they all say that GADT is great, but i personally don't "feel"
> GADTs. can anyone write a paper about it for beginners like me,
> or may be just collect examples of using GADT in real programs?
I wrote a book chapter on GADTs a while ago, called "Fun with
phantom types", see
> 1) where can i find articles from Estonia conference?
There were several conferences in Estonia including TFP, ICFP and
Haskell Workshop. Go to http://www.cs.ioc.ee/tfp-icfp-gpce05/, look at
the program, type in the title of the talk and most of the time google
will give you a copy of the paper
Wolfgang Jeltsch wrote:
This is not true. With newtype, A _|_ is _|_, with data, A _|_ is not _|_.
It's probably more helpful to explain this in terms of a program that
exhibits different behavior in the two cases:
case error "data" of A x -> "newtype"
But as far as I know, the above ne
Wolfgang Jeltsch wrote:
Am Samstag, 15. Oktober 2005 08:31 schrieb Bulat Ziganshin:
Hello Haskell,
number of type definition statements in Haskell (data, type, newtype) is
a bit too large. at least, newtype definition seems to be superfluous - it
can be replaced by the same `data` definition:
Hi folks,
Inspired by Ralf's post, I thought I'd just GADTize a dependently typed
program I wrote in 2001.
Wolfgang Jeltsch wrote:
Now lets consider using an algebraic datatype for regexps:
data RegExp
= Empty | Single Char | RegExp :+: RegExp | RegExp :|: RegExpt
|
Am Samstag, 15. Oktober 2005 08:31 schrieb Bulat Ziganshin:
> Hello Haskell,
>
> number of type definition statements in Haskell (data, type, newtype) is
> a bit too large. at least, newtype definition seems to be superfluous - it
> can be replaced by the same `data` definition:
>
> newtype A = A
Hello Haskell,
number of type definition statements in Haskell (data, type, newtype) is a bit
too large. at least, newtype definition seems to be superfluous - it
can be replaced by the same `data` definition:
newtype A = A Int
and
data A = A Int
is equal, excluding for internal representation
Hello Haskell,
1) where can i find articles from Estonia conference?
2) they all say that GADT is great, but i personally don't "feel"
GADTs. can anyone write a paper about it for beginners like me,
or may be just collect examples of using GADT in real programs?
--
Best regards,
Bulat
Am Freitag, 14. Oktober 2005 16:25 schrieben Sie:
> On Fri, Oct 14, 2005 at 04:20:24PM +0200, Wolfgang Jeltsch
> <[EMAIL PROTECTED]> wrote:
>
> > I always couldn't understand why one has to write regular
> > expressions as strings
>
> Because the language used inside these strings is standard,
> mu
Ketil Malde <[EMAIL PROTECTED]> writes:
> David Roundy <[EMAIL PROTECTED]> writes:
>
> >> Bah, simple libraries. They don't have to be part of the Standard
> >> Prelude.
>
> > I completely agree. I'd rather decrease the number of libraries defined in
> > the language itself and decouple librar
On 10/15/05, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
> Before you read any more, let me just say I'm fairly new to Haskell, so
> forgive
> me if this is really basic stuff.
>
>
> Hi there, I'm just wondering if there is a command for emptying a list?
>
Variables in haskell do not vary.
So th
Am Freitag, 14. Oktober 2005 16:26 schrieben Sie:
> On Fri, Oct 14, 2005 at 04:20:24PM +0200,
> Wolfgang Jeltsch <[EMAIL PROTECTED]> wrote
>
> a message of 23 lines which said:
> > alpha = ('A' `to` 'Z') ||| ('a' `to` 'z')
>
> If you intend to seriously specify a new language for regexps, ple
16 matches
Mail list logo
