Yes, exactly.
On 10 April 2014 22:03, Herbert Valerio Riedel h...@gnu.org wrote:
On 2014-04-10 at 06:00:43 +0200, Vivian McPhail wrote:
Indeed.
It was using the wrong cabal-install version. Even though I had
installed
the newest cabal-install I needed to restart the xterm I
Hi,
Ubuntu 12.04, 64 bit x86, ghc 7.8.1 gives the following:
# cabal install --global vector
...
[ 5 of 19] Compiling Data.Vector.Fusion.Stream.Monadic (
Data/Vector/Fusion/Stream/Monadic.hs,
dist/build/Data/Vector/Fusion/Stream/Monadic.o )
Loading package ghc-prim ... linking ... done.
Loading
with 1.16 :)
1) cabal update
2) cabal install cabal-install
3) rm ~/.cabal/config # old pre 1.18 config should go!
4) cabal update # also probably add ~/.cabal/bin to path
5) cabal install vector
On Wed, Apr 9, 2014 at 11:24 PM, Vivian McPhail
haskell.vivian.mcph...@gmail.com wrote:
Hi
Date: Sun, 25 Mar 2012 17:54:11 +0400
From: Aleksey Khudyakov alexey.sklad...@gmail.com
Subject: Re: [Haskell-cafe] Mathematics and Statistics libraries
To: haskell-cafe@haskell.org
Message-ID: 4f6f2383.6070...@gmail.com
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
On
-- Forwarded message --
From: Vivian McPhail haskell.vivian.mcph...@gmail.com
Date: 22 June 2011 17:17
Subject: #4459: Loading Names and Types via GHC
To: cvs-...@haskell.org
Hi,
I can successfully set up GHC and compile a module, say 'X.hs'.
quote
dynload :: Symbol
It seems then that a package should be the least restrictive
combination of all the licenses in all the contained modules.
Omit the words least restrictive and I think you are correct.
To combine licences, just aggregate them. There is no lattice of
subsumption; no more or less
On Mon, 2011-02-07 at 14:42 +, Malcolm Wallace wrote:
It seems then that a package should be the least restrictive
combination of all the licenses in all the contained modules.
Omit the words least restrictive and I think you are correct.
OK.
To combine licences, just
Dear All,
There was recently a discussion on haskell-cafe (
http://www.mail-archive.com/haskell-cafe@haskell.org/msg86472.html) about
licenses of libraries such as hmatrix and the combination of various
different licences.
One question was about per-package versus by-file licenses:
In Haskell
Hi,
On Wed, 2011-01-26 at 08:18 +1000, Ivan Lazar Miljenovic wrote:
Or else because the developers _wanted_ to license it under the GPL.
Some people do, you know.
Sure, but I agree it would be nice to know whether the authors chose the
GPL, or applied it because of linking with GPLed
On 7 November 2010 15:19, Vivian McPhail
haskell.vivian.mcph...@gmail.comwrote:
Message: 29
Date: Sat, 6 Nov 2010 13:22:10 +0100
From: Roel van Dijk vandijk.r...@gmail.com
Subject: [Haskell-cafe] hmatrix's fitModel function crashes ghc(i)
To: Haskell Caf? haskell-cafe@haskell.org
Message
Message: 29
Date: Sat, 6 Nov 2010 13:22:10 +0100
From: Roel van Dijk vandijk.r...@gmail.com
Subject: [Haskell-cafe] hmatrix's fitModel function crashes ghc(i)
To: Haskell Caf? haskell-cafe@haskell.org
Message-ID:
aanlktim5egsl_bz+ruv-=d-z3db65sc8o=ckqltcy...@mail.gmail.com
Hi,
In attempting to use the lexer to see whether we are within an alternative
layout context:
ALR: True means that we are Alternative Layout Mode which happens when we
run the lexer. The False instances are from when the parser runs (after we
have done our checking).
Prelude
Hi
Message-ID: aanlktinrozniqf4+ykxofho0fb=3b_7tfdux=vvbg...@mail.gmail.com
Hi -
What are the libraries to use in Haskell to generate a stock
candlestick chart like
http://stockcharts.com/h-sc/ui?s=SPYp=Db=5g=5id=p05007254056http://stockcharts.com/h-sc/ui?s=SPYp=Db=5g=5id=p05007254056
I will
Trying to build rc1 from source
linux x86_64
BuildFlavour = perf
It seems that the -fPIC flag is set, but an error still occurs (
/usr/bin/ld: libraries/integer-gmp/gmp/objs/abs.o: relocation R_X86_64_32
against `.text' can not be used when making a shared object; recompile with
-fPIC
)
Hello,
DPH seems to build parallel vectors at the level of scalar elements
(doubles, say). Is this a design decision aimed at targettiing GPUs? If I
am filtering an hour's worth of multichannel data (an array of (Vector
Double)) then off the top of my head I would think that the optimal
Hi,
I am attempting to mimic matlab/octave using ghci, including a facility for
updateable graphs of data.
1) It would be nice to be able to load a script of commands from the prompt
\begin{file}
script Sine where
import hmatrix Numeric.Vector
import plot Graphics.Rendering.Plot
let ts =
Hello,
As the authors point out [1], coal-face time needs to be expended before
real world adoption of Dependently-Typed functional programming. But let's
get the ball rolling. They say that haskell programmers are normally averse
to dependent types. Is this true? It seems to me that one of
Dear Committee
If I recall correctly, in the tex-style literate haskell specification, code
is delimited by a
\begin{code}
\end{code}
This does not allow for multilanguage support in a single source file. It
would be nice to have a single document in which we could mix English,
Haskell, and,
Hi All,
This is in regard to previous posts about mathematical preludes.
class Set a
class (Set s) = SemiGroup s o where
semigroup_op :: o - (s,s) - s
-- closure
-- associative
class (SemiGroup s o) = Monoid s o where
identity :: o - s
class (Monoid s o) = Group s o where
Hi All,Inspired by Oleg's Eliminating Array Bound Checking through
Non-dependent types http://okmij.org/ftp/Haskell/types.html#branding,I am
attempting to write code that will receive an array from C land and convert
it to a type safe representation. The array could have n dimensions where n
Hi All,
I wrote a binding to matlab matrix.h and mat.h. My test program works when
I compile a binary, but when I try to use the code in ghci nothing happens.
There are no error messages, but all computations return a blank line.
Does this fall into a known class of error?
I can provide my
I agree with Sven, but...
What I want to push is a 'mathematically sound' numeric prelude. A proper
numerical prelude should have bona fide mathematical obects like groups,
rings, and fields underlying common numerical classes. It would be edifying
to the student who discovered that the
Hi,
I just setup and installed hs-plugins from darcs on WinXP using ghc-6.6 and
MSYS.
The hs-plugin test suite all passes.
Can you send me something that generates your error and I'll have a look at
it.
Vivian
Message: 2
Date: Sat, 17 Mar 2007 18:06:12 -0700
From: Conal Elliott [EMAIL
Vivian McPhail wrote:
class Forkable a where
fork :: String - a - a - a
What I would like to be able to do is
differentiate between Forkable (m a -
b) and Forkable (function type - b).
Have you tried this combination of instances?
instance Forkable (IO a) where
Message: 6
Date: Fri, 15 Sep 2006 18:36:35 +0300
From: Anatoly Zaretsky [EMAIL PROTECTED]
Subject: Re: [Haskell-cafe] Why is type 'b' forced to be type 'm a'
and not possibly 'm a - m a'
To: Vivian McPhail [EMAIL PROTECTED]
Cc: Haskell Cafe haskell-cafe@haskell.org
Message-ID
Dear Haskell
Cafe,
I have a problem I can't get my head around.
The
code below sets the problem out. What I need to be able to do is commented
out.
This code works, the
only problem is that what I need is that an argument will be evaluated before it
is passed,
so ((and fries eats)
Hi,
Just as we can define infix operators as syntactic sugar,
could we not also have a similar mechanism for programmable fancy
brackets?
There could be a keyword for the bracket declaration and a
function definition, in this way ana- and catamorphisms, Template Haskell-like
syntax, and
on of type (b - a) to a function of type b to
yield afunction of type a.
Isuppose I could write a codegenerator (in
haskell) that enumerates all possiblederivations of (STT m a) and (-)
but there would still be 5^5 data constructors.
Thanks,
Vivian McPhail
PS Is there somethin
Hi,
When I run my main function I get an error:
The prompt does not wait for user input and thus my parser
fails with an empty head.
Is there a switch to not echo to the console? Is this
the problem? It happens in both Hugs and GHC
main :: IO ()main = do
putStr "sentence?
" input -
there is no way (from this module) to access that
state using the update method of the MonadState class.
1. Am I correct in thinking that I need to use a monad transformer lifting
from the ST monad to incorporate my NeuralNet datatype
2. Can I merely instantiate ST as ST () a?
Thanks in advance.
Vivian
Hi,
I've implemented a Neural Net simulator which needs to repeat a training loop
many times. For this I used a while function: while test body = do
(cond,res) - body
if (test cond) then do rs - while test body
return
Hi,
I've implemented a Neural Net simulator which needs to repeat a training loop
many times. For this I used a while function: while test body = do
(cond,res) - body
if (test cond) then do rs - while test body
return
32 matches
Mail list logo
