Hi all!
I created simple application, which uses sqlite3 as it's datastore back-end. I
faced no problems when building and running it on Linux, but after I tried to
build it on Windows, I see weird linking error:
Linking dist\build\hnotes\hnotes.exe ...
C:\Documents and
[Sorry, I forgot to reply to the list.]
Hi.
I understand these to be Rank 0 terms:
(\(x::Int) . x) (0 :: Int) :: (forall. Int) -- value
(\(x::Int). x) :: (forall. Int - Int)
Yes.
(\(x::a). x) :: (forall. a - a)
Although the program prints forall, the absence of a type variable
* Joey Adams joeyadams3.14...@gmail.com [2012-07-09 01:38:06-0400]
This package provides imperative-style loops supporting continue and
break. For example:
import Control.Monad
import Control.Monad.IO.Class
import Control.Monad.Trans.Loop
import Control.Monad.Trans.Class
On Sun, Jul 08, 2012 at 09:21:08AM -0600, Jonathan Geddes wrote:
I agree that the Raison d'être for a .NET or JVM backend is interop.
Perhaps that's not worth the effort of an entirely new backend. JavaScript
is a different beast, however. I said before:
From my point of view, languages
On Sat, Jul 07, 2012 at 09:42:01PM -0300, Sebastián Krynski wrote:
Ok , thanks for the answers, I understand now what liftM2 does.
In this case would it be silly to use combinerPred (and maybe a newType
Predicate a = a - Bool) for the sake of readability or shoud I stick with
a - Bool
Reminder. The deadline is end-of-day this Tuesday.
On Tue, Jul 3, 2012 at 7:17 AM, Johan Tibell johan.tib...@gmail.com wrote:
Call for Talks
ACM SIGPLAN Haskell Implementors' Workshop
Thanks for all the Info, Brent! I wasn't aware of many of those projects.
I agree that contributing to an existing project is a better idea than
doing something new. I suppose I was hoping there would be an official GHC
JavaScript backend so that it would be clear which of the efforts to
On 9 July 2012 15:38, Brent Yorgey byor...@seas.upenn.edu wrote:
I should point out that the ball already IS rolling -- ranging from
EDSLs that compile to JavaScript [1,2] to macro systems [3] to more
serious full-featured efforts [4,5].
Also, a JavaScript backend has recently been developed
You can still use the monadic combinators, with the price of wrapping and
unwrapping in case of newtype.
newtype P a = P {unP :: a - Bool}
liftM2'P :: (Bool - Bool - Bool) - P a - P a - P a
liftM2'P op = (P .) . on (liftM2 op) unP
paolino
2012/7/8 Sebastián Krynski skryn...@gmail.com
Ok ,
On 2012-Jul-07, Henning Thielemann wrote:
On Thu, 5 Jul 2012, gdwe...@iue.edu wrote:
Sifflet and sifflet-lib 2.0.0.0, now available on Hackage!
This version introduces a type checker and partial support
for higher order functions in Sifflet, the visual, functional
programming language
On Mon, Jul 9, 2012 at 8:28 AM, Roman Cheplyaka r...@ro-che.info wrote:
Very nice!
Here's a patch to generalize foreach to any Foldable:
https://github.com/joeyadams/haskell-control-monad-loop/pull/1
Thanks for the patch! I merged it, but I plan to wait a little while
before uploading
On Mon, 9 Jul 2012, gdwe...@iue.edu wrote:
data Type = TypeVar TypeVarName -- named type variable
| TypeCons TypeConsName [Type] -- constructed type
deriving (Eq)
Do you still think my type checker would be useful to you,
or to Haskellers generally?
I see. Then
On Mon, Jul 9, 2012 at 3:56 AM, Eugene Dzhurinsky jdeve...@gmail.com wrote:
Hi all!
I created simple application, which uses sqlite3 as it's datastore back-end. I
faced no problems when building and running it on Linux, but after I tried to
build it on Windows, I see weird linking error:
You
13 matches
Mail list logo
