Sorry for that, but
Am Donnerstag, dem 06.10.2022 um 14:28 +0200 schrieb Joachim Breitner:
> To nominate yourself, please send an email to me (as the committee
> secretary) at m...@joachim-breitner.de until February 11th.
>
should be October 16th.
Cheers,
Joachim
--
Joachim Breitner
m...@j
Dear Haskell community,
the GHC Steering committee is seeking nominations for one or more new
members.
The committee scrutinizes, nitpicks, improves, weighs and eventually
accepts or rejects proposals that extend or change the language
supported by GHC and other (public-facing) aspects of GHC.
Ou
Hi Joachim,
I would like to nominate myself for a spot on the GHC Steering Committee if the
committee thinks it is appropriate. I have been writing Haskell programs for
pretty much as long as Haskell has been around. (I started with Miranda in 1987
and tracked the Haskell reports as they became
Dear Haskell community,
the GHC Steering committee is seeking nominations for at least two new
members.
The committee scrutinizes, nitpicks, improves, weights and eventually
accepts or rejects proposals that extend or change the language
supported by GHC and other (public-facing) aspects of GHC.
Dear Haskell community,
The three-year term limit of some of the GHC Steering committee
members has expired. We are really grateful for the awesome work
that Iavor, Richard, and Joachim have done through these years
(especially the latter, who has acted as secretary.) As a result, the
GHC Steering
Dear Haskell community,
the GHC Steering committee is seeking nominations for one new member.
The committee scrutinizes, nitpicks, improves, weights and eventually
accepts or rejects proposals that extend or change the language
supported by GHC and other (public-facing) aspects of GHC.
Our proces
Dear Haskell community,
the GHC Steering committee is seeking nominations for two or three
new member.
The committee scrutinizes, nitpicks, improves, weights and eventually
accepts or rejects proposals that extend or change the language
supported by GHC and other (public-facing) aspects of GHC.
O
Dear Haskell community,
the GHC Steering committee is seeking nominations for a new member.
The committee scrutinizes, nitpicks, improves, weights and eventually
accepts or rejects proposals that extend or change the language
supported by GHC and other (public-facing) aspects of GHC.
Our processe
Have you taught a course using Hutton's textbook on
Programming in Haskell? If so, please read on!
As part of the national assessment of universities in
the UK that takes place every 5-6 years, I'm producing
a case study on the impact of the book on student and
professional training. The case s
Dear Haskell community,
I have recently written an introductory-level tutorial article about
GADTs in GHC (inspired by LASER 2012 summer school and to be submitted
to their proceedings).
I have already send this draft to the "Haskell Cafe" mailing list, but
I was also advised to use these mailing
ad.
This can be improved to use the standard Text.XHtml library.
*RedHandlers:* It is another HTTP request handlers library to build
standalone web apps.
* They deal with request data as usual.
* There are also combinators for mapping part of the URL to public folders
in the file system.
* And o
skell
> community, especially those who are learning. Any feedback would be
> greatly appreciated, especially if it helps improve the article before
> publication. A draft can be found here:
>
>
> http://www.cis.upenn.edu/~byorgey/papers/typeclassopedia-draft-090216.pdf
>
> Al
f it helps improve the article before
>> publication. A draft can be found here:
>>
>>
>> http://www.cis.upenn.edu/~byorgey/papers/typeclassopedia-draft-090216.pdf<http://www.cis.upenn.edu/%7Ebyorgey/papers/typeclassopedia-draft-090216.pdf>
>>
>> Also see my
//www.cis.upenn.edu/~byorgey/papers/typeclassopedia-draft-090216.pdf
>
> Also see my blog post for a bit more info:
>
>
> http://byorgey.wordpress.com/2009/02/16/the-typeclassopedia-request-for-feedback/
>
> happy haskelling!
> -Brent
>
sopedia-draft-090216.pdf
Also see my blog post for a bit more info:
http://byorgey.wordpress.com/2009/02/16/the-typeclassopedia-request-for-feedback/
happy haskelling!
-Brent
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Dear Don,
thanks very much!
You may need to write the strings to the database using the utf8-string
package.
My program may not be the only one writing into the database. But I now
*read* from the database using utf8-string, which solves the problem:
import Codec.Binary.UTF8.String ( decode
kalman:
> Excuse me if this question is misplaced or too trivial.
>
> I'm writing a CGI program in Haskell (CGI/HDBC/Sqlite3), the database
> contains UTF-8 strings. If I use HDBC.fetchRow() to retrieve the data,
> then HDBC.fromSql() to convert the data to Haskell, then Text.XHtml
> construc
Excuse me if this question is misplaced or too trivial.
I'm writing a CGI program in Haskell (CGI/HDBC/Sqlite3), the database
contains UTF-8 strings. If I use HDBC.fetchRow() to retrieve the data,
then HDBC.fromSql() to convert the data to Haskell, then Text.XHtml
constructs to dsplay it, I
ay!
Finally, a request:
We're a little short on crashspace, and I suspect this is affecting who's
able to show up. Could people who can only make it with crashspace (or who
can only make one day without) add their names on the wiki? Is there
anyone in the area able to offer people at le
I think you should add the form:
(function -> pattern) @ pattern
as well. The reason you don't need general 'pattern @ pattern' with
normal patterns is that, if anything is going to match, the two
patterns must have the same outermost constructor, so you can push
the @ inside. This doesn't
The problem, and we've been through this before, is that it's very
tempting to use types like Maybe because it's there, when it's better
replaced with a custom algebraic data type.
i'm sure we have, and others before us. i was just arguing that one
is not necessarily better than the other. i'm n
G'day all.
Quoting Claus Reinke <[EMAIL PROTECTED]>:
> different =/= wrong !-)
[...]
> but that is not what you're saying there at all! you're saying that -within
> view 'view' of Typ- Typ is mapped to either Unit or Arrow, if the mapping
> is successfull. there can be other views of Typ, and t
I think that the signature
type Typ
unit :: Typ -> Maybe ()
arrow :: Type -> Maybe (Typ,Typ)
is *wrong* if what you really mean is
type Typ
data TypView = Unit | Arrow Typ Typ
view :: Typ -> TypView
different =/= wrong !-)
That is, if what you mean is that every Typ i
Hi everyone,
Thanks for all the helpful feedback! It's great to see what people
think.
Let me just respond to one point at the moment:
I think that the signature
>type Typ
>
>unit :: Typ -> Maybe ()
>arrow :: Type -> Maybe (Typ,Typ)
is *wrong* if what you really mean is
>ty
The whole point of a view is that you make views that are semantically
useful.
data UsefulView = Unit | Arrow Type Type
usefulView :: Type -> UsefulView
size :: Type -> Integer
size (usefulView -> Unit) = 1
size (usefulView -> Arrow t1 t2) = size t1 + size t2
yes, but my point (of view;) was
G'day all.
"Claus Reinke" <[EMAIL PROTECTED]> schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
> >type Typ
> >
> >unit :: Typ -> Maybe ()
> >arrow :: Type -> Maybe (Typ,Typ)
> >size :: Typ -> Integer
> >size (unit -> ()) = 1
> >size (arrow -> (t1,t2)) = size t1 + size t2
The
iew pattern in that
paper and I didn't read the other proposals.
Kind regards
Andreas
- Original Message -
From: "Dan Licata" <[EMAIL PROTECTED]>
To:
Sent: Monday, July 23, 2007 11:09 AM
Subject: [Haskell] View patterns in GHC: Request for feedback
> Hi everyo
Hi Man,
"Difficult" is a relative term -- with study and practice, what one once
considered difficult can become easy. With that said, it is true that
beginners to Haskell might find it difficult to define an average function
correctly since Haskell is (for good reason) picky about numeric types
"Claus Reinke" <[EMAIL PROTECTED]> schrieb im Newsbeitrag
news:[EMAIL PROTECTED]
>> though I'm extremely dubious about the utility of the "Maybe" patterns.
>
> actually, they are the main thing that interests me about view patterns!-)
>type Typ
>
>unit :: Typ -> Maybe ()
>arrow :: Type
Dear Haskellers,
why is so difficult to define a function to compute the average of a
list of
numbers??
Warm regards!!!
Man
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
though I'm extremely dubious about the utility of the "Maybe" patterns.
actually, they are the main thing that interests me about view patterns!-)
it connects them to the existing work on first-class patterns (where
combinators over Maybe patterns do the matching work, and view
patterns provi
G'day all.
On Mon, Jul 23, 2007 at 05:09:01AM -0400, Dan Licata wrote:
> Simon PJ and I are implementing view patterns, a way of pattern matching
> against abstract datatypes, in GHC. Our design is described here:
>
> http://hackage.haskell.org/trac/ghc/wiki/ViewPatterns
I have to agree. Great
On Mon, Jul 23, 2007 at 05:09:01AM -0400, Dan Licata wrote:
> Hi everyone,
>
> Simon PJ and I are implementing view patterns, a way of pattern matching
> against abstract datatypes, in GHC. Our design is described here:
>
> http://hackage.haskell.org/trac/ghc/wiki/ViewPatterns
>
> If you have a
Hi everyone,
Simon PJ and I are implementing view patterns, a way of pattern matching
against abstract datatypes, in GHC. Our design is described here:
http://hackage.haskell.org/trac/ghc/wiki/ViewPatterns
If you have any comments or suggestions about this design, we'd love to
hear them. You c
Dear Bulat and Johan, thanks for your comments and pointers.
Johan Jeuring wrote:
> This won't be of much help right now, but Ralf Hinze, Andres Loh and I
> are preparing lecture notes on Comparing approaches to generic
> programming for the Spring School on Datatype-Generic Programming 2006..
S
On 23 Jan 2006, at 13:33, Johan Jeuring wrote:
JW> I'd like to read some overview and comparison on "second-level
JW> programming" in Haskell (and if there is none, I'm willing to
contribute):
This won't be of much help right now, but Ralf Hinze, Andres Loh and I
are preparing lecture notes
JW> I'd like to read some overview and comparison on "second-level
JW> programming" in Haskell (and if there is none, I'm willing to
contribute):
This won't be of much help right now, but Ralf Hinze, Andres Loh and
I are preparing lecture notes on Comparing approaches to generic
programmin
Hello Johannes,
Monday, January 23, 2006, 11:27:58 AM, you wrote:
JW> I'd like to read some overview and comparison on "second-level
JW> programming" in Haskell (and if there is none, I'm willing to contribute):
citating my another letter: "when i was interested in generic
programmimg with Haske
ne tell me what
the official path separator is for ghc -i?).
It doesn't yet work with other compilers/interpreters, but should be
easy to adapt.
It does not handle package files right now.
Request: This will work better as people expose their modules via
http(s). If your modules are visible
On Friday 22 April 2005 09:17, Isaac Jones wrote:
> Benjamin Franksen <[EMAIL PROTECTED]> writes:
> > I finally succeeded using cabal for a project that uses hsc2hs. My
> > problem was/is I need to give special options to hsc2hs, for
> > instance a different template header file to use. Cabal doesn
Benjamin Franksen <[EMAIL PROTECTED]> writes:
> I finally succeeded using cabal for a project that uses hsc2hs. My problem
> was/is I need to give special options to hsc2hs, for instance a different
> template header file to use. Cabal doesn't support this at the moment.
>
> I propose to give th
I finally succeeded using cabal for a project that uses hsc2hs. My problem
was/is I need to give special options to hsc2hs, for instance a different
template header file to use. Cabal doesn't support this at the moment.
I propose to give the user a bit more flexibility with regard to
preprocess
I have a bunch of (polymorphic) function declarations like
foo :: C a
=> A a -- ^ comment
-> B a -- ^ comment
foo = ...
and haddock does a very fine job on them.
but then I wanted (needed) to specialize them,
and to avoid duplicating information, I wrote
type Foo a = A a -- ^ comment
"Simon Marlow" <[EMAIL PROTECTED]> writes:
> You don't need to know :-)
> It's actually in the base package, but GHCi knows about all hierarchical
> libraries without having to specify any extra command-line arguments.
Ai! And here I've been doing :set -package all this time.
-kzm
--
If I hav
Hi everyone.
I've been looking at the restrictions on instances in the H98 standard
and thinking about alternatives. I would like to have a body of data type
and class/instance declarations so I can test how useful various
extensions would be. Please send or direct me to code that requires
-fallo
:[EMAIL PROTECTED] On
Behalf Of Ashley Yakeley
| Sent: 05 September 2003 01:24
| To: [EMAIL PROTECTED]
| Subject: Fundep & Datatype Request
|
| OK, this is an issue I have raised before I think, but I don't
remember
| what the opinion on it was. The following doesn't compile with
OK, this is an issue I have raised before I think, but I don't remember
what the opinion on it was. The following doesn't compile with ghc
-fglasgow-exts (or Hugs -98):
-- ghc -fglasgow-exts -c TypeLambda.hs
module TypeLambda where
{
class Fc a b | a -> b;
instance Fc Bool Int;
confirm 834452
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
my living of. (The resolution of deeply nested typedefs is still broken today).
So enough of that: This is still a haskell list.
Lets go back to the real (read haskell) stuff.
pfitzen
S. Alexander Jacobson writes:
> In principle I can do this, but:
> 1. how do I hide the import of show String to replace it w/ my own?
> 2. If I do replce show String what else will break?
I'd rather let the preprocessor insert calls to eshow, and leave show
as it is.
> 3. If instead I defin
> In principle I can do this, but:
> 1. how do I hide the import of show String to replace it w/ my own?
> 2. If I do replce show String what else will break?
> 3. If instead I define an eshow function that strips "", how do I minimize
> the perforamnce hit of quote stripping?
> 4. If I want to sh
In principle I can do this, but:
1. how do I hide the import of show String to replace it w/ my own?
2. If I do replce show String what else will break?
3. If instead I define an eshow function that strips "", how do I minimize
the perforamnce hit of quote stripping?
4. If I want to share my code,
> > Alex, you might want to explain to people (such as myself)
> > who don't know how Perl etc decide how much white space to insert
> > in the string that's broken across a line. One space? None?
> > What of the indentation spaces on the new line? What if
> > you really want those spaces to a
I've been using a preprocessor to Haskell that I call HacWrite, which
adds a new kind of string appropriate for entering text. Such strings
can span multiple lines and can be escaped using curly brackets:
var1 = 2*2
var2 = 4*var1
var3 = «Foobar»
sqlstring = «insert into mytable values
On 8 Jun, Paul Hudak wrote:
> show x should be a string that when printed looks like the value that
> you would have to type to generate it directly. This example is most
> instructive:
[...]
and this is just cute:
main = putStr (quine q)
quine s = s ++ show s
q = "main = putStr (quine q)\
--6TrnltStXW4iwmi0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable
Tue Jun 08 1999, S. Alexander Jacobson ->
: Fair enough, but then the function should not be called show. The spec
: for show here is an internal serialization format. I guess the right
:
python, does something similar.. they have a """ which allows pre-formated text.
so you can do (psuedo-code)...
string license = """
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
59 Temple Place, Suite 33
"S. Alexander Jacobson" wrote:
> HacWrite certainly seems like an improvement over Haskell.
> However, it is just not as good as the scripting languages.
> HacWrite still requires the author to differentiate between strings and
> other types, still requires explicit use of show and still requires
HacWrite certainly seems like an improvement over Haskell.
However, it is just not as good as the scripting languages.
HacWrite still requires the author to differentiate between strings and
other types, still requires explicit use of show and still requires more
typing and curly balancing. Isn't
> Alex, you might want to explain to people (such as myself)
> who don't know how Perl etc decide how much white space to insert
> in the string that's broken across a line. One space? None?
> What of the indentation spaces on the new line? What if
> you really want those spaces to appear in t
eshow needs to apply to show to non string types.
-Alex-
___
S. Alexander Jacobson Shop.Com
1-212-697-0184 voiceThe Easiest Way To Shop
On Tue, 8 Jun 1999, Martin Norb{ck wrote:
> Tue Jun 08 1
On Tue, 8 Jun 1999, Paul Hudak wrote:
> I agree that Haskell's string notation could be improved, but note that
> you could write:
>
> > sqlstring1 = "insert into mytable values \
> > \(NULL,'"#var1++"','"#(var1+var2)++"','"++var3++"')"
>
That is arguably even more ugly than just consistently
> > var1 = 2*2
> > var2 = 4*var1
> > var3 = "Foobar""
> > sqlstring = "insert into mytable values "++
> > "(NULL,'"++(show var1)++"','"++(show var2)++"','"++var3"');"
>
> It would be much nicer if Haskell did what perl,php, and tcl do:
> > sqlstring="insert into mytable values (NULL,'$var1','$va
A popular thing to do with computer languages (especially scripting
languages) is to manipulate text and insert variables into strings.
It is extremely irritating to escape in and out of strings via ++ in
Haskell or + in Java/Javascript.
e.g.
> var1 = 2*2
> var2 = 4*var1
> var3 = "Foobar""
>
Could somebody tell me how to write a perfect shuffle in Haskell.
Or if this code can be ftped.
Cheers.
Peter Wainwright.
Some quick comments on the Haskell 1.3 proposal.
(1) In the design of Haskell 1.0, the type IOError was a bit of a
guess. It wasn't clear whether it defined too many or too few error
classes; it might even have been better to just replace IOError by type
string. By now, we have more experienc
Haskell users,
As part of the effort to produce version 1.3 of the Haskell report,
we (a group of Haskell users and implementors) have drafted a proposal
for a portable form of monadic I/O in Haskell.
The current version is available at URL
http://www.cl.cam.ac.uk/users/adg/io.html
an
In diku.lists.haskell you write:
>How badly would you miss ~ ?
Not at all. I have never used it.
>How badly would you be hit by the
>restriction on `let' and `where'?
Very little.
Torben Mogensen ([EMAIL PROTECTED])
One goal of Haskell was to act as a basis for future language designs.
This is a question about a language design alternative that is
(probably) too radical for Haskell: but the Haskell community has lots
of relevant experience, and I'd like to know what you think.
I have been toying with a desi
Most Lisp dialects don't have any sort of destructuring for abstract data
types, but I question whether destructuring is really all that useful
anyway. If you have a type with 20 or 30 components -- which is not all
that unusual, in my experience -- it's much easier to grab the ones
Original-Via: uk.ac.earn-relay; Tue, 29 Oct 91 12:05:25 GMT
X-Acknowledge-To:
Dear collegaugs,
I am from the Department of Computers
Czech Technical University Prague.
We are preparing an update of our
functional programmnig course and we
think that Haskell should be thaught here.
We have got th
71 matches
Mail list logo
