Lennart Augustsson has quite a bit of experience in interface Haskell and
Excel, although I'm not sure which way.
Simon
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Justin Bailey
Sent: 19 April 2007 16:59
To: haskell-cafe@haskell.org
Subject:
I'm trying to compile GHC on Windows Vista, but I encountered the
following error when running ./configure --host=i386-unknown-mingw32
--with-gcc=c:/MinGW/bin/gcc:
configure: error: C compiler cannot create executables
See `config.log' for more details.
./configure: line 3404: cannot create temp
Hi Dominic,
Dominic Steinitz wrote:
I've been playing around some more trying improve the performance of the SHA1
implmentation in the crypto library. I've isolated one of the functions and
implemented it using
a) unfold
and
b) STUArray
The STUArray implementation is about twice as
On 22/04/07, Philipp Volgger [EMAIL PROTECTED] wrote:
What IDE support is available for Haskell (Visuall Haskell, EclipseFP),
anything else?
There is pretty decent Emacs support. haskell-mode [1] provides the
basis of this support. There are Emacs Lisp libraries for Haskell
indentation,
If you opt for ubuntu, have a look at
http://groups.google.de/group/fa.haskell/browse_thread/thread/e63e73e7fc9e96c2/be76e381f8c33f39?lnk=stq=%22haskell+cafe%22+%22Trouble+trying+to+find+packages+for+ubuntu+linux%22rnum=1hl=en#be76e381f8c33f39
This little hack enabled me to do a sort of one
| I've done things that are almost identical to what Neil suggests, and
| I've also done a lot of work on calling Haskell code from Excel via
| the Excel4 (XLL) API, but not so much work on calling COM from Haskell.
| It's all doable, but it's a lot of work.
I wonder what we (or someone else)
Tom,
On 4/23/07, Tom Schrijvers [EMAIL PROTECTED] wrote:
What does the config.log say?
Are you able to run the MingW's gcc compiler yourself on a simple C
program?
I had a similar error, cause by the fact that gcc.exe cannot find cc1.exe,
which is in MingW/libexec/gcc/mingw32/3.4.2/. I
On 22/04/07, Nikolay Metchev [EMAIL PROTECTED] wrote:
Hello guys,
I have decided to try and get back into Haskell recently. I have used it in
the past but have forgotten large chunks.
I am trying to express the logic of a particular card game. For this purpose
I need to be able to order cards in
On Mon, 23 Apr 2007, Monique Monteiro wrote:
Tom,
On 4/23/07, Tom Schrijvers [EMAIL PROTECTED] wrote:
What does the config.log say?
Are you able to run the MingW's gcc compiler yourself on a simple C
program?
I had a similar error, cause by the fact that gcc.exe cannot find cc1.exe,
Gour [EMAIL PROTECTED] writes:
On Sun, 22 Apr 2007 22:13:45 +0100
Claus Reinke [EMAIL PROTECTED] wrote:
if you can stay within haskell98, HaRe refactoring support for emacs
and vim is still around:
http://www.cs.kent.ac.uk/projects/refactor-fp/
What about shim
On Fri, 20 Apr 2007, Justin Bailey wrote:
Here's the trick I thought was neat. When creating the MassTime value, I
capture it in a closure and bind it to the selector function, as below:
makeMass :: Day - MassTime
makeMass day =
mass
where
-- Use trick here to capture mass
What IDE support is available for Haskell (Visuall Haskell, EclipseFP),
anything else?
I'm working in Haste2[1]. But it is unreleased :P
[1] http://www.dtek.chalmers.se/~davve/haste2-new.png
/David
___
Haskell-Cafe mailing list
Folks,
I have code like this that I want to test with QuickCheck but I'm
having trouble imagining how I would wrap it up in a property.
Do I make sure that id, subs, back are always morphed properly or do
I leave that to separate properties for their respective types?
Do I then ensure
On 4/23/07, Simon Peyton-Jones [EMAIL PROTECTED] wrote:
I wonder what we (or someone else) could do to make it less work?
Even a 'cookbook' to explain what to do would be jolly useful.
Give me a way to get to the .NET libraries and the world is my oyster ...
Based on my experience using
This looks nice! Is there a project page for Haste2? How far along is
it? Is it based on gtk2hs?
On 4/23/07, David Waern [EMAIL PROTECTED] wrote:
What IDE support is available for Haskell (Visuall Haskell, EclipseFP),
anything else?
I'm working in Haste2[1]. But it is unreleased :P
[1]
On 23/04/07, David Waern [EMAIL PROTECTED] wrote:
What IDE support is available for Haskell (Visuall Haskell, EclipseFP),
anything else?
I'm working in Haste2[1]. But it is unreleased :P
[1] http://www.dtek.chalmers.se/~davve/haste2-new.png
That's really clean-looking and undistracting.
This looks nice! Is there a project page for Haste2? How far along is
it? Is it based on gtk2hs?
Yes, it's based on the Scintilla[1] editor and gtk2hs. I've only been
working on it for a couple of weeks, and that includes creating the
Scintilla binding for gtk2hs, so it doesn't have that many
Hi David,
Yes, it's based on the Scintilla[1] editor and gtk2hs. I've only been
working on it for a couple of weeks, and that includes creating the
Scintilla binding for gtk2hs, so it doesn't have that many feature yet.
There's no homepage either.
[1] http://www.scintilla.org/
Have you seen
On 23/04/07, David Waern [EMAIL PROTECTED] wrote:
What IDE support is available for Haskell (Visuall Haskell,
EclipseFP),
anything else?
I'm working in Haste2[1]. But it is unreleased :P
[1] http://www.dtek.chalmers.se/~davve/haste2-new.png
That's really clean-looking and
Have you seen the GuiHaskell project, and were you aware that there is
a summer of code project on it? This will provide some way of
interfacing to all compilers, and various buttons, but none of the
editing features.
Yes, I was aware of it. My plan was to experiment with the editor, the GHC
On 4/23/07, Tom Schrijvers [EMAIL PROTECTED] wrote:
Do make sure that MingW's bin/ and libexec/gcc/mingw32/3.4.2/ are the very
first two in your path. I get the same error message if I don't do that.
Yes. Here is my cygwin.bat:
@echo off
SET MAKE_MODE=UNIX
SET SHELL=c:/cygwin/bin/sh
SET
Hi everybody =)
First time I write to the list.
My name is Glauber and I'm doing my master course at UNICAMP, Brazil,
under supervisor of Prof. Dr. Arnaldo Vieira Moura.
I'm interested in Haskell, type theory and algebraic specification
(formal methods). I've been studying these subjects to my
Hello everyone,
I have some code in which the bottleneck is the factorial function. I
began by using a naive
fac n = product [1..n]
but it looks like there are faster ways to do it. I could try to look up
those faster algorithms and implement them, but I'm guessing that using
libgmp's
Am Sonntag, 22. April 2007 15:06 schrieb Dominic Steinitz:
I've been playing around some more trying improve the performance of the
SHA1 implmentation in the crypto library. I've isolated one of the
functions and implemented it using
a) unfold
and
b) STUArray
The STUArray implementation
On Mon, Apr 23, 2007 at 01:06:07PM -0500, Dan Drake wrote:
Hello everyone,
Hi!
I have some code in which the bottleneck is the factorial function. I
began by using a naive
fac n = product [1..n]
but it looks like there are faster ways to do it. I could try to look up
those faster
We are starting up a New York area-based network for functional programmers.
The idea is to have a regular meeting through which functional programmers can
meet to discuss experiences, get and give information, find jobs etc.
The first official meeting will be held on Thursday May 3rd at the
DisTract is a Distributed Bug Tracker.
We're all now familiar with working with distributed software control
systems, such as Monotone, Git, Darcs, Mercurial and others, but bug
trackers still seem to be fully stuck in the centralised model:
Bugzilla and Trac both have single centralised servers.
Nice. You might find Bugs Everywhere
http://www.panoramicfeedback.com/opensource/ interesting for comparison.
b
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
As an exercise I wrote a simple string substitution library that supports
$-based substitution ala Perl or Python. Example usage:
import qualified Data.ByteString.Lazy.Char8 as B
import Text.Template
context = Map.fromList . map packPair
where packPair (x, y) = (B.pack x, B.pack y)
My previous post did not receive any replies so I thought I might try
generalizing the problem a bit...
Suppose I'm parsing a language into a syntax tree and then
transforming that tree into another AST representing a core
language. The core language is a more general AST that should help
Without looking into your language and transformation in more detail
it's hard to come up with concrete suggestions. But here are some
anyway:
Write an interpreter for each of your languages (original AST,
transformed AST) etc, and then use a quickcheck property stating that
well formed
On Mon, Apr 23, 2007 at 01:06:07PM -0500, Dan Drake wrote:
Hello everyone,
I have some code in which the bottleneck is the factorial function. I
began by using a naive
fac n = product [1..n]
but it looks like there are faster ways to do it. I could try to look up
those faster
Additionally, as a safety net, you might want to type-check the code
that's being produced by your Arbitrary instances and state some
invariants on your code. Also, you'll likely want to limit your
number of evaluation steps if your language allows non-terminating
programs.
In any case,
Hi
My experience is that generating correct AST's is hard to get right.
I've found regression testing to be more useful when doing program
transformation.
I would follow Lennarts solution of writing a function that
semantically evaluates each expression. I would then add a bit into
your program
All in all it doesn't really matter what system you run. What you
really need is a haskell compiler or interpreter installed, preferable
one compatible with the standard and latest version of programs you
may want to research. Use the system you alredy know how it works so
the OS won't bug you
Hi, I don't read it, anyway you can try.
http://liinwww.ira.uka.de/cgi-bin/bibshow?e=Njtd0DjufTffs02::8%6015/fyqboefe%7d3352:26r=bibtexmode=intra
http://research.microsoft.com/%7esimonpj/Papers/com.ps.gz
att
Rafael Cabral
On 4/19/07, Justin Bailey [EMAIL PROTECTED] wrote:
All,
I'm
On Mon, 23 Apr 2007 at 12:03PM -0700, David Roundy wrote:
I'm curious: what is your application? I've never seen one in which
factorials actually need be computed. In physics, one factorial is
generally divided by another (e.g. for combinatorics), so it's rarely
wise to take the actual
On Mon, Apr 23, 2007 at 06:25:39PM -0500, Dan Drake wrote:
On Mon, 23 Apr 2007 at 12:03PM -0700, David Roundy wrote:
I'm curious: what is your application? I've never seen one in which
factorials actually need be computed. In physics, one factorial is
generally divided by another (e.g. for
Dan Drake wrote:
This is combinatorics, so I can't just say oh, this is small and cross
it off like physicists do. :)
Binary splitting is much faster than the naive approach, but still easy
to understand. That's fac1 in the attached file.
I ran out of time to write an efficient
On Mon, Apr 23, 2007 at 06:25:39PM -0500, Dan Drake wrote:
I'm finding the number of set partitions that correspond to a certain
integer partition. If p = p_1, p_2,...,p_k is an integer partition of n,
then there are
n!
Albert Y. C. Lai wrote:
I try using WordSet = [String] (plus corresponding change in code) and
get great speedup, actually way more than 3x. There was also a memory
growth phenomenon using Set String, and replacement by [String] stops
that too, now it's constant space (constant = 20M). It is
On 24/04/2007, at 1:39 am, Justin Bailey wrote:
Give me a way to get to the .NET libraries and the world is my
oyster ...
I second that :-) Such access will probably become more important
over time as Microsoft release more .NET-only libraries (like Windows
Presentation Foundation and
Oleg,
Many thanks. i also found some course notes from Advance Functional
Programming at Utrecht very useful. i have to wait until i have quality time
to go over this because the next step is to close the final loop to find the
fix point of
- Process = Process(Nominate(Process))
i haven't
Why all the fuss? n! is in fact very easily *completely* factored into
prime numbers (and this never changes, so you can just read in a binary
lookup table). It took my machine only 3 seconds to find the prime
factors of the first 1000 factorials:
Then you can do for example:
import List
G'day all.
Quoting Dan Weston [EMAIL PROTECTED]:
Why all the fuss? n! is in fact very easily *completely* factored into
prime numbers [...]
It's even easier than that.
primePowerOf :: Integer - Integer - Integer
primePowerOf n p
= (n - s p n) `div` (p-1)
where
s p 0 = 0
s p n =
45 matches
Mail list logo
