class BinaryFunctor f where
bimap :: (a - c) - (b - d) - f a b - f c d
mapFst = (`bimap id`)
mapSnd = bimap id
On 31/05/2013 12:16 PM, Shachaf Ben-Kiki shac...@gmail.com wrote:
On Thu, May 30, 2013 at 7:12 PM, Shachaf Ben-Kiki shac...@gmail.com
wrote:
One generalization of them is to
hi frerich,
On May 31, 2013, at 2:17 AM, Frerich Raabe wrote:
Is anybody aware of open source projects which I could look at, or is there
maybe a conventional file extension for… what do you call them, Shakefiles?
other than .hs which I could google for?
we are using a shake-based build
===
VACANCY : 1x Phd Student in domain specific type error diagnosis for Haskell
===
The activities of the Software Systems division at Utrecht
Well that's exciting! I really hope uu finds a student. This would be yet
another one of Haskell's killer features.
- Clark
On Friday, May 31, 2013, wrote:
===
VACANCY : 1x Phd Student in domain specific type error
Hi all,
Following a discussion on Haskell Cafe some time ago (1), Roman C. wrote:
On the other hand, the type 'Succ 'Zero has kind 'Nat and doesn't have
any inhabitants — only types of kind * do.
Indeed, this is what seems to occur in the following example:
---
{-#
[I'll be the mentor for this GSoC project.]
I used the MVar approach a while ago and so did Simon Marlow's
original solution. Using MVars and Threads for this should scale well
enough (1000s of modules) and be relatively straightforward.
Error/exception handling could be a bit tricky, but you
I've been having a great deal of fun writing a program to solve this year's
Code Jam Fair and Squareproblem in Haskell (and learning about Haskell in
the process). Having gotten it to work, I've been optimizing it as best I
can. I'm not quite in Captain Ahab mode, but before I let it go I would
Dear Haskellers,
Apologies in case you have received multiple copies.
best,
Jur
===
VACANCY : 1x Phd Student in domain specific type error diagnosis for Haskell
Hi TP,
You bring up a few interesting points in your email.
(A note to those who have visited this playground before: to keep things
sane, let's just pretend that the kind # doesn't exist. Of course, if you
don't know about kind #, then you're a step ahead of the rest of us! While
you're at it,
The difference is roughly 2x, which suggests difference in Int/pointer
sizes: 32bit vs 64bit. Indeed, only since 7.6.1. GHC supports compiling 64
bit executables on Windows (
http://hackage.haskell.org/trac/ghc/wiki/WindowsGhc). That means that in
fact you compare 32 bit vs 64 bit programs.
I
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Greetings,
I'm attempting to build lifted-base (as a dependency for ghc-mod) but
cabal-install fails every time during the linking phase. I pasted the
full log of `cabal install lifted-base --verbose' to hpaste at [1].
I'm attempting to build it with
On Thu, May 30, 2013 at 10:56 PM, Tony Morris tmor...@tmorris.net wrote:
class BinaryFunctor f where
bimap :: (a - c) - (b - d) - f a b - f c d
mapFst = (`bimap id`)
mapSnd = bimap id
There's a bifunctors package with:
class Bifunctor f where
bimap :: ...
first :: a - b - f a c
I want to learn FRP but am having trouble wading through all the theory
about how FRP is implemented and how it /could/ be used for various
applications. What is the simplest, easiest-to-learn module or system
allowing you to quickly make something interesting (if not very
impressive) in an FRP
My favorite mini app is John Conway's game of life. I implemented a version
with reactive banana and found it perfect for learning the ideas.
I have a simple version of the code up on GitHub if you ever want a nice
example to read. I tried to make the code neat rather than worrying about
Unless I am missing something, The Haskell School of Expression has an
excellent
introduction to it.
Tommy
On May 31, 2013, at 20:41 , Christopher Howard
christopher.how...@frigidcode.com wrote:
I want to learn FRP but am having trouble wading through all the theory
about how FRP is
15 matches
Mail list logo
