is
use Text_Io;
begin
...
end;
...
end Foo;
And while we're at it, what about
- nested modules
- with possibly private sub-modules
similar to the Ada(-95) things.
--
Johannes Waldmann, Institut f\"ur Informatik, UHH, Jena, D-07740 Ge
(pattern doesn't match)
and a (++) (if left arg. fails, try right arg.)
as in
fun x | guardx = ...; fun y | guardy = ...
which "really" is
fun = (\ x - do { guardx, return ...} )
++ (\ y - do { guardy, return ...} )
--
Johanne
cy. I think it looks confusing
to disambiguate ['c'] by writing ['c'] :: [Char].
A naive spectator would say: Clearly 'c' :: Char,
so why should putting brackets around both sides have any effect?
Regards,
--
Johannes Waldmann Institut fur Informatik FSU D-07740 Jena Germany
http://www5.in
and quick answers preferred, as i'll be giving
a talk on monads this afternoon ...
--
Johannes Waldmann Institut fur InformatikUniversitat Leipzig
[EMAIL PROTECTED] http://www.informatik.uni-leipzig.de/~joe/
PF 920, D-04009 Leipzig, Germany Tel/Fax (+49) 341 97 32204 / 32209
languages
require typed declarations.
best regards,
--
Dr Johannes Waldmann Institut fur InformatikUniversitat Leipzig
[EMAIL PROTECTED] http://www.informatik.uni-leipzig.de/~joe/
PF 920, D-04009 Leipzig, Germany Tel/Fax (+49) 341 97 32204 / 32209
I tell
the system to select the first "putStrLn" found, or the last?
another case where the proposed overloading of identifiers would help:
you just write putStrLn = lift . putStrLn,
and let the compiler figure out which one to use.
(so you don't need myPutStrLn at all.)
--
Dr Johan
ds,
--
Dr. Johannes Waldmann Institut fur InformatikUniversitat Leipzig
[EMAIL PROTECTED] http://www.informatik.uni-leipzig.de/~joe/
Augustusplatz, D-04109 Leipzig, Germany, Tel/Fax (+49) 341 97 32 204/209
d probably be the same
as "=" for Haskell since we already got referential transparency).
"with" clauses _must_ be in the header,
but "use" clauses may also be written for local blocks
(an additional plus, IMHO)
--
Dr. Johannes Waldmann Institut fur Informatik
od software engineering to require
that imports be stated at the top of a module.
but it's bad to clutter up the namespace at the same time
(by an unqualified import). that's why i want local "use" clauses as well.
i have no fear of new keywords, provided they name
sensible (and
(but i'd like to use that feature).
well, as i said, it's just a thought.
--
Dr. Johannes Waldmann Institut fur InformatikUniversitat Leipzig
[EMAIL PROTECTED] http://www.informatik.uni-leipzig.de/~joe/
Augustusplatz, D-04109 Leipzig, Germany, Tel/Fax (+49) 341 97 32 204/209
- on the outside it's not visible that T is any Ord instance,
so you cannot compare them at all.
--
Dr. Johannes Waldmann Institut fur InformatikUniversitat Leipzig
[EMAIL PROTECTED] http://www.informatik.uni-leipzig.de/~joe/
Augustusplatz, D-04109 Leipzig, Germany, Tel/Fax (+49) 341 97 32 204/209
gated from "just T" to
"T with the instance decl just given".
alternatively, we could require explicit propagation.
That somehow twists my mind :-)
indeed, i'm not saying the proposal is fully thought out,
or easily implementable.
--
Dr. Johannes Waldmann Institut
y IMHO, of course. but there is hope, as
http://research.microsoft.com/Users/simonpj/Haskell/std-haskell.html#deferred
contains "ad hoc overloading".
--
Dr. Johannes Waldmann Institut fur InformatikUniversitat Leipzig
[EMAIL PROTECTED] http://www.informatik.uni-leipzig.de/~joe/
Augustusplatz, D-04109 Leipzig, Germany, Tel/Fax (+49) 341 97 32 204/209
ould break lots of stuff -
but probably more textbooks than programs.
indeed. perhaps the morale is: if you want Peano numerals,
define them on your own (the "data" declaration above).
--
Dr. Johannes Waldmann Institut fur InformatikUniversitat Leipzig
[EMAIL PROTECTED] http:
i'm looking for Haskell code to read/handle/write .sgf files/game trees
(= smart game format, http://www.red-bean.com/sgf/user_guide/index.html)
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/209 --
me
about functional audio signal processing.
Any pointers appreciated,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/209 --
must have investigated this before.
Perhaps there are convincing arguments why it can't/shouldn't be done?
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/209 --
epts and merits
of functional programming.
Yes I see, for applets and the like,
the problem is more with the interface design,
and less with the internals of the algorithm.
(*) we = our small group of theoretical CS here
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
--
"real time" control, see this outline:
http://www.informatik.uni-leipzig.de/~joe/edu/ws00/praxis/sequencer.html
I'd appreciate your comments. Meta-Comment: Instead of teaching
and programming, I should rather be writing papers and
compile my habilitation thesis...
--
heir Java experience is also my motivation to present
Haskell parser combinators - I know some of the students' previous projects,
which involded writing expression parsers from scratch.
I think they noticed that this isn't funny,
and they will appreciate a good parser combinator library.
Best rega
Overlapping instances for class "Bindable"
A suggestion for a direct fix would be nice,
run it like this: hugs -h4m -98 +o ...
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
=== Drittes
ot; widget (buttons, etc.)
but is there a way to configure the (unnamed) composed widgets
for instance the result of (a `beside` b)?
Any hints appreciated,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
==
- Are there other interesting Monads or Combined Monads to consider?
see
Mark P. Jones and Luc Duponcheel: Composing Monads
Research Report YALEU/DCS/RR-1004, Yale University, New
Haven, Connecticut, USA, December 1993.
http://www.cse.ogi.edu/~mpj/pubs/composing.html
--
-- Johannes
e that the problem could occur
or rather b) prove that the "solution" really prevents it.
Are there extensions of the type system that would be helpful?
Best regards,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 34
shifted from sequencing (the "semicolon")
to "what can we do on the righthand side of let x = ... ",
thus introducing functional programming.
Not sure if this is really a good idea, though...
--
-- Johannes Waldmann http://www.informatik.
nors them when doing a full rebuild of a set of modules.
I imagine that inter-module inlining behaves similar.
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
about efficiency too early.
Who said this, "premature optimization is the root of all evil".
best regards
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 97
apply to names in the standard library?
like Monad (filterM, zipWithM ,..)
I mean, theoretically yes, but is it feasible to change it?
While we're at it, stylistically: the sight of "g" changing to "G"
in getLine - hGetLine (and similar) always irritates me.
Best rega
declarations? It does invite sloppy programming, no?
And does it make life easier or harder for the compiler (writer)?
Best regards,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252
uot; Foo' to make your project.
(i think you need the double quotes.)
best regards
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
`_' in expression
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
)
(my view sure is biased since I somehow belong to category b) above -
my main job is to do research and teaching, not programming and documenting)
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252
want to program exactly this kind of applet in Haskell!)
(*) the server itself runs fine, but the Java applet to play/display games
http://theopc.informatik.uni-leipzig.de/~connect/ currently is broken :-)
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL
://www.cs.ualberta.ca/~zhao/PCP/intro.htm
http://www.informatik.uni-leipzig.de/~pcp/pcpcontest_en.html
also string rewriting: finding/avoiding loops.
this (open!) problem is easily stated: http://www.lri.fr/~rtaloop/95.html
hope this helps. I'm happy to provide more detail.
--
-- Johannes Waldmann http
I was surprised to note that
bounds $ array (0,1) undefined
is undefined ( rather than (0,1) ) - why is this?
just curious,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252
this? Thanks -
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
in an inner loop.
I assume (!) is inlined and specialized by GHC,
but what does hugs do? Does it build and pass around
dictionaries all the time I index an array?
(In my case, I am forced to use (run)hugs.)
Just curious,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe
/text/
best regards,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
cannot believe that
Quantifier variable formula
is the proper syntax in predicate logic.
(Believe me, I've given these tutorials too often :-)
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252
be take as defaults?
perhaps ghc already does this (by specializing) when it uses FiniteMap.lhs.
regards -
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252
I just tried haddock-0.1. Good thing! Two quibbles, though:
* the parser chokes on CVS headers like -- $Id ...$
( but -- -- $Id ..$ is OK)
* is there support for hierarchical namespaces?
( with module Foo.Bar in file Foo/Bar.hs, and so on )
Best regards,
--
-- Johannes Waldmann http
of precedences)
best regards,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
..
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
on formal languages,
so that alone is not enough reason to drop the subject altogether :-)
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
Haskell mailing list
[EMAIL
)
Especially, I would need class D above.
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/252 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo
/
for a brief description, search for Modules for Boardgames in
http://haskell.cs.yale.edu/communities/05-2002/html/report.html
--
-- ungefähr drittes leipziger einrad-picknick am 18. august
-- http://www.informatik.uni-leipzig.de/~joe/juggling/picknick/
-- Johannes Waldmann http
to the above question.
Best regards,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/207 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo
regards,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/207 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
can't express it in the language itself
(that is, if all your functions are first order,
if you can't write polymorphic code,
or can't typecheck it properly, etc.)
as it happens for most of the mainstream languages ...
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe
to have changed a bit since mysql-hs-0.10.1 was written.
Any hints on what direction to take? Thanks,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/207 --
___
Haskell
://www.cs.uu.nl/~daan/parsec.html
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/207 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Dear all, I am looking for a Haskell library for the HTTP/1.1 protocol,
i. e. data types for Requests and Responses,
and functions to read chunked bodies etc. Is there such a thing?
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/207 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/207 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
patterns :-)
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/209 --
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
And didn't GHC also provide binary I/O?
http://www.haskell.org/ghc/docs/latest/html/base/Data.Array.IO.html#4
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/209
a program text.)
Anyway, this was just for the record (I'm a happy Haskell user,
I just ignore some of its features :-), so back to real work now.
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/209
).
this has the advantage that the administrator
can directly view/edit the data base
via the sql shell resp. via webmin.
best regards,
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/209 --
.. .. Viertes Leipziger
/CmdLineOpts.lhs
IMHO preserving the status quo wrt records should be low priority.
It really doesn't bother me much if new (useful) language features break
existing code.
but this might be an issue for others, who have to maintain legacy code.
best regards,
--
-- Johannes Waldmann http
an extension of the type checker
(but not in the interface files, since this kind of overloading
should only happen when using an name, not when defining it).
--
-- Johannes Waldmann http://www.informatik.uni-leipzig.de/~joe/ --
-- [EMAIL PROTECTED] -- phone/fax (+49) 341 9732 204/209
Bentley, J.L., and D. Wood, An optimal algorithm for reporting
intersections of rectangles, IEEE Trans. on Computers C-29 (1980), pp.
571-577. http://citeseer.nj.nec.com/context/2049538/0
best regards
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de
://elearning.htwk-leipzig.de/~autotool/cgi-bin/Face.cgi
(test account: matrikel 318, passwort guest,
then check problem Determine-D-Quiz)
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell
,
--
-- 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
I am looking for an example program
that uses System.Console.Readline
http://www.haskell.org/ghc/docs/latest/html/readline/System.Console.Readline.html
If my main program looks like this:
main = do input - getContents ; handle input
can I just drop in readline somewhere?
--
-- Johannes Waldmann
Martin Norbäck wrote:
main = do input - readline prompt ; handle input
but this only reads one line (and it gives a Maybe String)
I wanted a (lazy) list of all input lines,
where the user should have the usual line editing functions available.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479
.
(Of course, it couldn't change the prompt symbol then,
but I could live with that).
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell mailing list
[EMAIL PROTECTED]
http
languages jump through funny hoops (in this case,
generics) because they just lack proper higher-order types.
good luck with your library. but make sure you study existing (FP)
designs, e. g. Chris Okasaki's Edison:
http://www.eecs.usma.edu/Personnel/okasaki/pubs.html#hw00
--
-- Johannes Waldmann
.
--
-- 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
types are so strong that
you can completely avoid (writing) them.
To me, this seems contrary to sound software engineering.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann
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: (0341) 3076 6479 / 6480
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, Tel/Fax: (0341) 3076 6479
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://www.haskell.org
a 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
- 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
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann
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://www.haskell.org/mailman/listinfo/haskell
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 --
-- http://www.imn.htwk-leipzig.de/~waldmann
: 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
, -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
),
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 list
[EMAIL PROTECTED]
http://www.haskell.org/mailman
). The implementation (in the Prelude) seems to think that ] (in
check0) could possibly be the beginning of a list element.
--
-- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 --
-- http://www.imn.htwk-leipzig.de/~waldmann/ -
___
Haskell
://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.haskell.org
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 --
-- http
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
?) or is this a problem with the library?
Any help appreciated.
--
-- 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
,
--
-- 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
- readFile foo
print (a == b)
main2 = do
writeFile foo A
a - readFile foo
writeFile foo B
b - readFile foo
print (a == b)
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann
.
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
http://www.haskell.org
/~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
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
, the Haskell standard itself does feature some unnecessary
cleverness: abridged names like Bool, fst, snd just don't feel right.
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell
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/Fax (0341) 3076 6479/80 --
http
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
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)!
--
-- Johannes Waldmann -- Tel/Fax
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 the packed string library).
--
-- Johannes Waldmann -- Tel
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.htwk
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://www.imn.htwk-leipzig.de/~waldmann
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
.)
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
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 (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann
a severe criticism - normally I tend to avoid
implementation inheritance and now it looks like I'm advocating it...
best regards,
--
-- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 --
http://www.imn.htwk-leipzig.de/~waldmann/ ---
___
Haskell
1 - 100 of 540 matches
Mail list logo