Register now - for Amazing Talks and Thrilling Tutorials:
HaL-10 Haskell in Leipzig December 4/5
http://nfa.imn.htwk-leipzig.de/HAL2015/
Opens with an invited talk by Joachim Breitner on MonadFix,
closes with a presentation of Liquid Haskell by Michael Beaumont.
- Johannes
HaL-10 Haskell in Leipzig (December 4/5)
http://nfa.imn.htwk-leipzig.de/HAL2015/
We are proud to present Joachim Breitner (nomeata)
as our invited speaker.
The submission deadline (November 2) is approaching!
See you - Johannes Waldmann (PC chair
trägen
* 5. November: Bekanntgabe des Programms
* bis 27. November: Anmeldung
* 4. und 5. Dezember: Workshop
Herzliche Grüße, Johannes Waldmann, Leipzig.
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
, web services, etc.) Rewriting techniques play a relevant
role in computing research, education, and industry.
International Schools on Rewriting are promoted
by the IFIP Working Group 1.6 Term Rewriting.
ISR 2015 organizing committee:
Alfons Geser, Christine Klöden, and Johannes Waldmann
Cali, Colombia
Janis Voigtländer, Universität Bonn, Germany
Johannes Waldmann (chair), HTWK Leipzig, Germany
Peter J. Stuckey, NICTA and the University of Melbourne, Australia
René Thiemann, University of Innsbruck, Austria
Organising Committee
Stefan Brass (chair) Universität
, Brazil
William Byrd, University of Utah
Michael Hanus , Universität Kiel, Germany
Herbert Kuchen, Universität Münster, Germany
Carlos Olarte, DECC, Pontificia Universidad Javeriana Cali, Colombia
Janis Voigtländer, Universität Bonn, Germany
Johannes Waldmann (chair), HTWK
Have you applied Yesod recently? ( http://www.yesodweb.com/ )
Would you enjoy presenting your Yesod project
to C.S. master's students during a course (Oberseminar)
that I'm teaching at HTWK Leipzig currently?
Then email me with details: a short description of your project,
preferrably including (
13th International Workshop on Termination (WST)
Centro Residenziale Universitario di Bertinoro (near Bologna, Italy)
http://www.imn.htwk-leipzig.de/WST2013/
submission: July 22, 2013
notification: July 25, 2013
final version: August 10, 2013
workshop: August 29 - 31, 2013
The W
deadline is June 1!
Best regards - Kristoffer H Rose and Johannes Waldmann.
signature.asc
Description: OpenPGP digital signature
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Hal8 - Haskell in Leipzig, June 21.
visit the workshop web site for program and registration:
http://www.bioinf.uni-leipzig.de/conference-registration/13haskell
See you - Johannes Waldmann.
signature.asc
Description: OpenPGP digital signature
(U Utrecht)
Keisuke Nakano (UEC Tokyo)
Kristoffer H Rose (IBM Watson) (co-chair)
Christian Sternagel (JAIST)
Janis Voigtländer (U Bonn)
Johannes Waldmann (HTWK Leipzig) (co-chair)
Dates:
May 21: deadline for submissions
May 28: notification of acceptance
June 27
)
Christian Sternagel (JAIST)
Janis Voigtländer (U Bonn)
Johannes Waldmann (HTWK Leipzig) (co-chair)
Dates:
May 6: deadline for submissions
May 20: notification of acceptance
June 27: workshop
Submission and Proceedings:
Two categories of submissions are invited:
Extended abstracts
,
Peter Stadler (Univ. Leipzig), Henning Thielemann (Univ. Halle),
Janis Voigtländer (Univ. Bonn), Johannes Waldmann (HTWK Leipzig)
signature.asc
Description: OpenPGP digital signature
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/m
)
Christian Sternagel (JAIST)
Janis Voigtländer (U Bonn)
Johannes Waldmann (HTWK Leipzig) (co-chair)
Dates:
May 6: deadline for submissions
May 20: notification of acceptance
June 27: workshop
Submission and Proceedings:
Two categories of submissions are invited:
Extended abstracts
,
Peter Stadler (Univ. Leipzig), Henning Thielemann (Univ. Halle),
Janis Voigtländer (Univ. Bonn), Johannes Waldmann (HTWK Leipzig)
signature.asc
Description: OpenPGP digital signature
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/m
e RTA programme committee,
Johannes Waldmann.
signature.asc
Description: OpenPGP digital signature
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
w.imn.htwk-leipzig.de/ ,
http://www.leipziger-medienstiftung.de/, http://www.iba-cg.de/
Best regards, Johannes Waldmann (for the Hal5 program committee)
signature.asc
Description: OpenPGP digital signature
___
Haskell mailing list
Haskell@haskel
tutorials and talks.
The primary language is German but we can switch to English
if requested/agreed upon by audience and speaker.
Best regards, Johannes Waldmann, HTWK Leipzig.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.o
team (Aachen University), nicely
summarized here: http://aprove.informatik.rwth-aachen.de/eval/Haskell/
Best regards, Johannes Waldmann.
signature.asc
Description: OpenPGP digital signature
___
Haskell mailing list
Haskell@haskell.org
ion prover
and submit it to this competition.
(Details will be discussed at the workshop.)
Best regards, Johannes Waldmann.
.
Tenth International Workshop on Termination (WST 2009)
Leipzig, Germany, June 3-5, 2009
http://ww
Hello.
I plan to give a course in compiler construction,
using Haskell as the implementation language
(not as source or target language).
Something along these lines:
1. combinator parsers (Parsec),
2. simple interpreter (arithmetical expressions)
3. add algebraic data types, functions
4. type ch
Dear all
I'd like to collect some ideas
for error recovery in Haskell parsers.
cf. http://leiffrenzel.de/eclipse/wiki/doku.php?id=ast ,
feel free to add information to that page.
best regards, Johannes.
___
Haskell mailing list
Haskell@haskell.org
htt
e the eclipsefp Hackathon but for that,
registration is now *closed* (too many people - imagine that!)
Still, you can contribute to this project
anytime via http://leiffrenzel.de/eclipse/wiki/doku.php
Best regards, Alf Richter and Johannes Waldmann.
___
Haske
I'm looking for current Haskell implementations
of (ordered) binary decision diagrams.
(Yes, I tried google but this gives links from 2004 and earlier.)
Thanks - Johannes Waldmann.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskel
)
so if you have something, please tell us. Preference will be given
to reports on Haskell in (business) applications.
Alf Richter (iba Consulting) and Johannes Waldmann (HTWK Leipzig)
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org
> Everyone wants to add extensible records to Haskell.
well ... sure records are better than tuples ...
but interfaces (uh, classes) are still better IMHO
but anyway, is it possible to steal the
design of C#'s anonymous types (classes)?
if not, then why? (this might help
to clarify what we wan
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
> Actually, come to think of it, one great way to show off the language is
> to show off the power of some of the libraries that have been written.
> For example, show how easily a parser can be created w/ Parsec; [...]
yes, Parsec is amazing. I use
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Sterling Clover wrote:
> Templates can be constructed that return strings, ShowSs, bytestrings,
> or even pretty printer Docs that handle wrapping, indentation, and fill
> elegantly. Even better, these templates are parsed and compiled only
> once, af
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Dear all, I'm looking for a Data.Tree.drawTree
that is a bit more "spacefilling" (put some subtrees side by side).
Thanks - Johannes Waldmann, Leipzig.
-BEGIN PGP SIGNATURE-
Version: GnuPG v2.0.4-svn0 (GNU/Linux)
Comment: U
natures.
Best regards, Johannes Waldmann.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Wolfgang Jeltsch wrote:
> I cannot resist citing Henning Thielemann [...]
Amen to that.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
don't even know whether cabal-install is what I want.
It downloads a source package from hackage, builds and installs?
Best regards, Johannes Waldmann.
-BEGIN PGP SIGNATURE-
Version: GnuPG v2.0.4-svn0 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http:
mp.lang.haskell. - Best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
What tool/compiler support is there
for compiling Haskell code to run on a Beowulf cluster?
Any pointers appreciated.
--
Johannes Waldmann, Leipzig, Germany.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Richter, iba consulting; and Johannes Waldmann, HTWK Leipzig.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
e.g. from the functions in the Prelude, or in my programs).
If you want to contribute further to the discussion,
then please do so via http://groups.google.com/group/fp-termination
(I don't want to clutter the haskell mailing list,
but I want to have the discussion in some public place.)
Be
on,
see http://www.lri.fr/~marche/termination-competition/2007/
(Also, I'd welcome your comments on the proposed form
and semantics of the FP category.)
For discussion, please do not use this list but
http://groups.google.de/group/fp-termination
Best regards, Johannes Waldmann.
__
> I.e. you can teach Java without teaching generics or anonymous inner
classes.
but you shouldn't -
if you can teach the type-correct use of arrays (it's done for decades),
then you can teach generic collections (at least their proper usage),
and what's the problem with the anonymous class i
import System.IO.Unsafe (unsafePerformIO,unsafeInterleaveIO)
Whoa! I'd be very cautious recommending these for newbies ...
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
I need some random numbers.
in the IO Monad, hiding the use of a generator
do x <- randomRIO (0, 1 :: Double) ; print x
you can also make the state explicit:
do g0 <- getStdGen ; let { ( x, g1 ) = randomR ( 0, 1::Double) g0 } ;
print x
a RandomGen is actually the state object for the ge
[EMAIL PROTECTED] wrote:
[...] semi-functional programming languages such as Perl [...]
now this is an interesting view ...
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
> [1 of 1] Compiling Main ( hase.hs, hase.o )
> Linking /home/helmut/hase/src/hase ...
> /usr/lib/ghc-6.6/libHSrts.a(Storage.o): In function `initStorage':
> Storage.c:(.text+0xe2c): undefined reference to `__gmp_set_memory_functions'
this is strange since ghc itself has been compiled by ghc,
and
in ...
Compare Java where you can have nested classes and interfaces.
Where of course part of their motivation is
that Java lacks proper (and anonymous) functions.
Best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
xt morning.
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
tax highlighting, typechecking etc.)
should be similar - in theory.
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mail
e the constructors/accessors? I rather not.
http://141.57.11.163/cgi-bin/cvsweb/tool/src/Grammatik/Type.hs.drift?rev=1.6
Best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
_
cg.de/haskell.html
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
hs" but I was hoping
that meanwhile I could just put the info in the .cabal file.
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http:
Is there a library/tutorial that supports/explains
providing web services (SOAP transport, WSDL description)?
I know (and use) haxr (XML-RPC) but it seems
that SOAP is the accepted standard in Java circles nowadays.
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http
Björn has just made a new release
http://www.haskell.org/haxr/download/haxr-20060626.tar.gz
that solves the problems I mentioned. Thanks!
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann
The readString function of
haxr-20060418/Network/XmlRpc/Internals.hs
does not rewrite as space. Should it?
I have at least one Java XML RPC client
that likes to encode spaces that way.
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann
. a process listening on a port,
without the detour along the web server/cgi mechanism?
(cf. the Java variant)
Thanks,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing l
"solution", does it really give me a solution vector?
Thanks,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.
am still curious: does threadDelay use
the wall clock or the per-process clock (CPU time)?
And regardless of the answer - how could one obtain
the opposite behaviour? (I don't find this discussed
in the visible docs. Or am I missing something?)
Best regards,
--
-- Johannes Waldmann --
Donald Bruce Stewart wrote:
> forkIO + killThread && threadDelay
OK that's nice and solves my problem. Thanks!
Is the delay measured on the wall clock
or on the user (per-process) clock?
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leip
ss one answer is "that's not Haskell because
that's not a function". Sure, but I think I need it
anyways, so I would accept some IO .. in the types.
Best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http
n guarantees.
best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
arket" since the students have no choice ...
But most of them accept the challenge. (I'm afraid they'd accept
an advanced Perl(*) hacking course as well.) (*) - replace with
name of any untyped interpreted scripting language.
Best regards,
--
-- Johannes Waldmann -- Tel/Fax (03
s for implicit parameters).
Of course reasoning about programs with typeclasses is hard as well,
but at least at the moment all instances (dictionaries) are global.
On the other hand, this also limits the usefulness of type classes.
In all, it's a design choice.
--
-- Johannes Waldmann -- Tel
age" concept, which is missing from Haskell
(this is worked around at the language level by re-exporting modules,
and at the tool level by Cabal - both kludgy, methinks).
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.im
duce public/private modifiers
http://www.haskell.org//pipermail/haskell-prime/2006-January/000230.html
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haske
27;t care too much about the venue of publication,
so it can be wiki-ized or whatever).
Best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
type implements an interface) and there is
no notation for multi parameter type classes (would need a hypergraph
instead of a graph :-)
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
tional component (bar)
that is ignored by those who don't know them.
This is indeed a severe criticism - normally I tend to avoid
implementation inheritance and now it looks like I'm advocating it...
best regards,
--
-- Johannes Wa
`extQ` ( lshow :: [ a ] -> String )
i. e. use another function if argument type is a list type
BTW: I guess the above is related to
http://homepages.cwi.nl/~ralf/syb3/
Do the current (6.4) ghc compiler/libraries
correspond to what's in that paper?
--
-- Johannes Waldmann -- Tel/Fax (03
ompilation
(if type definition and memorized functions are in different modules.
Again, this is vaguely similar to orphan instances.)
Best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
.
Just my 2 cent (and none of them new, I'm afraid)
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
might still be more efficient than invoking a larger machinery
that would prove (non)termination because after the proof
you'd still have to invest the time into doing the rewrite sequence.
Best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http:
What's the current story on cabal and haddock?
I need to run my sources through ghc -cpp
before giving them to haddock. Does cabal support this
(e. g. by directing the ghc -cpp output to dist/src )?
Thanks,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn
ng hype
is trying to solve do not arise in the first place
if we do functional programming,
but quite some are independent of the paradigm
(e. g. those on naming) - so we should consider carefully
the problem indicators and solutions that have been suggested.
Just my opinion (not specific to t
s to be had."
So if you are teaching (or studying) at a German Fachhochschule
(technical university, sort of), I'd like to know your opinion
(and your institution's opinion). (Please reply to me, not to this list.
Is there a better place for this discussion?)
Vielen Dank (thanks)!
is in fact vcat xs, for a list xs
that is generated item by item.
Is there a way to get more efficient behaviour
without too much rewriting the program?
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann
on with a different language,
what do you recommend: Start from a Haskell data declaration,
and derive a Java representation, directly or indirectly?
Or start from some language independent data declaration,
as it happens (I assume) for JAXB?
Best regards,
--
-- Johannes Waldmann -- Tel/Fa
ifiers". By sticking to
plain ASCII, we enforce longer (and hopefully more meaningful) names :-)
BTW, the Haskell standard itself does feature some unnecessary
cleverness: abridged names like Bool, fst, snd just don't feel right.
--
-- Jo
r the module as well.)
Any ideas or pointers would be welcome.
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
.imn.htwk-leipzig.de/~waldmann/autotool.html
http://141.57.11.163/auto/
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
file.
And ... could we have something in haddock like JavaDoc's "@since" tag?
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
ht
t;foo"
system "echo B > foo"
b <- readFile "foo"
print (a == b)
main2 = do
writeFile "foo" "A"
a <- readFile "foo"
writeFile "foo" "B"
b <- readFile "foo&
B > foo"
b <- readFile "foo"
print (a == b)
best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
rts?
Possibly some of the functionality (parsing boundaries etc.)
is already contained in some HTTP library?
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing li
..."
)
Am I doing something wrong, HTML-wise
(is it allowed to mix TYPE="file" input with other input elements
in one FORM?) or is this a problem with the library?
Any help appreciated.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leip
putStrLn "caught"
return [ 4, 5, 6 ]
print xs
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
long time ago)
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Have you looked at Parsec.buildExpressionParser:
http://www.cs.uu.nl/~daan/download/parsec/parsec.html
(see section "Expressions"). This allows very concise programs,
and you don't need to install any extra library.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480
List.
http://141.57.11.163/cgi-bin/cvsweb/lib/Autolib/Reader/Link.hs?rev=1.2
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.h
t;[ R, R ]"
turns out that check1 and check2 work, but check0 will not (I thought it
would). The implementation (in the Prelude) seems to think that "]" (in
check0) could possibly be the beginning of a list element.
--
-- Joha
.. Actually, looking at the Prelude (now),
there is '$!' as well - is that supposed to answer my question?
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing lis
, -fwarn-misc, and
-fwarn-unused-binds.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
sing order of effort: semantics, syntax, syntax of comments".
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
rite something quite different
(an "obviously useless" computation of the constant True).
Can you explain this to students? Would you be proud of it?
Reminds me of hacks like { int x = 42; String s = x + ""; }
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
--
what exactly
the compiler is missing when translating your program.
Ideally, it should be able to "see" that everything is strict.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
e iterate, fold etc.
http://www.haskell.org/onlinereport/list.html
best regards,
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
data structures and dumb code
works a lot better than the other way around."
http://www.catb.org/~esr/writings/cathedral-bazaar/cathedral-bazaar/ar01s06.html
best regards,
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
--
I wonder if Haskell (HXmlToolbox) has been used for processing XMI data.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http
endent of ghc, written by someone else)
that did "full specialization"?
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http://
ntersectionWithKey :: forall a k a1 a2.
(Ord k) =>
(k -> a2 -> a1 -> a) -> Map k a2 -> Map k a1 ->
Map k a
isSubsetOfBy :: forall a1 k a.
(Ord k) =>
(a -> a1 -> Bool) -> Map k a -> Map k a1 -> Bool
-
lot of similar issues are being discussed
w.r.t. XML processing. see http://citeseer.nj.nec.com/388107.html
and many others.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann
Journal of functional programming 3(4) Oct 1993, pp553-562
\end{display}
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http://ww
al Haskell programs.
> to be used in, e.g. short script-like programs?
sure. but why do we need text processing in scripting?
because the usual OS shells have `string' as their only data type.
we better change that :-) anyone for a fully typed Haskell shell?
--
-- Johannes Waldmann, Te
Per Larsson wrote:
> .. I have since long missed some
typical text processing functionality in haskell.
it is often the case that people process "text"
only because they have no better (structured and typed) way of
representing their data...
--
-- Johannes Waldmann, Tel/Fax: (03
1 - 100 of 181 matches
Mail list logo
