On Mon, 21 Feb 2005, Lemmih wrote:
Some of the features sound familiar. Is Hacanon related to GreenCard or HDirect?
So I ask again, what I always ask: Is there someone working on a Haskell
backend for SWIG? Not that SWIG is outstandingly well organised, but it
provides an extensive framework for
It was argued that people avoid Haskell because of terms from Category
theory like 'Monad'. This problem can now be solved by a wrapper which
presents all the WWW without monads! Start e.g. at
On Tue, 3 Apr 2007, Henning Thielemann wrote:
It was argued that people avoid Haskell because of terms from Category
theory like 'Monad'. This problem can now be solved by a wrapper which
presents all the WWW without monads! Start e.g. at
http://saxophone.jpberlin.de/MonadTransformer
Last autumn I found the 'alsa-midi' package by Soenke Hahn for controlling
digital music instruments over MIDI and I wanted to avoid duplicate MIDI
definitions. Thus I started extracting MIDI code from the Haskore project.
Months later I ended up with some more packages:
On Tue, 3 Apr 2007, Henning Thielemann wrote:
It was argued that people avoid Haskell because of terms from Category
theory like 'Monad'. This problem can now be solved by a wrapper which
presents all the WWW without monads! Start e.g. at
http://saxophone.jpberlin.de/MonadTransformer?source
Hi all,
we like to remind the potential participants of our Local Haskell meeting
HaL4 to submit proposals for talks.
See the recent announcement in German:
http://www.haskell.org/pipermail/haskell/2009-April/021220.html
-
HaL4 : Haskell -
Kindly excuse the German noise, please ...
Liebe Haskell-Freunde!
Das Programm fuer unser Haskell-Treffen steht jetzt so gut wie fest und
man kann sich online anmelden.
-
HaL4 : Haskell - Tutorial + Workshop + Party
am Freitag, dem 12. Juni 2009,
I like to announce a small package for simplified declaration of Storable
instances for records. It may be used alternatively to the C2HS
preprocessor. It was made possible by advanced applicative technology, a
cutting edge LCM monoid and an incredible constructor power tower.
://hackage.haskell.org/package/bibtex-0.0.3
[2] http://code.haskell.org/~thielema/bibtex/hackage.bib
Regards
Henning Thielemann
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
I like to announce cabal-sort:
If you have a bunch of packages that you want to compile or recompile,
then you need an order of compilation that meets the dependencies.
Given a number of cabal package files, cabal-sort reads all those files
and emits them topologically sorted according to their
gdwe...@iue.edu schrieb:
Sifflet 0.1.7 is now available on Hackage.
This release has some changes in its package dependencies,
notably for fgl.
New in This Release
---
- Due to anticipated changes in the API for fgl,
Sifflet now requires fgl 5.4.2.3.
-
On Mon, 18 Oct 2010, Gilmara Pompelli wrote:
Hello
I have a file with 100 lists, with 100 ints.
I have to read the file and apply the map and sort functions on lists.
II did it to read file:
learquivo :: FilePath - IO ([[Int]])
learquivo s = do
conteudo - readFile s
-- Forwarded message --
Date: Fri, 8 Jul 2011 12:11:45 + (UTC)
From: Johannes Waldmann waldm...@imn.htwk-leipzig.de
Subject: [Haskell-cafe] CfP: Haskell Workshop in Leipzig, Germany, October 7
Call for submissions
for our local Haskell Workshop in Leipzig, Germany.
I have uploaded three packages to Hackage that shall simplify maintaining
cabal packages under darcs revision control. They simplify tasks like
uploading packages after some tests, cabal version handling, compiling
multiple local packages in the right order, replacing identifiers in
multiple
Software.
Schicken Sie Beitragsvorschläge als PDF-Dokument bis zum
21.05.2012
per Mail an hal-committee at iba-cg punkt de oder an ein Mitglied des
Programmkomitees.
Programmkomitee
* Henning Thielemann - Univ. Halle (Vorsitzender),
* Petra Hofstedt - BTU Cottbus,
* Alf Richter - iba CG
On Mon, 23 Apr 2012, Henning Thielemann wrote:
Call for submissions and Save the date
for our local Haskell Workshop in Halle/Saale, Germany.
Tutorials, talks, demonstrations ... everything welcome.
Workshop language is German (mainly), and English (by request).
Submission deadline: May
On Wed, 9 May 2012, Angus Comber wrote:
I am trying to create a factorial function in GHC. I am following the
online learnyouahaskell.com book (specifically types-and-typeclasses
page).
Bear in mind this is my day 1 of learning Haskell.
Then beginn...@haskell.org might be a better place to
finden Sie hier:
http://iba-cg.de/hal7.html
und die Anmeldung da:
http://sim.mathematik.uni-halle.de:8080/hal7/
Bitte melden Sie sich bis zum 4. Juli an.
Wir freuen uns auf Ihr zahlreiches Erscheinen!
für das Programmkomitee
Henning Thielemann
On Sat, 1 Dec 2012, Gábor Lehel wrote:
On Fri, Nov 30, 2012 at 11:06 PM, Nate Soares n...@so8r.es wrote:
+1. I agree generally with Gabor's points -- GHC is in the drivers seat. But
at some point we should take a look at all the things GHC has made that did
pay off and that are good and make
Hi Haskellers,
since it is Advent time you might like to listen to a song that I programmed
and performed with the Haskell Live-Sequencer [1]:
http://www.youtube.com/watch?v=O5k0wUh0lj8
and you might want to check the Live-Sequencer, too. The Live-Sequencer allows
to compose songs in
On Thu, 3 Jan 2013, Емануела Моллова wrote:
Hello! :)
I think you should better post your question to haskell-c...@haskell.org.
Then I put this script
import qualified Data.Array.Repa as R
:m +Data.Array.Repa
Z
into the file file.hs,
This is GHCi syntax, but it is not a valid Haskell
On Wed, 15 May 2013, 7stud wrote:
Well, my question does not meet the standards for a question at stackoverflow:
(I am a haskell beginner)
Then you might want to post your question to haskell-beginners mailing
list.
Is one solution more efficient than the other? I believe my solution is
I have prepared the package set-cover for solving exact set cover
problems. It includes example programs for solving Sudoku, 8 Queens, Soma
Cube, Tetris Cube, Cube of L's, and Logika's Baumeister puzzle. Please
refer to these examples for learning how the library works.
The solver is
Hi all,
it's again Advent time and I took the opportunity to program another song
for you. Those who liked last year's songs [1,2,3] may also be interested
in the new one:
http://www.youtube.com/watch?v=0EQCgi5qa3E Alta trinita beata
It employs the great Haskell live sequencer and a
The first announcement this year:
The 'unicode' package contains functions for construction of various
characters like:
* block graphic elements
* frame elements
* fractions
* subscript and superscript characters
http://hackage.haskell.org/package/unicode
The package is simple Haskell
-Treffen HaL-9
Wann: Freitag, 2014-06-20
Wo: Institut für Informatik an der Martin-Luther-Universität
in Halle an der Saale
Der offizielle Aufruf zum Einreichen von Beiträgen folgt demnächst.
Mit besten Grüßen
Henning Thielemann
___
Haskell mailing list
die Beitragsvorschläge als PDF-Dokument bis zum
27. April 2014
an
hal-commit...@iba-cg.de
Wir werden Ihnen bis zum 9. Mai mitteilen, ob wir Ihren Beitrag in das
Programm aufnehmen.
Für das Organisationsteam
Henning Thielemann
___
Haskell
In case I did not announce it before - I wrote a set of two small
programs that upload videos to YouTube. It is useful in two situations:
1. Upload a list of videos with metadata fetched from a spreadsheet.
2. Upload from a remote machine without a graphical browser.
://sim.mathematik.uni-halle.de:8080/hal9/
Anmeldeschluss ist 2014-06-11. Frühes Anmelden sichert Plätze in den
beliebtesten Tutorien!
Viele Grüße
Henning Thielemann
--
Read the whole topic here: Haskell Art:
http://lurk.org/r/topic/6sT8bnDabQ3yRxF8plXb9z
To leave Haskell Art, email haskell-...@group.lurk.org
://sim.mathematik.uni-halle.de:8080/hal9/
Anmeldeschluss ist 2014-06-11. Frühes Anmelden sichert Plätze in den
beliebtesten Tutorien!
Viele Grüße
Henning Thielemann
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Right after the announcement of the latest version of Accelerate I like
to announce an application build using that framework:
patch-image assembles a big image from several overlapping parts.
http://hackage.haskell.org/package/patch-image
Now, let me extract the beginning of the docs:
On Tue, 10 Feb 2015, Tyson Whitehead wrote:
I came across something that seems a bit strange to me. Here is a
simplified version (the original was trying to move from a lens
ReifiedFold to a lens-action ReifiedMonadicFold)
You are on Haskell@haskell.org here. Could you please move to
On Mon, 16 Mar 2015, KC wrote:
There has been discussion on matrix operations and cache thrashing; does
management think using Haskell would
lead to cash thrashing?
What could change management's mind?
Unfortunately I don't understand the question, but in any case I think
that better
On Wed, 4 Mar 2015, K Sai Anirudh wrote:
Hello,
I tried to solve simple constraint satisfaction problem. This is my code
http://pastebin.com/VAaRYSEA ; .
This gives solution for present list of domains, but when I change the domain
of 'd' in the list 'ld' then I
get error. I think the
On Mon, 7 Dec 2015, Patrick Redmond wrote:
I'd also like to show support and participate in building this out if work is
needed. Contact me when/if that happens!
haskell@haskell.org is an announcement list. Please continue discussion in
haskell-cafe etc.
So far only announced on Haskell-Cafe, but not the Haskell mailing list:
http://mail.haskell.org/haskell-cafe/2018-March/128730.html
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
I like two announce two of my packages:
1. comfort-array
http://hackage.haskell.org/package/comfort-array
It provides Boxed and Storable arrays with very liberal shape definitions.
You may use ranges of indices like in 'array' or zero-based indexing like
in 'repa', but you can also use
I happily released two other numeric packages based on the comfort-array
types. These are bindings to fast numeric linear programming solvers:
https://hackage.haskell.org/package/comfort-glpk
https://hackage.haskell.org/package/coinor-clp
The first one is (another) binding to GLPK and the
I want to trace calls from a Haskell program to LLVM. I tried ltrace and
latrace. latrace didn't trace anything useful and ltrace shows at least
the call to one function (LLVMBuildRetVoid), but not the other ones. I'm
quite confident that I linked to LLVM dynamically, since the executable is
On Fri, 14 Jan 2011, Henning Thielemann wrote:
I want to trace calls from a Haskell program to LLVM. I tried ltrace and
latrace. latrace didn't trace anything useful and ltrace shows at least the
call to one function (LLVMBuildRetVoid), but not the other ones. I'm quite
confident that I
I have a large package and want to profile all functions of a single module of
that package. I tried to prepend the pragma
{-# OPTIONS_GHC -prof -auto-all #-}
to the mentioned module, but GHC rejects this, because the profiler options are
not allowed in the OPTIONS pragma. According to
On Fri, 5 Nov 2004, Robert Dockins wrote:
What IEEE has done is shoehorned in some values that aren't really
numbers into their representation (NaN certainly; one could make a
convincing argument that +Inf and -Inf aren't numbers).
I wonder why Infinity has a sign in IEEE floating
I encountered the same problem as this guy:
http://www.haskell.org/pipermail/glasgow-haskell-users/2002-May/003407.html
It is still present in GHC-6.2.1. Only if you turn on -fglasgow-exts the
RULES pragma is parsed correctly. I think GHC should give a warning like
turn -fglasgow-exts on for
I want to vote, too.
I am ok with all of
case of
\case
\of
\case of
For me single arguments are enough. We already have this restriction for 'case'
and I can work around it simply by wrapping arguments in pairs temporarily (cf.
curry $ \case ...).
I vote against LambdaIf, since
On Thu, 19 Jul 2012, Herbert Valerio Riedel wrote:
Recently, I was a bit suprised that GHC didn't warn about useless
`where` definitions such as the following when using `-Wall` (and I
couldn't find a respective warning GHC CLI flag which would have enabled
reporting a warning in this case --
On Fri, 23 Nov 2012, José Romildo Malaquias wrote:
When experimenting with the module LLVM.Core in GHCi on my gentoo linux
system, I have got a fatal error:
$ ghci
GHCi, version 7.6.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ... done.
Loading package
The page
http://www.haskell.org/ghc/download
refers to directories for the nightly builds, that are actually empty:
http://www.haskell.org/ghc/dist/current/dist/
http://www.haskell.org/ghc/dist/stable/dist/
:-(
___
Glasgow-haskell-users
I am trying to understand the following linker message. I have started
GHCi, loaded a program and try to run it:
Main main
...
Loading package poll-0.0 ... linking ... done.
Loading package alsa-seq-0.6.0.3 ... can't load .so/.DLL for:
With GHC-7.8 I get lots of warnings like
src/Foo/Bar.hs:215:6: Warning:
Rule foo may never fire
because ‘bar’ might inline first
Probable fix: add an INLINE[n] or NOINLINE[n] pragma on ‘bar’
So far I thought that rewrite RULES always have precedence to INLINE.
Has this changed? I
Am 14.03.2014 18:05, schrieb Simon Peyton Jones:
You may think they are fragile, but not as fragile as saying nothing and hoping
for the best, which is *super*-fragile. You can't rely on rules to take
priority, because the rule only fires if it matches, and it may only match if
some other
I want to import Nat and type-level (=) from GHC.TypeLits:
import GHC.TypeLits (Nat, (=))
Nat is found this way, but (=) is not:
Module ‘GHC.TypeLits’ does not export ‘(=)’
What is the trick?
The doc only shows the anonymous import:
Am 15.03.2014 18:13, schrieb adam vogt:
http://www.haskell.org/ghc/docs/7.8.1-rc2/html/users_guide/syntax-extns.html#explicit-namespaces
is the trick
Great, this works!
Now I run into the next problem: How can I convert a type-level natural
number into a data-level number? The Trac-Wiki
Am 15.03.2014 19:17, schrieb Erik Hesselink:
I think most of the singletons stuff has been moved to the
'singletons' package [0].
Yes, that's it. It means that all Nat related functionality in
'singletons' can be implemented using GHC.TypeLits - interesting.
Using the library I succeeded
Am 16.03.2014 09:40, schrieb Christiaan Baaij:
To answer the second question (under the assumption that you want
phantom-type style Vectors and not GADT-style):
That works, someNatVal was the missing piece.
Now the natural next question is how to perform type-level induction on
Nat. This
Am 16.03.2014 11:29, schrieb Henning Thielemann:
Since the unary natural number kind so ubiquituous in examples, is there
a recommended module to import it from, which also contains the
injectivity magic of FromNat1? I cannot see it in:
http://hackage.haskell.org/package/base-4.7.0.0/candidate
Am 16.03.2014 09:40, schrieb Christiaan Baaij:
To answer the second question (under the assumption that you want
phantom-type style Vectors and not GADT-style):
Now I like to define non-empty vectors. The phantom parameter for the
length shall refer to the actual vector length, not to
Am 16.03.2014 13:48, schrieb Dan Frumin:
This is just a wild guess, but is there a possibility that (1+n) will
produce less complaints than (n+1)?
unfortunately no
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
Am 16.03.2014 14:35, schrieb Carter Schonwald:
You can't with type lits. The solver can only decide concrete values :(
I hoped that with type-level natural numbers all my dreams would become
true. :-)
I'd be also happy if I could manually provide the proof for 1=n+1 and
more complicated
Am 16.03.2014 20:02, schrieb Carter Schonwald:
respectfully,
The current typeLits story for nats is kinda a fuster cluck to put it
politely . We have type lits but we cant use them (well, we can't
compute on them, which is the same thing).
For the past 2 years, every ghc release cycle, I first
Am 17.03.2014 10:22, schrieb Simon Marlow:
On 11/03/2014 22:11, Henning Thielemann wrote:
I am trying to understand the following linker message. I have started
GHCi, loaded a program and try to run it:
Main main
...
Loading package poll-0.0 ... linking ... done.
Loading package alsa-seq
Hi Iavor,
Am 19.03.2014 22:27, schrieb Iavor Diatchki:
I see two separate issues that show in what you describe, so it might be
useful to discuss them separately:
Thank you and Richard Eisenberg for the detailed explanations. For now,
I have just fooled GHC by unsafeCoerceing dictionaries
Am 17.03.2014 15:33, schrieb Henning Thielemann:
Am 17.03.2014 10:22, schrieb Simon Marlow:
package. Perhaps you have a copy of that module on the search path
somewhere, or inside the alsa-seq package?
This would confirm how I understood the linker message. Then I guess
that compiling all
I object strongly to the proposal
http://hackage.haskell.org/trac/haskell-prime/wiki/DoAndIfThenElse
because it solves problems with syntactic sugar with even more sugar,
where no sugar is needed at all.
In order to solve the trouble I propose enhancements
to teachers, compilers and standard
I don't see the benefit of allowing imports anywhere at top-level.
http://hackage.haskell.org/trac/haskell-prime/wiki/AllowImportAnywhere
As with declarations I expect that imported identifiers are visible
everywhere in a module. Thus the search for an imported identifier becomes
even more
On Sun, 22 Oct 2006, Neil Mitchell wrote:
It seems better to change the language so it works like _everyone_
expects it does, rather than become syntax dictators. It's hard enough
persuading people to move from C, but when you tell someone that their
perfectly unambiguous sytnax is wrong,
Cale Gibbard cgibbard at gmail.com, Sun Oct 22 12:23:18 EDT 2006
The 'then' and 'else' visually separate the parts of the
if-expression, and serve to guide one's eyes when reading code
silently, and one's words when speaking it aloud.
This argument is true for every function. I don't see
On Mon, 23 Oct 2006, Philippa Cowderoy wrote:
On Mon, 23 Oct 2006, Cale Gibbard wrote:
Of course I disagree with this course for all the reasons I stated
above. The whole point of having high level programming languages is
so that you can put more work into the tools so that the end
On Tue, 24 Oct 2006, Dave Menendez wrote:
Henning Thielemann writes:
Actually if-then-else isn't used that often today. Most programmers
gave it up in favor of guards.
I question both these statements. Can you cite some evidence here?
I have not made statistics. My subjective
On Tue, 24 Oct 2006, Neil Mitchell wrote:
Actually if-then-else isn't used that often today. Most programmers
gave it up in favor of guards.
I question both these statements. Can you cite some evidence here?
I have 501 if statements in my current project. Yhc has 626. Hoogle
has
On Mon, 6 Nov 2006, Bulat Ziganshin wrote:
Hello Henning,
Monday, November 6, 2006, 1:27:54 PM, you wrote:
print msg `on` mode==debug
but failed because my code frequently contains '$' and there is no way
to define operation with a lower precedence
This could be solved by the
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/FixityResolution
I've added the proposal to the end of that page. In fact, the page
On Wed, 8 Nov 2006, Bulat Ziganshin wrote:
Hello Nicolas,
Wednesday, November 8, 2006, 1:25:23 AM, you wrote:
prec ?? $
over-specification). You want ?? to bind more tightly than does $;
that's exactly what this approach would let you specify.
and how then compiler will guess
On Tue, 7 Nov 2006, David House wrote:
On 07/11/06, Jon Fairbairn [EMAIL PROTECTED] wrote:
I must say though, that I don't like the reasoning that we
can put in fractional fixities because it's a small
change. The way to hell is through a series of small
steps. If using integers to
On Fri, 10 Nov 2006, Ben Rudiak-Gould wrote:
I'm surprised that no one has mentioned showsPrec and readsPrec. Anything more
complicated than negative fixities would require their interfaces to be
changed.
Very true. Does it mean, that the Functional Graph Library has to become
part of the
The page
http://www.haskell.org/haskellwiki/Applications_and_libraries/Mathematics#Number_representations
lists several implementations of several flavours of computable reals,
which may be useful for you.
___
Haskell-Cafe mailing list
On Tue, 21 Aug 2007, Peter Verswyvelen wrote:
Consider the following example code:
data Vector = V Float Float
data Matrix = M Vector Vector
liftV1 f (V x y) = V (f x) (f y)
liftV2 f (V x1 y1) (V x2 y2) = V (f x1 x2) (f y1 y2)
liftM1 f (M x y) = M (f x) (f
On Tue, 21 Aug 2007, Peter Verswyvelen wrote:
Yes indeed, I realized that. I oversimplified my question. I'm basically
trying to model 4D CG/HLSL operations (pixel/vertex shaders) in Haskell.
I tried realToFrac, but that did not work. Then I tried splitting the
instances into Fractional and
On Fri, 24 Aug 2007, Arie Groeneveld wrote:
I defined several functions for calculating the number
of trailing zero's of n!
tm = sum . takeWhile(0) . iterate f . f
where f = flip div 5
This is very elegant! You could also inline 'f'
tm4 = sum . takeWhile(0) . tail . iterate (flip div 5)
On Sat, 25 Aug 2007, Marco Túlio Gontijo e Silva wrote:
Hello there.
I don't know if it's off topic, but I don't know where else to ask.
I've been using Text.Xhtml.Strict, and I'm wondering why the functions
are mostly Html - Html and not HTML a = a - Html, or something
similar. If they were
On Sat, 25 Aug 2007, Andrew Coppin wrote:
Would be nice if I could build something in Haskell that overcomes these.
OTOH, does Haskell have any way to talk to the audio hardware?
Maybe a JACK interface?
http://haskell.org/haskellwiki/Applications_and_libraries/Music_and_sound
On Sat, 25 Aug 2007, Evan Laforge wrote:
Reaktor has a few limitations though.
1. It's virtually impossible to debug the thing! (I.e., if your synth
doesn't work... good luck working out why.)
2. It lacks looping capabilities. For example, you cannot build a
variable-size convolution block -
On Sat, 25 Aug 2007, Andrew Coppin wrote:
Evan Laforge wrote:
To get this back to haskell, at the time I wondered if a more natural
implementation might be possible in haskell, seeing as it was more
naturally lazy. Not sure how to implement the behaviours though
(which were simply macros
On Sat, 25 Aug 2007, Andrew Coppin wrote:
How easy would it be to make / would anybody care / has somebody already made
... in Haskell?
- An interactive function plotter. (GNUplot is nice, but it can't plot
recursive functions...)
I'm be interested to use such a library.
- A graphical
On Sun, 26 Aug 2007, Andrew Coppin wrote:
The only thing I'm uncertain about is whether it would have good
enough time and space performance. All the real work is writing yet
another set of basic envelope, oscillator, and fft primitives. You
*should* be able to go all the way down to the
On Thu, 30 Aug 2007, Peter Verswyvelen wrote:
infixl 0 \ -- I just took the first weird symbol combination that came to
mind, this does not mean anything (I hope ;-)
x \ fx = fx x
f x = x * scale \ \x -
x + transform \ \x -
g x
like this you don't have to invent new names,
On Fri, 31 Aug 2007, Brandon S. Allbery KF8NH wrote:
On Aug 31, 2007, at 16:01 , Sterling Clover wrote:
In particular for a function -- n, m, etc or x, y, etc? What about
for f' defined in a let block of f? If I use x y at the top level I
need to use another set below -- is that where x'
In the current Haskell Wiki (haskell.org/haskellwiki) I found references
to articles of the old Hawiki (haskell.org/hawiki), like OnceAndOnlyOnce
and SeparationOfConcerns. Are the files still available somewhere?
___
Haskell-Cafe mailing list
On Mon, 3 Sep 2007, Peter Verswyvelen wrote:
Okay. Now the following might not make sense at all, but... isn't the
abstract concept of a list just a sequence of elements (okay, with a
whole lot of extra properties)? So couldn't we write: do { 1;2;3;4 }
instead of [1,2,3,4] somehow for some
On Mon, 3 Sep 2007, Derek Elkins wrote:
On Mon, 2007-09-03 at 14:57 +0200, Henning Thielemann wrote:
In the current Haskell Wiki (haskell.org/haskellwiki) I found references
to articles of the old Hawiki (haskell.org/hawiki), like OnceAndOnlyOnce
and SeparationOfConcerns. Are the files
On Mon, 3 Sep 2007, Andrew Wagner wrote:
I've been reading the classic Why functional programming matters
paper [1] lately, particularly looking at the alpha beta stuff. I've
ported all his code to haskell, but I have a question.
His algorithm takes a board position, creates a gametree out
On Tue, 4 Sep 2007, Donald Bruce Stewart wrote:
lemming:
... and there was unfortunately no support in porting the stuff. I guess
some simple program (perl -p -e 's/{{{/hask/g' :-) could have simplified
a lot. Its however more difficult for me to do this via the web interface,
than
On Mon, 3 Sep 2007, Derek Elkins wrote:
The issue is that we don't know what the license is for the -content-
of HaWiki. HaskellWiki explicitly states that all the content in it has
a specific license. We can't take the old content and put it on
HaskellWiki because that would imply that it
On Mon, 3 Sep 2007, Neil Mitchell wrote:
2) Licensing - the old content cannot be dumped onto the new wiki. My
personal view is who cares.
I like the German phrase
Wo kein Kläger, da kein Richter.
(no complaint, no redress ?
On Tue, 4 Sep 2007, David Benbennick wrote:
On 9/4/07, ok [EMAIL PROTECTED] wrote:
I've been thinking about making a data type an instance of MonadPlus.
From the Haddock documentation at haskell.org, I see that any such
instance should satisfy
mzero `mplus` x = x
x `mplus`
On Wed, 5 Sep 2007, ok wrote:
On 5 Sep 2007, at 6:16 pm, Henning Thielemann wrote:
I think it is very sensible to define the generalized function in terms of
the specific one, not vice versa.
The specific point at issue is that I would rather use ++ than
`mplus`. In every case where both
I want to have a data structure like Data.ByteString.Lazy, that is
block-wise lazy, but polymorphic. I could use a lazy list of unboxed
arrays (UArray) but the documentation says, that the element types are
restricted. But I will need (strict) pairs of Double and the like as
elements. It
On Wed, 5 Sep 2007, Bryan O'Sullivan wrote:
Henning Thielemann wrote:
I thought it must be possible to define an unboxed array type with
Storable elements.
Yes, this just hasn't been done. There would be a few potentially tricky
corners, of course; Storable instances are not required
On Wed, 5 Sep 2007, Thomas Hartman wrote:
I think you want something like this
{-# OPTIONS -fglasgow-exts #-}
Why glasgow-exts?
You may also want to read and extend the discussion generic number type
vs. distinct numeric types
http://www.haskell.org/haskellwiki/Generic_number_type
On Wed, 5 Sep 2007, Jonathan Cast wrote:
On Wed, 2007-09-05 at 20:37 +0200, Henning Thielemann wrote:
Can someone explain me, why there are arrays with mutable but boxed
elements? I thought that boxing is only needed for lazy evaluation.
However if I access an element of an array
On Thu, 6 Sep 2007, Axel Gerstenberger wrote:
module Main where
import System.IO
import Text.Printf
main :: IO ()
main = do
let all_results1 = take 2 $ step [1]
--print $ length all_results1 -- BTW: if not commented out,
-- all values of
1 - 100 of 2035 matches
Mail list logo
