On 2006-01-14, Keean Schupke [EMAIL PROTECTED] wrote:
Erm, has nobody replied to this yet? I want a robust interface, that
uses bracket notation all the way down, so that any error is caught and
resources are freed appropriately without the use of finalizers (which
may not get run and lead
On 2006-01-14, Tom Hawkins [EMAIL PROTECTED] wrote:
I have HDBC running with Sqlite3, but I'm getting a SqlError due to a
locked table. Please excuse my SQL ignorance, but what may be causing
the problem? In SQL, are we not allowed to select, update, and delete
from a table within a single
Haskell Weekly News: January 16, 2006
Greetings, and thanks for reading the 20th issue of HWN, a weekly
newsletter for the Haskell community. Each Monday, new editions are
posted to [1]the Haskell mailing list and to [2]The Haskell Sequence.
[3]RSS is also
[EMAIL PROTECTED] (Donald Bruce Stewart) writes:
:D
Haskell now ranked 2nd overall, only a point or so behind C:
http://shootout.alioth.debian.org/gp4/benchmark.php?test=alllang=all
Very impressive! And note that if you put zero weight on memory use,
GHC wins by a large margin. (OTOH,
On 2006-01-13, Tom Hawkins [EMAIL PROTECTED] wrote:
I have HDBC running with Sqlite3, but I'm getting a SqlError due to a
locked table. Please excuse my SQL ignorance, but what may be causing
the problem? In SQL, are we not allowed to select, update, and delete
from a table within a single
Haskell now ranked 2nd overall, only a point or so
behind C:
It was always obvious that the Write the program
as-if lines of code were not being measured clause
relied too heavily on contributors willingness to
co-operate.
http://shootout.alioth.debian.org/gp4/faq.php#implementlist
Maybe we
John Goerzen wrote:
...
I didn't honestly follow the STRef discussion, or how something so
I/O-based could work there.
-- John
The only message I've found was Oleg mentioning the typing that keeps
an STRef limited to the scope of the runST it came from.
I don't think database access could
On 1/15/06, Isaac Gouy [EMAIL PROTECTED] wrote:
Haskell now ranked 2nd overall, only a point or so
behind C:
It was always obvious that the Write the program
as-if lines of code were not being measured clause
relied too heavily on contributors willingness to
co-operate.
I have added the debugged non-memory-leaking and now sped-up-with-trees
version of the fasta code to the wiki:
http://haskell.org/hawiki/FastaEntra
This will be submitted soon. I do not think this is a good candidate
for lines-of-code compression/obfuscation.
In speed this entry runs 5.0 times
Abigail wrote:
Hi,
I have been searching papers about tha raltionship
between formal methods in software engineering and
functinal programmming, but i haven't found enough
information.
Functional programming in pure functional languages like Haskell can
help to make programs easier to reason
On Wed, Jan 11, 2006 at 03:00:45PM +, Simon Marlow wrote:
Ian Lynagh wrote:
On Wed, Jan 11, 2006 at 10:36:47AM +, Simon Marlow wrote:
My suggestion: don't use the lazy state monad if you can help it.
But a strict state monad would force everything to be loaded into memory
at once,
sebastian.sylvan:
On 1/15/06, Isaac Gouy [EMAIL PROTECTED] wrote:
Haskell now ranked 2nd overall, only a point or so
behind C:
It was always obvious that the Write the program
as-if lines of code were not being measured clause
relied too heavily on contributors willingness to
On 1/15/06, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
sebastian.sylvan:
On 1/15/06, Isaac Gouy [EMAIL PROTECTED] wrote:
Haskell now ranked 2nd overall, only a point or so
behind C:
It was always obvious that the Write the program
as-if lines of code were not being measured
sebastian.sylvan:
On 1/15/06, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
sebastian.sylvan:
On 1/15/06, Isaac Gouy [EMAIL PROTECTED] wrote:
Haskell now ranked 2nd overall, only a point or so
behind C:
It was always obvious that the Write the program
as-if lines of
jupdike:
Maybe we finally have enough motivation to move to
some other measurement of program volume :-)
I'm not sure how you could do this better, though... Maybe counting
the number of tokens (not sure how you'd define that though)
I was thinking the same thing for the past few
Robin Green wrote:
2. Dependent types: By programming in a dependently-typed functional
programming language such as the research language Epigram, it is
possible to write functional programs whose types force them to be
correct. See for example Why Dependent Types Matter by Thorsten
On 1/16/06, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
sebastian.sylvan:
On 1/15/06, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
sebastian.sylvan:
On 1/15/06, Isaac Gouy [EMAIL PROTECTED] wrote:
Haskell now ranked 2nd overall, only a point or so
behind C:
It
Lennart Augustsson wrote:
Robin Green wrote:
2. Dependent types: By programming in a dependently-typed functional
programming language such as the research language Epigram, it is
possible to write functional programs whose types force them to be
correct. See for example Why Dependent Types
I confess I haven't really been following this discussion, but a friend of
mine has a recent paper that might be of interest (though it deals with ML
rather than Haskell)...
http://math.andrej.com/2005/04/09/specifications-via-realizability/
--
Hal Daume III
--- Donald Bruce Stewart [EMAIL PROTECTED] wrote:
-snip-
Ah! Just as I thought, SML really was trying very
hard ;)
Quite possibly so, but no reason to follow down that
slippery slope ;)
__
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best
Greetings,
I'm trying hard to get a better hold on the Cabal[1] project, and a
more clear idea of all the outstanding work that needs to be done.
I've gone through my mailbox to dig up stuff like this, but no doubt
some has slipped between the cracks.
I started a bug tracker / wiki a few weeks
21 matches
Mail list logo
