I'd like to announce the 0.2.* series release of the X Haskell
Bindings. This release, like the prior 0.1.* series focuses on making
the API prettier. This does mean that there's a good chance this is a
breaking release. Also, 0.2.* is based on the just-released version
1.4 of the XML
On Mon, Feb 16, 2009 at 12:48 PM, Creighton Hogg wch...@gmail.com wrote:
Hello Haskellers,
I'm pleased to announce version 4.2.0 of Crypto has been uploaded to
Hackage that I am taking over maintenance of the library from
Dominic Steinitz. As of this release it should be cabal install'able
On Mon, Feb 16, 2009 at 12:48 PM, Creighton Hogg wch...@gmail.com wrote:
Hello Haskellers,
I'm pleased to announce version 4.2.0 of Crypto has been uploaded to
Hackage that I am taking over maintenance of the library from
Dominic Steinitz. As of this release it should be cabal install'able
On Wed, Feb 11, 2009 at 10:20 PM, wren ng thornton w...@freegeek.org wrote:
For projects which are released very frequently (i.e. on the order of daily)
or very infrequently (e.g. semiannually, annually) then date-based releases
can make sense. However, the releases do need to be quite regular
I'd like to announce a version bump for the X Haskell Bindings (XHB)
library, to 0.1.* from 0.0.*.
The goal of XHB is to provide a Haskell implementation of the X11 wire
protocol, similar in spirit to the X protocol C-language Binding
(XCB).
On Hackage:
On Sun, Feb 8, 2009 at 2:46 PM, Antoine Latter aslat...@gmail.com wrote:
I'd like to announce a version bump for the X Haskell Bindings (XHB)
library, to 0.1.* from 0.0.*.
The goal of XHB is to provide a Haskell implementation of the X11 wire
protocol, similar in spirit to the X protocol C
I'd like to announce a version bump for the X Haskell Bindings (XHB)
library, to 0.1.* from 0.0.*.
The goal of XHB is to provide a Haskell implementation of the X11 wire
protocol, similar in spirit to the X protocol C-language Binding
(XCB).
On Hackage:
On Sun, Feb 8, 2009 at 2:46 PM, Antoine Latter aslat...@gmail.com wrote:
I'd like to announce a version bump for the X Haskell Bindings (XHB)
library, to 0.1.* from 0.0.*.
The goal of XHB is to provide a Haskell implementation of the X11 wire
protocol, similar in spirit to the X protocol C
On Thu, Feb 5, 2009 at 3:11 PM, Andrew Wagner wagner.and...@gmail.com wrote:
So we all know the age-old rule of thumb, that unsafeXXX is simply evil and
anybody that uses it should be shot (except when it's ok).
I understand that unsafeXXX allows impurity, which defiles our ability to
reason
Funny story,
If I do the following three things, I get errors on my Intel Mac OS 10.5:
* Build an executable with Cabal
* Have the executable have a build-dep of pcre-light in the .cabal
* use haskeline in the executable itself
I get crazy linker errors relating to haskeline and libiconv:
On Sun, Feb 1, 2009 at 12:01 PM, Thomas Davie tom.da...@gmail.com wrote:
This is caused by OS X's libiconv being entirely CPP macros, the FFI has
nothing to get hold of. IIRC there's a ghc bug report open for it.
Bob
So why does it sometimes work? I can write and compile executables
using
On Sun, Feb 1, 2009 at 12:04 PM, Antoine Latter aslat...@gmail.com wrote:
On Sun, Feb 1, 2009 at 12:01 PM, Thomas Davie tom.da...@gmail.com wrote:
This is caused by OS X's libiconv being entirely CPP macros, the FFI has
nothing to get hold of. IIRC there's a ghc bug report open for it.
Bob
On Sun, Feb 1, 2009 at 11:57 AM, Antoine Latter aslat...@gmail.com wrote:
Funny story,
If I do the following three things, I get errors on my Intel Mac OS 10.5:
* Build an executable with Cabal
* Have the executable have a build-dep of pcre-light in the .cabal
* use haskeline
2009/1/31 Lyle Kopnicky li...@qseep.net:
Hi folks,
I'm getting ready to release a piece of software. Unfortunately due to a bug
in GHC 6.10 on Windows it does not handle Ctrl+C properly. Since the bug has
been fixed (thank you Simon Marlow), I figured I'd download a 6.11 build (I
grabbed the
2009/1/19 Luke Palmer lrpal...@gmail.com:
As a side curiosity, I would love to see an example of any data structure
which has more than one Functor instance. Especially those which have more
than one useful functor instance.
(,) ?
-Antoine
___
Folks,
I'd like to announce a preview-release of the X Haskell Bindings. The
goal of the library is to provide low-level access to the X11
protocol, in the spirit of the X C Bindings This is a preview
because I expect that the interface will still need to change - but I
do plan on bump the
Folks,
I'd like to announce a preview-release of the X Haskell Bindings. The
goal of the library is to provide low-level access to the X11
protocol, in the spirit of the X C Bindings This is a preview
because I expect that the interface will still need to change - but I
do plan on bump the
Forwarding response to cafe
-- Forwarded message --
From: Antoine Latter aslat...@gmail.com
Date: Sun, Jan 4, 2009 at 2:13 PM
Subject: Re: [Haskell-cafe] Auto-deriving Control.Exception.Exception
To: eyal.lo...@gmail.com eyal.lo...@gmail.com
On Sun, Jan 4, 2009 at 11:50 AM
2009/1/1 Galchin, Vasili vigalc...@gmail.com:
Say I have several data structures that are marshalled(using Binary
class) and written out linearly on persistence store. I want to calculate
the offsets in bytes of these various data structures in a functional
language way. What is the
On Jan 1, 2009 11:50pm, Galchin, Vasili vigalc...@gmail.com wrote:
it is a bioinformatics standard .. . I am writing on this newsgroup in order
to try to be objective to get a correct and elegant answer .. in any case I
am helping on the bioinformatics code (you can see on Hackage). I am
2008/12/28 Luke Palmer lrpal...@gmail.com:
The hard way is a heteroeneous container, with an interface like:
cons :: a - Container - IO (Key a)
unlink :: Key a - Container - IO ()
toList :: ???
If you want to change that to:
cons :: Typeable a = a - Container - IO (Key a)
unlink ::
On Tue, Dec 23, 2008 at 12:53 AM, Luke Palmer lrpal...@gmail.com wrote:
On Mon, Dec 22, 2008 at 6:52 PM, Antoine Latter aslat...@gmail.com wrote:
Although I still had to use my own because I wanted a MonadPlus
instance. I would offer a patch, but since there's more than one
useful MonadPlus
On Tue, Dec 23, 2008 at 1:08 PM, Benja Fallenstein
benja.fallenst...@gmail.com wrote:
On Tue, Dec 23, 2008 at 8:05 PM, Benja Fallenstein
benja.fallenst...@gmail.com wrote:
Umh, there is a MonadPlus instance in the package?
Ah: ...in the version Cale uploaded two days ago, not in the previous
2008/12/22 Luke Palmer lrpal...@gmail.com:
Yeah, it'd be useful. Doesn't really matter, though, because it's on
Hackage (http://hackage.haskell.org), so it's just a cabal install
MaybeT away.
Now that cabal and cabal-install are reasonably mature, we really don't have
to worry about what's
On Mon, Nov 3, 2008 at 9:34 AM, Jason Dagit [EMAIL PROTECTED] wrote:
Ah, but I had one more question that I don't think anyone has answered
yet. That is, how to deal with multiple types of exceptions.
Suppose, as a concrete example, that I was looking out for both
ExitCode and
On Mon, Nov 3, 2008 at 4:58 PM, minh thu [EMAIL PROTECTED] wrote:
Hi,
Given a TypeRep and a Dynamic value with type corresponding to the
TypeRep, I'd like to be able to use fromDyn *without* specifying a type
(given as an additional 'default' argument) (since it is somewhat known
from the
2008/10/20 z ghost [EMAIL PROTECTED]:
hello, im interested in using haskell to generate code and make
little AI applications for fun..
is anyone already doing this sort of thing? it would be fun to collaborate
with people on this.
I've been doing some work with Haskell code-generation in
On Wed, Oct 15, 2008 at 5:55 PM, wren ng thornton [EMAIL PROTECTED] wrote:
Doing it that way removes the polymorphism that MonadState, MonadReader, etc
offer to clients. For example, the backwards-state monad[1] is a MonadState
but not a StateT (without extra plumbing). There are other
On Tue, Oct 14, 2008 at 12:03 AM, Magicloud
[EMAIL PROTECTED] wrote:
Hi,
I wanted to install this package. Well,
Building hprotoc-0.3.1...
...
[3 of 7] Compiling Text.ProtocolBuffers.ProtoCompile.Parser ...
Text/ProtocolBuffers/ProtoCompile/Parser.hs:48:0:
Type synonym `GenParser'
Folks,
I'm not sure who to email about this, but hopefully someone on the cafe knows:
On the machine which builds the Hackage packages the 'binary' package
is built against 'bytestring-0.9.1.2', however the package I just
uploaded gets built against 'bytestring-0.9.1.3' which leades to
typecheck
On Wed, Oct 8, 2008 at 9:58 AM, Philip K.F. Hölzenspies
[EMAIL PROTECTED] wrote:
some_catch_function (error foo) (error bar)
should result in an error bar
It's a good thing we've already got a function for that!
Prelude.catch (error foo) (error bar)
*** Exception: foo
On Sat, Sep 27, 2008 at 12:23 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Can anybody actually demonstrate concretely how FDs and/or ATs would solve
this problem? (I.e., enable you to write a class that any container can be a
member of, despite constraints on the element types.)
Sure! Using
2008/9/19 Magnus Therning [EMAIL PROTECTED]:
First I thought I'd treat the configuration in a similar way, but then I
noticed a slight ordering problem. The command line arguments should
take priority over the contents of the configuration file, but the
location of the configuration can be
On Fri, Sep 19, 2008 at 7:35 PM, Antoine Latter [EMAIL PROTECTED] wrote:
I'm not sure how well it would hold up under maintenance, but you coud
have a config sum-type which is itself a monoid, and then create two
of them:
And by sum-type I mean product type. Sheesh.
Although having your
On Tue, Sep 16, 2008 at 9:30 AM, Mauricio [EMAIL PROTECTED] wrote:
Hi,
I would like to write a Haskell pretty-printer,
using standard libraries for that. How can I
check if the original and the pretty-printed
versions are the same? For instance, is there
a file generated by GHC at the
Haskellers,
I'm slowly porting XCB (the X C Bindings) to Haskell, and I would like
input from any interested parties.
The following is a summary of my plan so far. I'm interested in
hearing any suggestions or concerns about what a Haskell library for
writing X clients should look like. This is
On Wed, Aug 13, 2008 at 5:02 PM, Tim Newsham [EMAIL PROTECTED] wrote:
However, I think probably the real blame here should probably go
to Data.Binary which doesn't attempt to check that it has consumed
all of its input after doing a decode. If decode completes
and there is unconsumed data,
On Sat, Jul 26, 2008 at 9:50 PM, Felipe Lessa [EMAIL PROTECTED] wrote:
6.8.1).
You may get Cabal packages for both on Hackage at:
- http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Hipmunk
- http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HipmunkPlayground
Felipe,
I'm
On Mon, Jul 21, 2008 at 1:54 PM, Gracjan Polak [EMAIL PROTECTED] wrote:
Hi all,
On the other day I noticed that we could optimize 'sequence' more.
I needed it for my monadic parser. Below is my small experiment.
Sequence from standard library needs 2.3s to finish (and additional
stack
On Fri, Jul 11, 2008 at 7:07 AM, Ron Alford [EMAIL PROTECTED] wrote:
What's odd is that it works directly (typeOf ... (Expr (f :+: g))
returns a type), but if you enclose the expression in a list, it fails
with Prelude.undefined. Do I also need a custom instance for
Typeable [Expr ...] ? (See
On Thu, Jul 10, 2008 at 2:15 PM, Ron Alford [EMAIL PROTECTED] wrote:
I'm making progress, but how would I make the following a Typeable instance:
data (f :+: g) e = Inl (f e) | Inr (g e) deriving Eq
Here is what I'm using for Expr:
data Expr f = In (f (Expr f))
instance Typeable1 f =
2008/7/10 Ron Alford [EMAIL PROTECTED]:
Ok, I'm closer, but I'm running into a problem with typeOf and lists,
of all things:
*WouterTest typeOf (eVar v :: TermExpr)
Planning.Wouter.Expr (Planning.Wouter.:+: WouterTest.Const WouterTest.Var)
*WouterTest typeOf ([eVar v] :: [TermExpr])
***
On Wed, Jul 9, 2008 at 9:40 PM, Ron Alford [EMAIL PROTECTED] wrote:
Ok, but to make it part of a record, it needs to implement Data:
data Expr f = In (f (Expr f)) deriving Data
but this gives
No instances for (Data (f (Expr f)), Typeable (Expr f))
arising from the 'deriving' clause
2008/6/28 Galchin, Vasili [EMAIL PROTECTED]:
Hi,
Suppose I have a value of type Ptr Word8 and also an Int which is the
length of the Ptr Word8(sorry if I am thinking too much in a C string frame
of mind). How can I display the Ptr Word8 value of the given length?
Vasili
You're best
2008/6/28 Galchin, Vasili [EMAIL PROTECTED]:
Hi,
Suppose I have a value of type Ptr Word8 and also an Int which is the
length of the Ptr Word8(sorry if I am thinking too much in a C string frame
of mind). How can I display the Ptr Word8 value of the given length?
You mentioned C style
On Thu, Jun 5, 2008 at 4:46 PM, Richard Giraud [EMAIL PROTECTED] wrote:
Does the current {-# SOURCE #-}/.hs-boot scheme allow for compilation of
arbitrary MRMs? Or are there known cases where it doesn't work? If there
are cases where it doesn't work, are there other options?
I don't think
On Sat, May 31, 2008 at 12:12 PM, Achim Schneider [EMAIL PROTECTED] wrote:
Dimitry Golubovsky [EMAIL PROTECTED] wrote:
If a parser which updated user state fails, will such update be
reverted?
I have no idea, I gave up before investigating that far.
You want to avoid state at any cost,
2008/5/29 Olivier Boudry [EMAIL PROTECTED]:
After some read, guess, try, error cycles I came up with this:
type Matrix = forall m. forall a. forall i. forall n. (Ix i, MArray a n
m, Num i, Num n) = m (a (i,i) n)
I've tried similar things before. You may run into subtle problems later.
On Mon, May 19, 2008 at 9:44 PM, Antoine Latter [EMAIL PROTECTED] wrote:
Sounds like fun. Neither the error messages nor the code will be pretty.
Are we just interested in the Data.Int types and the Data.Word types?
It's up on hackage here:
http://hackage.haskell.org/cgi-bin/hackage-scripts
On Tue, May 20, 2008 at 8:44 AM, Antoine Latter [EMAIL PROTECTED] wrote:
It's up on hackage here:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/checked
One more thing - there's no Data instance for these types.
Presumably it wouldn't be hard to add, I just wasn't familiar
On Mon, May 19, 2008 at 1:22 PM, Don Stewart [EMAIL PROTECTED] wrote:
Safe Num wrappers for primitive types that throw exceptions on overflow
would make a useful library.
Any takers?
Sounds like fun. Neither the error messages nor the code will be pretty.
Are we just interested in the
On Tue, May 13, 2008 at 9:23 PM, Neal Alexander [EMAIL PROTECTED] wrote:
I stripped the code down to just the parsec related stuff and retested it.
http://72.167.145.184:8000/parsec_test/Parsec2.prof
http://72.167.145.184:8000/parsec_test/Parsec3.prof
And the parser with a 9mb (800 kb
On Sun, May 18, 2008 at 11:23 AM, Antoine Latter [EMAIL PROTECTED] wrote:
Neal, those two profiling results aren't really comparable, because
your Parsec2 profiling doesn't include any cost-centers from the
Parsec library - so all of the costs associated with Parsec2 will be
assigned to cost
On Tue, May 13, 2008 at 9:23 PM, Neal Alexander [EMAIL PROTECTED] wrote:
I stripped the code down to just the parsec related stuff and retested it.
http://72.167.145.184:8000/parsec_test/Parsec2.prof
http://72.167.145.184:8000/parsec_test/Parsec3.prof
And the parser with a 9mb (800 kb
2008/4/16 Galchin, Vasili [EMAIL PROTECTED]:
Hello,
I tried d to use Hoogle to find openFd's signature and more
importantly FileMode. I found FileMode which is a type synonym with CMode.
I don't understand what are the values for FileMode (so I can call
openFd). ??
Values of type
On Thu, Apr 10, 2008 at 9:50 AM, Adam Smyczek [EMAIL PROTECTED] wrote:
For a small webapi binding I try to implement a session like monad
by building a stack including BrowserAction from Network.Browser
module as following:
newtype RBAction a = RBAction
{ exec :: ErrorT String (StateT
On Thu, Apr 10, 2008 at 12:44 PM, Antoine Latter [EMAIL PROTECTED] wrote:
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
import Control.Monad.Trans
import Control.Monad.State
import Control.Monad.Error
type BrowserAction = IO -- or something else which is in MondaIO
data RBState
I've been looking into to this a bit myself, and have had trouble with
the fact that the XML descriptions of the protocol are extremely
C-centric. As in, the union types defined in the XML are C-unions,
and I've seen a struct definition which uses padding-bytes to store
semantically useful data.
Haskell bindings to libuuid. The library libuuid is available as a
part of e2fsprogs: http://e2fsprogs.sourceforge.net/.
This library is useful for creating, comparing, parsing and printing
Universally Unique Identifiers. See http://en.wikipedia.org/wiki/UUID
for more details on UUIDs.
-Antoine
For those of you following along, you'll need:
import qualified Sound.OpenAL as AL
import Data.Maybe
import Foreign.C.Types
import Control.Monad
import Control.Concurrent
import Foreign.Storable
import Foreign.Marshal.Alloc
when I run playOpenAL 440 I get no sound, and the following is
On Sat, Mar 8, 2008 at 9:23 PM, Brandon S. Allbery KF8NH
I think you might be able to do this as a typeclass instead, at the
expense of having to insert an instance declaration for each type.
(You will have to use an extension if you want to declare instances
for types such as Int. I
I was trying to solve a similar problem while learning the FastCGI
package. The regular CGI package allows the use of ReaderT to hold
config data. Because FastCGI does the running of the passed in CGI
action within a few calls to alloca :: (Ptr a - IO b) - IO b, I
couldn't figure out a way to
On Feb 20, 2008 12:48 PM, Chad Scherrer [EMAIL PROTECTED] wrote:
StorableVector should fill this gap.
http://code.haskell.org/~sjanssen/storablevector/
Yes, it could, but
(1) it's way behind ByteString in terms of optimizations (== fusion)
(2) there's (as far as I know) not a
On Feb 20, 2008 12:59 PM, Chad Scherrer [EMAIL PROTECTED] wrote:
On Feb 20, 2008 10:57 AM, Antoine Latter [EMAIL PROTECTED] wrote:
For anyone looking into it - the StorableVector fusion would have to
be quite different from the current ByteString fusion framework.
Maybe it would be enough
Can I specify an equality constraint in the build-depends field of a
.cabal file? This would say that I want one specific version (because
all the rest of my packages are compiled against that version and I'm
getting type-checking errors trying to install the new package).
neither
(sent to the list this time)
The problem is in the type-signature for from_seq:
from_seq :: (Sequence seq) = (seq e) - (t e)
Neither the From_seq class or the type signature of the from_seq
function place any restrictions on the type of e, so the type can be
rewritten as:
from_seq :: forall e
The package `binary' should be on hackage.haskell.org.
The others can be found in gtk2hs, I think: http://www.haskell.org/gtk2hs/
Antoine
On Feb 13, 2008 11:52 AM, Justin Bailey [EMAIL PROTECTED] wrote:
That looks really cool and I'd like to try it out. Can you provide
links to these
On Feb 4, 2008 9:11 PM, Philippa Cowderoy [EMAIL PROTECTED] wrote:
It's a necessary part of how Parsec works - both the Consumed and the
Reply depend on the input stream, which is now generated from within the
base monad. The Consumed result is evaluated in advance of the Reply, so
keeping the
Another picky nit:
The monad transformer type is defined as such:
data ParsecT s u m a
= ParsecT { runParsecT :: State s u - m (Consumed (m (Reply s u a))) }
with the Consumed and reply types as:
data Consumed a = Consumed a
| Empty !a
data Reply s u a = Ok !a
I'm not a fan of parameterizing the Stream class over the monad parameter `m':
class Stream s m t | s - t where
uncons :: s - m (Maybe (t,s))
which leads to instance declarations like so:
instance Monad m = Stream [tok] m tok where
uncons [] = return $ Nothing
uncons (t:ts)
On Feb 2, 2008 5:28 PM, Antoine Latter [EMAIL PROTECTED] wrote:
I'm not a fan of parameterizing the Stream class over the monad parameter
`m':
class Stream s m t | s - t where
uncons :: s - m (Maybe (t,s))
which leads to instance declarations like so:
instance Monad m = Stream [tok
Can Fix be made to work with higher-kinded types? If so, would the
following work:
Perfect = /\ A . Fix (L :: * - *) . (A + L (A,A))
Keep in mind I have no idea what the Perfect data structure is
supposed to look like.
-Antoine
On Jan 24, 2008 9:52 AM, Edsko de Vries [EMAIL PROTECTED] wrote:
should be okay. Am I missing something, again?
-Antoine
On Jan 24, 2008 10:31 AM, Edsko de Vries [EMAIL PROTECTED] wrote:
On Thu, Jan 24, 2008 at 10:06:04AM -0600, Antoine Latter wrote:
Can Fix be made to work with higher-kinded types? If so, would the
following work:
Perfect = /\ A . Fix (L
On Dec 25, 2007 12:11 AM, Konstantin Vladimirov
[EMAIL PROTECTED] wrote:
class FirstClass a where
firstFunction :: (SecondClass b) = a - b
snip!
instance FirstClass FirstData where
firstFunction (FirstData d) = SecondData d
The problem is that the type of firstFunction as producing
(sending to the whole list this time ...)
On 9/29/07, PR Stanley [EMAIL PROTECTED] wrote:
Okay, a couple of things
what is fromEnum?
fromEnum :: (Enum a) = a - Int
fromEnum 'c' :: Int
'fromEnum' converts any member of the Enum typeclass to an 'Int'.
It works fine for a Char.
What's the
You may want to look at the library function `toEnum'
toEnum :: (Enum a) = Int - a
since Char is an Enum, the following code should work just fine:
toEnum 70 :: Char
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I don't see anything in hackage off the top of my head. If it's a set
of DEs like that, Runge-Kutta is a good place to start if you want to
code your own integrator:
http://en.wikipedia.org/wiki/Runge-Kutta#The_classical_fourth-order_Runge.E2.80.93Kutta_method
But if it were me I would just use
On 8/3/07, Chris Smith [EMAIL PROTECTED] wrote:
Yes, unless of course you did:
instance (Monad m, Num n) = Num (m n)
or some such nonsense. :)
I decided to take this as a dare - at first I thought it would be easy
to declare (Monad m, Num n) = m n to be an instance of Num (just lift
or
Hello,
I'd just like to call attention to a few recent blog posts containing
myself and my friend Creighton's entry into the ICFP '07 programming
competition. Mainly because I'm looking to find someone who knows
Haskell and the contest so they can tell me where my bug is :)
Also, if anyone
On 7/19/07, Dan Weston [EMAIL PROTECTED] wrote:
I would define:
allEqual [] = True
allEqual [_]= True
allEqual (x1:x2:xs) = (x1 == x2) allEqual xs
What does this function do for allEqual [1, 1, 2] ?
Antoine
___
Haskell-Cafe
The closest existing page I could find on the wiki was this one:
http://www.haskell.org/haskellwiki/GHC/Using_the_FFI
But it is a Wiki. If you were to just make a page and put it
somewhere, I doubt anyone would get too mad.
On 7/18/07, Bulat Ziganshin [EMAIL PROTECTED] wrote:
Hello Andreas,
MediaWiki's search isn't fantastic - what I did was a google search on
site:www.haskell.org DLL
It's not a very good answer, but it's the only answer I know.
On 7/18/07, Andreas Marth [EMAIL PROTECTED] wrote:
- Original Message -
From: Antoine Latter [EMAIL PROTECTED]
To: haskell-cafe
I've been meaning to tackle F# as my ML of choice (seeing as I'll need
to get comfortable with .Net, I may as well hit two birds with one
stone).
I've been waiting for the text /Expert F#/ to come out, as it looks
/Foundations of F#/ is pitched towards someone learning their first
functional
On 7/11/07, Brent Yorgey [EMAIL PROTECTED] wrote:
take 5 (unique [1..])
I don't think this is possible. Perhaps you misread the original problem
description? The unique function is supposed to return a list of those
elements which occur exactly once in the input list, which is impossible to
I'm a relatively new to Haskell, so I figured I needed to write a Sudoku solver.
The key features of this solver are:
* It's longer than other Haskell Sudoku solvers I've seen around
* It fails to solve many solvable puzzles
Fantastic!
link:
This looks like a good place to ask a question that's been bugging me for a
bit:
I've had cases in my own code where I can't seem to create a type annotation
for an inner declaration that the type-checker likes. Here's a toy
example:
In the following code:
applyfunc :: (a - b - c) - a - b -
501 - 586 of 586 matches
Mail list logo
