On 6/27/12 2:57 PM, Alexander Foremny wrote:
Sweet! Thank you very much!
Just out of curiosity: how does this differ from the following, not
compiling type signature?
library :: forall t. NetworkDescription t (Behavior t String) - IO ()
The type:
(forall a. F a) - G
is isomorphic to:
And yes to first order predicate calculus too!
Just two weeks ago Chung-chieh Shan and I were explaining at NASSLLI
the embedding in Haskell of the higher-order predicate logic with two
base types (so-called Ty2). The embedding supports type-safe
simplification of formulas (which was really
You have full internet access on the Travis machines. The problem is that
you only have the data from your public repo. So you could upload the
package through the command line with cabal. But that means storing your
credentials in the public repository, which is a bad idea obviously.
In short:
Firstly, especially when you are talking about performance, please provided
detailed information on (a) the versions of the compiler and libraries that you
used and (b) of the command line options that you used for compilation.
Secondly, your function 'transposeP' doesn't make for a good nested
Thanks for both answers
I have used repa with the newer interface for the same example, but I
wanted to have another example using DPH. I know repa is more suited for
regular representations, but I wanted to express the same program in DPH
where I don´t have to worry of nested parallel
Hello,
I have been a forgetful person, and lots of things I have only
pretended to understand. I want to change this. So, to educate myself,
I'd like to write documented tests for many libraries I meet, and also
publish them onto the web so that others may find them useful or find
mistakes for
On 10/07/2012, Takayuki Muranushi muranu...@gmail.com wrote:
Hello,
I have been a forgetful person, and lots of things I have only
pretended to understand. I want to change this. So, to educate myself,
I'd like to write documented tests for many libraries I meet, and also
publish them onto
Hello.
My company is looking to hire a haskell developer. South California
(San Dimas), full time job, local only (no telecommute)
We use yesod (haskell web framework) for internal web application and
web services, and compojure (clojure web framework) for customer
facing web site.
All
All,
While working on my vector-simd library, I noticed somehow memory I'm
using gets corrupted/overwritten. I reworked this into a test case, and
would love to get some help on how to fix this.
Previously I used some custom FFI calls to C to allocate aligned memory,
which yields correct
Thank you for your quick response!
I have used QuickCheck, but SmallCheck I didn't. Thank you! Then I'll
try to build such tests into Gitit.
2012/7/11 Strake strake...@gmail.com:
On 10/07/2012, Takayuki Muranushi muranu...@gmail.com wrote:
Hello,
I have been a forgetful person, and lots of
I think you should ask this question on the glasgow-haskell-users
mailing list: http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
On 10 July 2012 18:20, Nicolas Trangez nico...@incubaid.com wrote:
All,
While working on my vector-simd library, I noticed somehow memory I'm
using
On 07/10/12 10:20, Takayuki Muranushi wrote:
Hello,
I have been a forgetful person, and lots of things I have only
pretended to understand. I want to change this. So, to educate myself,
I'd like to write documented tests for many libraries I meet, and also
publish them onto the web so that
-- unification-fd 0.8.0
The unification-fd package offers generic functions for single-sorted
first-order structural unification (think of programming in Prolog, or
of the metavariables in type
Hi experts,
Should I expect the following C code to run to completion, or am I trying
to do something that was never intended?
Thanks,
-db
C code:
1 #include stdio.h
2 #include stdlib.h
3 #include HsFFI.h
4
5 int main()
6 {
7 int argc = 1, i;
8 char* argv[] = {ghcDll,
On Tue, Jul 10, 2012 at 10:55 PM, Captain Freako capn.fre...@gmail.comwrote:
Hi experts,
Should I expect the following C code to run to completion, or am I trying
to do something that was never intended?
Quoth the Fine Manual (8.2.1.1. Using your own
Hi again.
This is the system information:
- Ubuntu 12.04 32-bit
- Intel® Core™2 Duo CPU T5270 @ 1.40GHz × 2
- 2.9 GiB RAM
GHC version:
- GHC 7.4.1
DPH libraries:
- dph-base-0.6.1.1
- (dph-lifted-base-0.6.1.1)
- (dph-lifted-vseg-0.6.1.2)
- (dph-prim-interface-0.6.1.1)
- (dph-prim-par-0.6.1.1)
-
There is some article mentioning that functional programming is mainly good
for mathematical programming and list programming because otherwise it is
to cryptic for business and database applications.
Being semi-intelligent, I thought I could reduce what others think of as
cryptic but maybe
I cleaned out everything, no luck
On Fri, Jul 6, 2012 at 2:14 AM, Albert Y. C. Lai tre...@vex.net wrote:
On 12-07-03 04:19 AM, Magicloud Magiclouds wrote:
$ cabal --upgrade-dependencies --enable-documentation
--force-reinstalls --solver=topdown QuickCheck-2.5
Test/QuickCheck/All.hs:15:1:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
On 11/07/12 05:51, Magicloud Magiclouds wrote:
I cleaned out everything, no luck
On Fri, Jul 6, 2012 at 2:14 AM, Albert Y. C. Lai tre...@vex.net
wrote:
On 12-07-03 04:19 AM, Magicloud Magiclouds wrote:
19 matches
Mail list logo
