a great opportunity to
update your webpages, make new releases, announce or even start new
projects, or to talk about developments you want every Haskeller to
know about!
Looking forward to your contributions,
Mihai Maruseac and Janis Voigtlaender (for this edition)
FAQ:
Q: What format should I writ
Dear all,
The Haskell Communities and Activities Report has been produced twice a
year for more than ten years now:
http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report
I have been responsible for producing it the last few years, which was
fun. I am now looking to pass t
===
CALL FOR PAPERS
ACM SIGPLAN 2010 Workshop on
Partial Evaluation and Program Manipulation (PEPM'10)
Madrid, January 18-19, 2010
(Affiliated with POPL'10)
d package contains an automatic Template
Haskell deriver for Zippable instances, so you don't have to write the
above instance definition yourself.
The implementation is by Joachim Breitner.
Ciao,
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.
Bulat Ziganshin wrote:
Hello Cristiano,
Thursday, July 9, 2009, 4:55:09 PM, you wrote:
the best known example is chessmate implementation in Wadler's "why
functional programming matter"
Aeh, ... "Wadler's" -> "Hughes'"
--
Dr. Janis Voi
decreased in some areas? I am pretty
sure that a week ago or so I could use Hayoo to find
sumP :: Num a => [:a:] -> a
from GHC.PArr.
Now, that result does not turn up anymore.
Ciao,
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf.tu-dres
ing the definition of
"otherwise".
Ciao,
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf.tu-dresden.de
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ord. It is just defined as a normal function
like so:
otherwise = True
Ciao,
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf.tu-dresden.de
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
===
CALL FOR PAPERS
ACM SIGPLAN 2010 Workshop on
Partial Evaluation and Program Manipulation (PEPM'10)
Madrid, January 18-19, 2010
(Affiliated with POPL'10)
Janis Voigtlaender wrote:
Hi all,
If you are anyway near Halle/Saale in June, be sure not to miss out on:
I meant "anywhere near", of course :-)
And even if you are not anyway or anywhere near, you might still want to
come just for the occasion :-)
--
Dr. Janis Voigtla
Hi all,
If you are anyway near Halle/Saale in June, be sure not to miss out on:
http://iba-cg.de/hal4.html
We have already close to 50 registered participants, so expect a very
lively meeting. See you there? (Late registration still possible.)
Ciao,
Janis.
--
Dr. Janis Voigtlaender
http
t maybe we
can increase our coverage of all that is going on in the community.
Feel free to circulate this announcement further in order to
reach people who might otherwise not see it. Enjoy!
Janis Voigtlaender
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf
rrowsHaskellWorkshop.pdf
Ciao,
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf.tu-dresden.de
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
note the same
mathematical function?
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf.tu-dresden.de
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Note that potential participants in the below summer school should
pre-register their interest *now*. The organizers need that information
to go ahead with the planning.
Matthew Fluet (ICFP Publicity Chair) wrote:
International Summer School on Advances in Programming Languages
===
CALL FOR PAPERS
The Seventh Asian Symposium on
Programming Languages and Systems (APLAS 2009)
Seoul, December 14-16, 2009
http://ropas.snu.ac.kr/aplas09
More
information can be found in the original Call for Contributions at:
http://www.haskell.org/pipermail/haskell/2009-April/021180.html
I look forward to receiving your contributions.
Thanks a lot,
Janis (current editor)
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mail
free theorem.
To see how the free theorem allows you to switch from an arbitrary type
to just integers, set t2=Int and simply use f to build a
order-preserving bijection between elements in the list x and a prefix
of [1,2,3,4,...]
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dres
that change a lot.
Do not resend complete entries if you have not changed them.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:vo...@tcs.inf.tu-dresden.de
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.hask
GHCi, version 6.8.2: http://www.haskell.org/ghc/ :? for help
Loading package base ... linking ... done.
Prelude> let myprint=print
Prelude> :t myprint
myprint :: (Show a) => a -> IO ()
Can providing some type annotations (interactively in ghci or in
John Ky wrote:
Having created a new class is it possible to do some magic so that it
can be put it into a deriving clause?
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/derive
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED
Janis Voigtlaender wrote:
Martin Hofmann wrote:
I've already posted this mail on haskell-cafe, but apparently the
subject suggested a too simple question, so I try it here again. I am
picking up a discussion with the same topic from haskell-users on
8th November.
Note that you have
can track it down with Debug.Trace.trace.
If so, can I prevent this using CPS?
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
n
increase our coverage of all that is going on in the community.
Feel free to circulate this announcement further in order to
reach people who might otherwise not see it. Enjoy!
Janis Voigtlaender
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[E
trained, as you suggest.
And finally, another plug: explanations for precisely the kind of
type-based reasoning I used in the earlier mail can be found in the
thesis I advertised today on the general list:
http://wwwtcs.inf.tu-dresden.de/~voigt/habil.pdf
Ciao, Janis.
--
Dr. Janis Vo
answer is no, one cannot have
different funtor instances.
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Janis Voigtlaender wrote:
A free theorem can be used to prove that any
f :: (a -> b) -> [a] -> [b]
which satisfies
f id = id
also satisfies
f = map (for the Haskell standard map).
Here comes the full proof.
Feed http://linux.tcs.inf.tu-dresden.de/~voigt/ft/ with the type o
=Bool, x::f Int,
(fmap even x)::f Bool, type error since you assumed fmap even x = x !
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Janis Voigtlaender wrote:
Luke Palmer wrote:
I've been wondering, is it ever possible to have two (extensionally)
different Functor instances for the same type? I do mean in Haskell;
i.e. (,) doesn't count. I've failed to either come up with any
examples or prove that they
more constructive proof at the moment ;-)
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Henning Thielemann wrote:
On Sat, 22 Nov 2008, Janis Voigtlaender wrote:
Definitely. And that surfaces even in quite innocently looking programs
and statements about them. The introductory example of the following
technical report may be amusing in that respect:
http://wwwtcs.inf.tu
Ryan Ingram wrote:
On Sat, Nov 22, 2008 at 5:33 AM, Janis Voigtlaender
<[EMAIL PROTECTED]> wrote:
You can generally make a persistent data structure with the same
asymptotic bounds as the ephemeral structure, ...
I would be very careful with the "generally" here. At least
Alexey Khudyakov wrote:
putStrLn "Ну и где этот ваш хвалёный уникод?"
:-)
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.h
or the
underlying Zippable class, Joachim Breitner has implemented an automatic
TH deriver (makeZippable) using the derive-package. So no manual
boilerplate at all is necessary to use this version of generic zip.
(And there is also a tryZipWith.)
Ciao, Janis.
--
Dr. Janis Voigtlaend
complete the picture...
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ograms
and statements about them. The introductory example of the following
technical report may be amusing in that respect:
http://wwwtcs.inf.tu-dresden.de/~voigt/TUD-FI08-08.pdf
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL
* semantics anywhere
around to which you one could prove equivalence.
So, to be precise, the question you are interested in cannot even really
be asked at the moment.
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
__
Rafal Kolanski wrote:
..., until I found someone's code
snippet online ... and extrapolated from that.
Oh yes, I love that kind of programming. Hardly possible in other
languages than Haskell. :-)
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROT
n text or LaTeX
format. More information can be found in the original Call for
Contributions at
http://www.haskell.org/pipermail/haskell/2008-October/020651.html
I look forward to receiving your contributions.
Thanks a lot,
Janis (current editor)
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-d
Ketil Malde wrote:
Janis Voigtlaender <[EMAIL PROTECTED]> writes:
Since just about every floating point operation involves some sort of
loss of precision, repeated rounding is a fact of life.
Of course. But that was not the point of the discussion...
Well, allow me to contrib
"political" explanation.
And yes, the "avoiding bias" explanation makes sense, but not the "this
way of rounding makes repeated rounding safe" explanation.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
another school, but another world
(politically, pre-'89 ;-).
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ketil Malde wrote:
Janis Voigtlaender <[EMAIL PROTECTED]> writes:
If you round to odd instead of round to even, then 4.5 rounds to 5,
Well, of course I did not learn to round to odd. I learned to round .5
to above, but not to do repeated rounding.
Since just about every floating
Felipe Lessa wrote:
On Mon, Oct 27, 2008 at 8:30 AM, Janis Voigtlaender
<[EMAIL PROTECTED]> wrote:
Well, of course I did not learn to round to odd. I learned to round .5
to above, but not to do repeated rounding.
Nobody rounds in passes, of course =).
Oh, Mrs. "I forg
et share school in fourth
grade when rounding was taught.
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Janis Voigtlaender wrote:
2.4x -> x
That's supposed to be 2.4x -> 2, of course.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.
Felipe Lessa wrote:
On Mon, Oct 27, 2008 at 8:15 AM, Janis Voigtlaender
<[EMAIL PROTECTED]> wrote:
That is of course true (and was the topic of heated discussion with my
fourth grade math teacher), but does not explain 2.5 -> 2.
If you round to odd instead of round to even, then 4
- (round to one place) -> 0.5 - (round to integer) -> 1
but
0.45 - (round to integer) -> 0
That is of course true (and was the topic of heated discussion with my
fourth grade math teacher), but does not explain 2.5 -> 2.
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu
LaTeX
format. More information can be found in the original Call for
Contributions at:
http://www.haskell.org/pipermail/haskell/2008-October/020651.html
I look forward to receiving your contributions.
Thanks a lot,
Janis (current editor)
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresd
check ;-)
See the "y <- scramble x" part.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
b, Show b, Ord b)
The compiler doesn't know what kind of list you are trying to read,
sort, and print. Try something like:
(l::[Int]) <- readLn
in the penultimate line.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
#x27; and complicated and beyond me" attitude. Such people
need to stop acting like five year old children.
Not that it has much to do with the debate, but the attitude you
complain about is the exact opposite of the attitude of any five year
old children that *I* know (well, my son primar
.gmane.org/gmane.comp.lang.haskell.cafe/45967
Thanks, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ntry will be
reused in this case, but it might be dropped if it is older than a year,
to give more room and more attention to projects that change a lot.
Do not resend complete entries if you have not changed them.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de
Thomas Davie wrote:
On 26 Sep 2008, at 12:12, Janis Voigtlaender wrote:
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he help the enemy?
I'm so glad I don't under
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he help the enemy?
I'm so glad I don't understand this ;-)
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voi
Jules Bean wrote:
Marc Weber wrote:
On Tue, Sep 23, 2008 at 01:37:56PM +0200, Janis Voigtlaender wrote:
Hi,
assume I have a program taking input from stdin. How do I call it from
Haskell while feeding to it a string as input.
Sure, have a look at
http://hackage.haskell.org/packages
Marc Weber wrote:
On Tue, Sep 23, 2008 at 01:37:56PM +0200, Janis Voigtlaender wrote:
Hi,
assume I have a program taking input from stdin. How do I call it from
Haskell while feeding to it a string as input.
Sure, have a look at
http://hackage.haskell.org/packages/archive/process/1.0.0.0
file, say "temp", and then
calling
system (cmd ++ " < temp")
Of course, without actually creating that temporary file and having to
clean it up afterwards.
Does such a system' exist?
Thanks, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.t
Bulat Ziganshin wrote:
Is there a
a Haskell to Java compiler that's
already ready to use?
CAL
Just in case this answer was a bit cryptic for the original poster...
What Bulat means is the following:
http://labs.businessobjects.com/cal/
--
Dr. Janis Voigtlaender
http://wwwtcs.i
t;
:1:8: Not in scope: `connectSqlite3'
ghci> :type conn
:1:0: Not in scope: `conn'
ghci> disconnect conn
:1:0: Not in scope: `disconnect'
:1:11: Not in scope: `conn'
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.o
Janis Voigtlaender wrote:
Wei Hu wrote:
Thanks for pointing out the sharing part. My original question is
still unanswered: for lazy monads, can we give such a general mfix
definition?
...
(Constructing an explicit counterexample is left as an exercise ;-)
Oh, I couldn't resist to
aring,
but really with respect to the expected outcome of the computation.
(Constructing an explicit counterexample is left as an exercise ;-)
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell
hypothesis about whether or not your >>= is lazy. For
then proving that hypothesis, the paper (and probably other papers it
cites) also provides some techniques that might be of use to you.
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
m
st.psu.edu/704350.html)?
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Don Stewart wrote:
If you can demonstrate the required laziness/strictness properties
are identical, looks like a nice idea.
I think they are not identical, as something along Antoine's second
example demonstrates.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
m
[]
conflicts with this.
BTW, you might want to have this kind of discussion at
[EMAIL PROTECTED] instead. See the announcement:
http://thread.gmane.org/gmane.comp.lang.haskell.general/16345
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~v
Jon Harrop wrote:
On Sunday 13 July 2008 10:00:49 Janis Voigtlaender wrote:
It is really just a short discussion, but Haskell STM is featured in an
article of this month's Communications of the ACM:
http://doi.acm.org/10.1145/1364782.1364800
Is the article freely available any
It is really just a short discussion, but Haskell STM is featured in an
article of this month's Communications of the ACM:
http://doi.acm.org/10.1145/1364782.1364800
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROT
specifically referring to the book "Term
Rewriting and all That" by Baader and Nipkow.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.h
OpenGL-GL-VertexSpec.html#v%3AColor3>
!a !a !a
http://cvs.haskell.org/Hugs/pages/libraries/OpenGL/Graphics-Rendering-OpenGL-GL-VertexSpec.html#t%3AColor3
In short,
http://haskell.org/onlinereport/decls.html#strictness-flags
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
m
x27;s own liking. Obviously, people on the Curry list will know more
about the details...
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http:/
Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
point the finger
of accusation at someone/something you have three pointing back at
yourself.
Well, at least not this finger...
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing
natural. Just google for "theory of
containers".
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
tes to draw up their report,
but maybe we can increase our coverage of all that is going on in the
community.
Feel free to circulate this announcement further in order to
reach people who might otherwise not see it. Enjoy!
Andres Loeh and Janis Voigtlaender
--
Dr. Janis Voigtlaender
http:/
ext, the IOSpec library springs to mind:
http://www.cs.nott.ac.uk/~wss/repos/IOSpec/
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ariel J. Birnbaum wrote:
(considering "undefined" as equivalent to "const undefined", which iirc was
the definition of _|_ for function types).
What am I missing?
undefined /= const undefined
in Haskell, due to seq.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresd
http://homepages.inf.ed.ac.uk/wadler/papers/arrows/arrows.pdf
("idioms" is a synonym for "applicative functors", and both papers also
discuss the relation to monads.)
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mai
gt;>= h
you get only one:
*Main> foo' Nothing'
match
Nothing'
For a way to obtain such improvements automatically, and without
touching the code, you may want to look into
http://wwwtcs.inf.tu-dresden.de/~voigt/mpc08.pdf
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
or LaTeX format. More information can be found in the original Call for
Contributions at
http://www.haskell.org/pipermail/haskell/2008-April/020378.html
We look forward to receiving your contributions.
Thanks a lot,
Andres and Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.
y an old entry, we will send you your old entry as a
template within the next hours (provided we have your valid email address).
Please modify that template, rather than using your own version of the old
entry as a template. Don't worry about writing correct LaTeX, we will be
able to handle
any further questions.
Please also forward to potentially interested students.
The closing date for applications is 15th May 2008.
Best wishes,
Janis Voigtlaender
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED
Loup Vaillant wrote:
By "higher order types", I meant the type of runST (ST monad),
or dpSwich (in yampa). I meant things like
"(forall a, a-> b) -> a -> b"
That's then usually called "higher-rank polymorphic types", just in case
you need more keyw
apfelmus wrote:
Janis Voigtlaender wrote:
Loup Vaillant wrote:
Thanks to some geniuses (could someone name them?), we have type
classes and higher order types in Haskell (and even more).
As far as names go:
for type classes, of course Wadler, but also Blott and Kaes.
for
. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
stead of putting g x
in brackets.
You can get the same behavior with
f . g $ x
if you mislike brackets.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
n their level of complication,
of making this more generic, rather than inventing your own Quadruple.
Probably they are overkill for your goal.)
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
/Homework_help
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Andrew Coppin wrote:
Janis Voigtlaender wrote:
Google -> http://research.microsoft.com/~simonpj/papers/ndp/
I don't think the above suggests that "nothing is happening" ...
The latet thing on that page is dated over a year ago.
Well, if you expect monthly update
I don't think the above suggests that "nothing is happening" ...
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
apfelmus wrote:
Janis Voigtlaender wrote:
when searching through gmane, and selecting a single message with a
hit, one gets only to see that message without its context thread. At
least I could not find out a way to switch from the found message to
the thread in which it occurred.
The
Calvin Smith wrote:
On 02/14/2008 11:13 PM, Janis Voigtlaender wrote:
Don Stewart wrote:
voigt:
I always use gmane, via:
http://news.gmane.org/search.php?match=haskell
The problem with this is that when searching through gmane, and
selecting a single message with a hit, one gets only
prior to November 2007, and from 2008.
Too bad...
Ciao,
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
oup is aware of the hitchhiker books (see the reference to the
Great Question of ... Everything).
So unless Douglas Adams wrote some Haskell papers I am not aware of, the
original question is still open ;-)
Happy weekend...
Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresde
ng list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mail
Ryan Ingram wrote:
On 10/18/07, Janis Voigtlaender <[EMAIL PROTECTED]> wrote:
Yes, but that's a problem of the Arrow library writer, not of GHC. The
compiler will never check a RULE.
I'm going to disagree a bit here; it's not the problem of the Arrow
library writer at
visits to York.
Suggestions, experiences and bug reports are welcome!
Matthew.
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[
heck a RULE. So I can, for example, write a rule
that "sum xs" is zero for any list xs.
I think what Simon was asserting is that none of the internal logic of
GHC assumes any laws to hold for any type classes. If the programmer
tricks the compiler by providing wrong RULES in source files,
only laxly
compliant, or not at all.
Ciao, Janis.
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
mailto:[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
1 - 100 of 129 matches
Mail list logo
