On Oct 13, 2006, at 6:23 PM, Adam Megacz wrote:
I'm grateful to whoever prepared the binary bundle for ghc-6.6 on
MacOS/Intel, but the instructions for installing it are missing/wrong.
In particular, make install doesn't do much, and the only binary in
the bundle called ghc appears to need
Deborah Goldsmith [EMAIL PROTECTED] writes:
./configure
make
sudo make install
Ok, sorry. When I noticed that there was no source code in the
bundle, I didn't see the need for running configure/make. I have to
admit, I still find it a bit strange... perhaps standard unix-style
binary
On 14.10 10:20, Ross Paterson wrote:
On Fri, Oct 13, 2006 at 04:05:49PM -0700, Sigbjorn Finne wrote:
Afraid I have to disappoint you (again :-( ) wrt OpenAL/ALUT. A bit
too late, but _if_ there's a wider agreement that including a
package such as this would be generally useful, I'd be happy
Hi,
Has anyone else come across this crash with ghc 6.6 on Windows?
The thread 'Win32 Thread' (0x5c8) has exited with code 0 (0x0).
First-chance exception at 0x7c90eb74 in main.exe: 0xC008:
An invalid HANDLE was specified.
Unhandled exception at 0x7c90eb74 in main.exe:
Hi Einar,
If people are interested I have NSIS scripts that make it trivial to
create windows binary installers for many Haskell packages (for GHC).
I am working on such a project myself for Haskell programs
(haddock/alex etc) but not libraries. Can you give more details about
your proposal,
Are there any plans to make a version of Visual Haskell that works with
Visual Studio 2005?
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
Hi,
since you both only mention hasktags as an alternative, I
wonder how ghctags relates to :ctags/:etags in ghci?
http://haskell.org/ghc/docs/6.6/html/users_guide/ghci-commands.html
Doco suggests that this code is just calling hasktags.
How would I know for sure?
Norman:
Hello nr,
Saturday, October 14, 2006, 12:30:54 AM, you wrote:
The ultimate goal is to replace hasktags with
a tags generator based on GHC-as-a-library.
is this working at this time? how i can download/use it?
It works, but there are two serious problems:
1. Incorrect
Dear Haskellers,
it is nearly time for the eleventh edition of the
Haskell Communities Activities Report
http://www.haskell.org/communities/
Submission deadline: 6 November
Kurze Story zu BPL?
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Hello haskell-prime,
first is the monomorphism restriction. why isn't it possible to check
_kind_ of parameter-less equation and apply monomorphism restrictions
only to values of kind '*'? so, this:
sum = foldr1 (*)
will become polymorphic because its kind is '*-*' while this
exps = 1 : map
Hello haskell-prime,
1. allow to use '_' in number literals. its used in Ruby and i found
that this makes long number literals much more readable. for example
maxint = 2_147_483_648
2. allow to use string literals in patterns as head of matched list:
optionValue (kb++n) = read n * 2^10
Hello,
On 10/14/06, Bulat Ziganshin [EMAIL PROTECTED] wrote:
Hello haskell-prime,
first is the monomorphism restriction. why isn't it possible to check
_kind_ of parameter-less equation and apply monomorphism restrictions
only to values of kind '*'? so, this:
sum = foldr1 (*)
will become
You don't mean checking kind, but checking type.
The same argument that can be made for the monomorphism restriction
at base type can be used for function types too.
There is nothing impossible about prefixpostfix operator. Haskell
just happens not to have them. They could be added.
Hello apfelmus,
Thursday, October 12, 2006, 4:42:14 PM, you wrote:
A better solution would be to begin output before the the whole input is
read, thus making things more lazy. This can be done the following way:
from the input, construct a lazy list of (date,line) pairs. Then, let
foldM
Hi.
Here a simple question: Is there any haskell compiler/interpreter or
similar for PocketPC?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Paul Hudak wrote:
In fact avoiding space leaks was one of the motivations for our moving
to an arrow framework for FRP (now called Yampa). Arrows amount to a
point-free coding style, although with arrow syntax the cumbersomeness
of programming in that style is largely alleviated.
I think
Hi Jason,
Jun Mukai aka. jmuk already tried and successed
to build wxhaskell on GHC 6.6.
Here is his install log.
http://sequence.complete.org/node/214
And I made patch for ghc 6.6 from it.
Attached solves a few problem ... but you must be
careful to your permission.
This patch solve
On Sat, 2006-10-14 at 20:32 +0900, shelarcy wrote:
Hi Jason,
Jun Mukai aka. jmuk already tried and successed
to build wxhaskell on GHC 6.6.
Here is his install log.
http://sequence.complete.org/node/214
And I made patch for ghc 6.6 from it.
Attached solves a few problem ... but you
G'day all.
Carl Witty wrote:
Instead of using an infinite list, you can use an infinite binary tree,
with a cached result at every node.
Quoting [EMAIL PROTECTED]:
This, also known as patricia tree, is indeed the canonical answer.
A Patricia tree is but one infinite tree data structure.
Hi -
I'm wondering if it is possible to construct a methodical procedure to
assign a fixity to symbolic operators so that we could get rid of the need
for user defined fixites. User defined fixities are an enormous problem for
an interactive editor, because it is not possible to construct a
This has been around for some time already. It used to work with
PPC2003, hopefully it'll still do:
http://www.comp.nus.edu.sg/~luzm/ppchugs/
Enjoy it :)
On 14/10/2006, at 8:24, Iván Pérez Domínguez wrote:
Hi.
Here a simple question: Is there any haskell compiler/interpreter or
similar
Hi,
Here a simple question: Is there any haskell compiler/interpreter or
similar for PocketPC?
If you want to port Yhc [1] it shouldn't take more than a couple of hours.
Thanks
Neil
1: http://www.haskell.org/haskellwiki/Yhc
___
Haskell-Cafe
Robert Dockins [EMAIL PROTECTED] writes:
slowFunctionCacheList= [slowFunction (i) | i -[0..500]]
and use slowFunctionCacheList !! i instead of slowFunction (i)
Not much different in principle, but better in practice - you could
use an array rather than a list. O(1) lookups should make
Brian Hulley wrote:
infixr 9 .!! 99.9
infixr 8 ^, ^^, **8 8.87.7
infixl 7 *, /,77
infixl 6 +, -6 6
infixr 5 : , ++
On Saturday 14 October 2006 13:13, Ketil Malde wrote:
Robert Dockins [EMAIL PROTECTED] writes:
slowFunctionCacheList= [slowFunction (i) | i -[0..500]]
and use slowFunctionCacheList !! i instead of slowFunction (i)
Not much different in principle, but better in practice - you could
Perhaps the editor could assume a default precedence when the
user-defined precedence is not yet available. Preferably, the editor
would also somehow yell at the user to indicate that it is making such
an assumption.
I think it's unreasonable to tie programmers' hands for the sake of
off-loading
On 10/14/06, Nicolas Frisby [EMAIL PROTECTED] wrote:
Perhaps the editor could assume a default precedence when the
user-defined precedence is not yet available. Preferably, the editor
would also somehow yell at the user to indicate that it is making such
an assumption.
Perhaps it could even
Last Spring my Functional Programming class implemented a Genetic Algorithm
with Neural Networks that learned to play Nim. The students had a really
good time--they also learned lots about Functional Programming
with Haskell.
Part of the final exam was a tournament.
This Fall in AI we'll
monnier:
Last Spring my Functional Programming class implemented a Genetic Algorithm
with Neural Networks that learned to play Nim. The students had a really
good time--they also learned lots about Functional Programming
with Haskell.
Part of the final exam was a tournament.
This
dons:
monnier:
Last Spring my Functional Programming class implemented a Genetic
Algorithm
with Neural Networks that learned to play Nim. The students had a really
good time--they also learned lots about Functional Programming
with Haskell.
Part of the final exam was a
Hi!
I'm trying to detect parse errors in a happy GLR grammar, but I can't!
I insert the special token 'error', and call the error function when
an error is found. However, the program prints no error messages, and
simply returns a ParseError at the end. Does any of you have an good
example of a
thank you for all the answersi was aware lists are is not the best solution, but i was too keen to see the actual result I'll do some tests though using different variants, because i have the feeling that in my next program I'll face the strong form of this problem.
On 10/13/06, Silviu Gheorghe
On 10/14/06, Brian Hulley [EMAIL PROTECTED] wrote:
User defined fixities are an enormous problem for
an interactive editor
This is the second or third time you've proposed a language change
based on the editor you're writing. I don't think this is a fruitful
avenue.
There are three ways to
Hello,
error isn't implemented yet in GLR mode - it is ignored.
Note that yacc-style error handling can't be transplanted directly into
GLR, since the nature of parse errors is not the same. In LR(k) errors
mean that the single parse can't continue and hence some remedial action
is needed. In
Antti-Juhani Kaijanaho wrote:
Robert Dockins wrote:
I think (pure
speculation) the haskell.org mail server is set up to omit people from
mail it sends if they appear in the To: or Cc: of the original mail.
Yes, this is a feature of recent Mailmans.
Finally, I agree that reply-to munging
Hello,
Yet, I'm a bit astonished. I thought that when compiling with -O2,
cosmetic changes should become negligible. Perhaps the strict foldl' has
an effect?
Perhaps... but I doubt that is the main reason. At the moment I have
no idea why there is such a discrepancy between the heap usages...
37 matches
Mail list logo
