Not only the interfaces [Visual Studio vs. Eclipse]
are completely different, but an entirely new
set of interoperability problems would need to be solved. ...
I still don't see what would be the fundamental difference.
(Except perhaps that the Eclipse interfaces are easily available
and
On 11/29/06, Krasimir Angelov [EMAIL PROTECTED] wrote:
It is possible of course but your definition doesn't correspond to any
operation in the usual vector algebra. By the way how do you define
(*)? Isn't it 3D vector multiplication?
(*) is per component multiplication, as it is in Cg/HLSL.
Hi Dimitry,
I know there is a Haskell syntax parser around (maybe, more than one).
Does anybody know of any utility based on such parser that does things
I need, or rather a library on top of the parser? I just would like to
avoid reinventing the wheel.
I have a Haskell parser here:
Eureka,
I claim to have written an implementation which agrees with all the semantics
that Simon Peyton-Jones wants for onCommit/onRetry/retryWith. See below:
Simon Peyton-Jones wrote:
| In many useful cases, such as the getLine example, the Y action will have
its
| own atomic {} block. In
Duncan Coutts wrote:
On Wed, 2006-11-29 at 20:27 +0100, [EMAIL PROTECTED] wrote:
On the implementation level, lazy evaluation is in the way when
crunching bytes.
Something I rather enjoyed when hacking on the ByteString lib is finding
that actually lazy evaluation is great when crunching
On 11/30/06, Johannes Waldmann [EMAIL PROTECTED] wrote:
The main advantage (Visual Haskell over eclipsefp) at the moment
is that VH uses incremental (on-the-fly) typechecking/compilation
while eclipsefp calls the compiler for whole modules?
I would say this is one of the greatest advantages
2006/11/30, jeff p [EMAIL PROTECTED]:
Is the JavaScript embedding in HSPClientside essentially the same as
the embedding explained in Broberg's thesis?
Yes, in principal the core modules are based on the thesis.
Combinators and higher level functions are built on top of these.
/Joel
VSHaskell isn't interfacing with .NET but is a COM server written in
Haskell. The VStudio IDE is actually implemented in C but is using COM
as an interface to the various plugins. That way you can implement the
plugin in C++/.NET/Haskell or what ever you want. For Eclipse you need
a bridge
Dougal Stanton wrote:
Newbie here working on a little program for fetching podcasts. I've been
using the MissingH.Cmd module in concert with curl to download the RSS
feeds like this:
First off, check out http://quux.org/devel/hpodder -- it is a podcast
downloader written in Haskell that uses
Bulat Ziganshin wrote:
Hi Bulat,
Many thanks for the *great* comments.
first, is it possible to integrate MissingH inside existing core libs,
i.e. Haskell libs supported by Haskell community? i think that it will
be impossible if MissingH will hold its GPL status. i think that
such
Donald Bruce Stewart wrote:
Supposing a polymorphic value (of type, say, forall a . ExpT a t) is
stored inside an existential package (of type, say, forall a . Exp a),
I wonder how to recover a polymorphic value when eliminating the
existential. The ``natural way'' to write this doesn't work:
Quick feedback time...
One comment people made in the Future of MissingH thread was that the name
isn't very suggestive of what the library does.
I'm planning to follow the advice of many people and split the major
MissingH components off into smaller bits (ConfigParser, HVFS, etc).
MissingH
Hi
The alternative I've been thinking of is something like Haskell Utility
Library (HUL).
Yuk. I like MissingH. MissingH suggests things that are missing from
the standard set and provided here. HsMissing would be my preferred
choice, but its not really important.
Haskell says which language
(not sure if this is the best place for questions about VisualHaskell)
I've just installed VisualHaskell, and I've noticed that some of the
hierarchical libraries are missing/hidden:
- Control.Monad.State (and other chunks of the Control.Monad hierarchy,
like
Hello Neil,
Thursday, November 30, 2006, 5:06:55 PM, you wrote:
I think the problem isn't that the name is confusing, but that no one
knows it exists or what it does. Things like adding it to the Hoogle
database would probably help, along with greater there is a function
for that in MissingH
On Thu, 30 Nov 2006, Bulat Ziganshin wrote:
there is one idea: one shouldn't have internet access to be able to
use Haskell effectively. so, good organization and proper names would
be useful
In that vein, Hoogle as an offline tool probably helps. I should play with
it sometime.
--
Hi All!
Haskell newbie here with a very simple question because google and
hoogle are of no help.
On the IRC channel #haskell (which I cannot access now from work) I
saw somebody using a tool which automatically simplifies
expressions,composition of multiple functions to the bare minimum. It
Hello Nicola,
Thursday, November 30, 2006, 5:32:46 PM, you wrote:
On the IRC channel #haskell (which I cannot access now from work) I
saw somebody using a tool which automatically simplifies
expressions,composition of multiple functions to the bare minimum.
it is the IRC channel itself
--
John Goerzen wrote:
Quick feedback time...
One comment people made in the Future of MissingH thread was that the name
isn't very suggestive of what the library does.
My colleague uses modules called `My' to hold functions that seem like
they should be in a library, but which aren't yet
I believe you're talking about the `pl' plugin for lambdabot.
Lambdabot has an offline mode, visit the homepage for the source:
http://www.cse.unsw.edu.au/~dons/lambdabot.html
There is also a web interface to lambdabot, but I can't seem to find
the link.
Cheers,
Spencer Janssen
Hi Spencer,
On 11/30/06, Spencer Janssen [EMAIL PROTECTED] wrote:
I believe you're talking about the `pl' plugin for lambdabot.
Lambdabot has an offline mode, visit the homepage for the source:
http://www.cse.unsw.edu.au/~dons/lambdabot.html
That's exactly what I was looking for!
Neil Mitchell wrote:
Hi
The alternative I've been thinking of is something like Haskell Utility
Library (HUL).
Yuk. I like MissingH. MissingH suggests things that are missing from
the standard set and provided here. HsMissing would be my preferred
choice, but its not really important.
On 30/11/2006, at 17:04, Spencer Janssen wrote:
I believe you're talking about the `pl' plugin for lambdabot.
Lambdabot has an offline mode, visit the homepage for the source:
http://www.cse.unsw.edu.au/~dons/lambdabot.html
There is also a web interface to lambdabot, but I can't
Hi
I couldn't figure out how to add it to hoogle. Does anyone have a pointer
for that?
Wait for Hoogle 4, and bug me. Hoogle 4 will allow additional
libraries to be searched. Once its ready I'll add MissingH.
database would probably help, along with greater there is a function
for that
Hi Alistair,
Visual Haskell is packaged with just the core libraries.
Control.Monad.* modules are part of mtl and Test.HUnit is part of
HUnit which aren't core libraries and aren't installed. It was long
time ago when I was using the official Windows installer for last
time. Is it still packaged
Hi Shelarcy,
Could you check whether you have this registry key:
HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\VisualStudio\8.0\InstallDir
and tell me its value? Typically its value should be such that the
following script to work.
Set shell = CreateObject(WScript.Shell)
vstudioPath = shell.RegRead
You can try to setup it manually using the following commands:
$ regsvr32 /i:8.0 /n vs_haskell.dll
$ regsvr32 /i:8.0 /n vs_haskell_babel.dll
$ regsvr32 /i:8.0 /n vs_haskell_dlg.dll
$ devenv.exe /Setup
On 11/30/06, Krasimir Angelov [EMAIL PROTECTED] wrote:
Hi Shelarcy,
Could you check whether
On 11/30/06, Krasimir Angelov [EMAIL PROTECTED] wrote:
You can try to setup it manually using the following commands:
$ regsvr32 /i:8.0 /n vs_haskell.dll
$ regsvr32 /i:8.0 /n vs_haskell_babel.dll
$ regsvr32 /i:8.0 /n vs_haskell_dlg.dll
$ devenv.exe /Setup
I am having similar problems with
Hi folks,
I'm in need of some Cabal assistance.
I want to build the unit tests for MissingH using Cabal. According to the
docs, this should require me to list all of the exposed modules from the
library as other modules to the binary. Since there are dozens of these, I
thought a simple hook
I posted a weird version of the code. Here's the real version. Same
problem I described, though.
Distribution.Simple
import Distribution.PackageDescription
import Distribution.Version
import System.Info
import Data.Maybe
winHooks = defaultUserHooks {confHook = customConfHook,
Hi
let mydescrip = case System.Info.os of
mingw32 - descrip
_ - descrip {buildDepends =
Aghhh! To test if the operating system is windows you
compare against a hard coded string which _isn't_ an OS, but _is_ an
optional component by
On Thu, Nov 30, 2006 at 08:53:36PM +, Neil Mitchell wrote:
Aghhh! To test if the operating system is windows you
compare against a hard coded string which _isn't_ an OS, but _is_ an
optional component by a 3rd party. It's required to build some Haskell
compilers, but for Yhc
Hi
Your point is well-taken, but the distinction is useful. If running on
cygwin, my platform is essentially POSIX, even though the OS is Windows.
Yes, but _my_ OS is reported as mingw32, even though its never been
installed on this computer...
Thanks
Neil
Like given a string list s=This is the string I want to test, I want to get
the substring. In ruby or other language, it's simple like s[2..10], but how
to do it in Haskell?
--
View this message in context:
http://www.nabble.com/How-to-get-subset-of-a-list--tf2735647.html#a7631994
Sent from the
On Thu, Nov 30, 2006 at 05:47:43PM -0800, Huazhi (Hank) Gong wrote:
Like given a string list s=This is the string I want to test, I want to get
the substring. In ruby or other language, it's simple like s[2..10], but how
to do it in Haskell?
Use take and drop, from the Prelude:
(ghci
Thanks, it make sense here.
However, like I want to choose s[1,3,6,10] or something like this. Are there
some straightforward function or operator for doing this job? The !!
operator in haskell seems does not support multiple indecies.
Hank
Stefan O wrote:
On Thu, Nov 30, 2006 at 05:47:43PM
On 11/30/06, Huazhi (Hank) Gong [EMAIL PROTECTED] wrote:
Thanks, it make sense here.
However, like I want to choose s[1,3,6,10] or something like this. Are there
some straightforward function or operator for doing this job? The !!
operator in haskell seems does not support multiple indecies.
Your curious example suggests you might be solving a more specialized
problem, like selecting the diagonal of a flattened matrix. In this
case, there are much better (and more efficient) data structures that
enforce invariants (like squareness of a matrix), if that is what you in
fact are
Hi Krasimir,
On Fri, 01 Dec 2006 02:18:19 +0900, Krasimir Angelov [EMAIL PROTECTED] wrote:
Could you check whether you have this registry key:
HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\VisualStudio\8.0\InstallDir
and tell me its value?
Hi Krasimir,
On 11/30/06, Krasimir Angelov [EMAIL PROTECTED] wrote:
You can try to setup it manually using the following commands:
$ regsvr32 /i:8.0 /n vs_haskell.dll
$ regsvr32 /i:8.0 /n vs_haskell_babel.dll
$ regsvr32 /i:8.0 /n vs_haskell_dlg.dll
$ devenv.exe /Setup
Why you always show
On 01/12/2006, at 12:47 PM, Huazhi (Hank) Gong wrote:
Like given a string list s=This is the string I want to test, I
want to get
the substring. In ruby or other language, it's simple like s
[2..10], but how
to do it in Haskell?
If your indices are in ascending order, and unique, then
Huazhi (Hank) Gong wrote:
Like given a string list s=This is the string I want to test, I want to get
the substring. In ruby or other language, it's simple like s[2..10], but how
to do it in Haskell?
Quite simply, actually:
infixl 1 %%
str %% idxs = map (str !!) idxs
That is it. Not the
Please tell me if I should just go away or go to another list here.
Thanks again for all the feedback you've sent.
I've got the new MissingH website getting started, and I've posted there
the draft reorganization, module rename, and package split plan here:
On Fri, Dec 01, 2006 at 04:06:08AM +, John Goerzen wrote:
I've got the new MissingH website getting started, and I've posted there
the draft reorganization, module rename, and package split plan here:
http://software.complete.org/missingh/wiki/TransitionPlanning
Your comments (and
First of all, sorry if this is a really silly question, but I couldn't
figure it out from experimenting in GHCi and from the GHC libraries
documentation (or Google).
Is there an IORef consturctor? Or is it just internal to the Data.IORef module?
I want a global variable, so I did the following:
On 01/12/2006, at 6:08 PM, TJ wrote:
First of all, sorry if this is a really silly question, but I couldn't
figure it out from experimenting in GHCi and from the GHC libraries
documentation (or Google).
Is there an IORef consturctor? Or is it just internal to the
Data.IORef module?
I want
Hi Shelarcy,
On 12/1/06, shelarcy [EMAIL PROTECTED] wrote:
Why you always show 8.0 instead of 7.1?
Sorry, I thought that you are using VStudio 2005.
On Fri, 01 Dec 2006 03:48:49 +0900, Justin Bailey [EMAIL PROTECTED] wrote:
I am having similar problems with the Visual Haskell install, and
On 12/1/06, Tomasz Zielonka [EMAIL PROTECTED] wrote:
Do you accept contributions? I have some code I find very useful that
would fit in the same places, like in Text.ParserCombinators.Parsec.Utils,
Data.BitsUtils (btw, why not Data.Bits.Utils?), Control.Concurrent.*.
Hey, contributions. I'll
48 matches
Mail list logo
