I am trying to determine why my stack overflows in my medium sized
program (it has several modules but maybe only 1000 LOC total). On
Windows, at least, the ghcprof visualization tool doesn't work. Any
suggestions besides an output trace?
It may be the function below, which tries to determine if
On 8/16/07, Matthew Brecknell [EMAIL PROTECTED] wrote:
However, it's possible that your use of this function is forcing
evaluation of a deeply-nested thunk you've created somewhere else (as
print does in the foldl example).
Thank you for the detailed and helpful reply. I was led to this
On 8/17/07, apfelmus [EMAIL PROTECTED] wrote:
Extracting the head and tail of ss with a let statement could lead to
a huge unevaluated expression like
rest = tail (tail (tail (...)))
Even though they are probably forced, would breaking the head and tail
apart via pattern-matching or a
On 8/18/07, Matthew Brecknell [EMAIL PROTECTED] wrote:
Justin Bailey:
Would retainer profiling help me see what was building up
this large thunk/closure?
I'm not really familiar enough with GHC's profiling to answer that, but
I'll take a guess.
You're experimental programs have given me
Does anyone have code for finding a subsequence within a
Data.Sequence.Seq value, or is there a way to do it with the already
defined instances that I am missing? A quick search didn't turn up
much. Thanks in advance!
Justin
___
Haskell-Cafe mailing
Using the code developed for ByteStrings by myself, Christ Kuklewicz
and Daniel Fischer, I've implemented Knuth-Morris-Pratt substring
searching on Data.Sequence Seq values. Attached you'll find the
library in kmp.zip.safe. The algorithm is implemented in the module
Data.Sequence.KMP.
At the
On 9/7/07, brad clawsie [EMAIL PROTECTED] wrote:
i recently worked up a little example program i use to generate a
general news summary page using yahoo web services
Thanks for posting that. Could you put an example of the generated HTML up too?
Justin
Using the code developed for ByteStrings by myself, Christ Kuklewicz
and Daniel Fischer, I've implemented Knuth-Morris-Pratt substring
searching on Data.Sequence Seq values. Attached you'll find the
library in kmp.zip.safe. The algorithm is implemented in the module
Data.Sequence.KMP.
At the
On 9/9/07, Tim Newsham [EMAIL PROTECTED] wrote:
I wrote a small intro about how to write a parser in haskell. Its
basically about parsec and how it works, but its written without directly
referencing parsec and aimed towards beginners (basically wrote it for
some friends).
Nice development of
On 9/11/07, Peter Verswyvelen [EMAIL PROTECTED] wrote:
How well and how can a Haskell program be tested to make sure it does
not cause these space/time bugs? What tools are typically used?
I've been fighting this myself. I had an especially nasty
stack-overflow that took me weeks to track
On 9/16/07, Barney Hilken [EMAIL PROTECTED] wrote:
Now that I have a version of ghc with type classes, I have had a go
at implementing records based on the ideas I mentioned on this list a
few months ago. The code of my first attempt is available at http://
I have a data structure which is a list of bytestrings, but externally
it looks like one big string. One of the operations I want to support
takes a section of the string, starting at some arbitrary index and
ending somewhere further down the line. In implementing the function I
came up with the
On 9/20/07, Duncan Coutts [EMAIL PROTECTED] wrote:
A lazy bytestring is a list of strict bytestring which externally looks like
one
big string. Could you not just use a lazy bytestring and it's take and drop
functions? Perhaps you can help me understand what it is you're trying to do?
I'm
On 10/3/07, PR Stanley [EMAIL PROTECTED] wrote:
I didn't even know about the curry and uncurry functions. I'm not
looking for the answer but some guidance would be much appreciated.
Thanks, Paul
You can look at the types without seeing the implementation, too. Just start
up GHCI and type:
One of the holes in real-world Haskell is you never know if a
library/function is calling unsafePerformIO and you have to trust the
library author. I recognize the necessity of the function, but should it
announce itself? unsafePerformIO has this type:
unsafePerformIO :: IO a - a
Would there
On 10/3/07, Victor Nazarov [EMAIL PROTECTED] wrote:
But how would you know that evil dictator uses unsafePerformIO???
You don't. unsafePerformIO can't be taken it away (there are legitimate
reasons to strip IO), which is why I wonder if it's useful at all.
p.s. CC'ed to haskell-cafe
On 10/10/07, Peter Verswyvelen [EMAIL PROTECTED] wrote:
A noble goal and I wish you luck. I'd love to see if you get .NET working
with Haskell - I have tried to figure it out from that old build of Hugs and
never had any luck. Tantalizingly, the GHC source has some Dotnet stuff in
it but it
I am trying to parse various date and time formats using the parseTime
function found in (GHC 6.6.1) Data.Time.Format. The one that is giving me
trouble looks like this:
2008-06-26T11:00:00.000-07:00
Specifically, the time zone offset isn't covered by the format parameters
given. I can almost
On 10/16/07, Bjorn Bringert [EMAIL PROTECTED] wrote:
Hmm, perhaps I should clarify this: parsedate and time-1.1.1 (which
comes with GHC 6.6.1) have different APIs. parsedate produces
CalendarTimes, and the code in time-1.1.1 produces the new time and
date data types. So I guess parsedate
On 10/16/07, Bjorn Bringert [EMAIL PROTECTED] wrote:
Should we just add XX:XX as an alternative time zone offset format
accepted by %z and %Z? Is this a standard format?
I'm not sure, but I am getting this date from Google in their XML feeds
representing calendar data. The specific element
On 10/16/07, Dan Piponi [EMAIL PROTECTED] wrote:
I was just putting together my Amazon wish list and was wondering if
there are any great books on Haskell and/or functional programming
that people think are must-reads. Okasaki's Purely Functional
Hudak's The Haskell School of Expression is
On 10/17/07, Thomas Hartman [EMAIL PROTECTED] wrote:
Is there a more scientific way of figuring out if one version is better
than the other by using, say profiling tools?
Profiling Haskell programs is black magic, but of the sort you learn by
having a problem to solve. I don't think it
On 10/22/07, Rene de Visser [EMAIL PROTECTED] wrote:
I had a look at using HXT awhile ago. Parsec is the least of the problems.
HXT stores the XML as an explicit tree in memory, where the head has
explict
references to the children.
What did you end up using? I've started building an app
On 10/22/07, Neil Mitchell [EMAIL PROTECTED] wrote:
If this now reports no errors, who wants to guess which come up as
escape codes, and which don't. The way other languages like C# have
dealt with this is by introducing a new type of quoted string:
@:\/
The C# implementation is really
In my best Homer Simposon voice - unfoldr - is there anything it can't do?
I have strange unfoldr love right now. I'm probably too impressed by
this function, but it takes a string and splits it into a list of
words, while keeping quoted phrases together:
import Data.List
On 10/31/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
I didn't keep a copy, but if someone wants to retrieve it from the Google
cache and put it on the new wiki (under the new licence, of course), please
do so.
Cheers,
Andrew Bromage
Done:
Massimiliano,
I had to update your code for it to compile (removed sequence from
testpdf'. However, I don't see any significant difference in the
memory profile of either testpdf or testpdf'.
Not sure how you are watching the memory usage, but if you didn't know
the option +RTS -sstderr will
The other day I decided to implement a ring buffer with a current
element (i.e. a doubly-linked zipper list). In order to allow inserts
(and, in the future, deletes and updates), I have a special sentinel
element called Join in the structure. When inserting, I find the
join first, insert and then
On Nov 7, 2007 2:21 PM, Bryan O'Sullivan [EMAIL PROTECTED] wrote:
Chris mentioned that he did, but I haven't had time to write anything
benchmarky yet.
I used the attached program to benchmark the various functions against
endo.dna[1], a 7 MB file that came with this year's ICFP contest. It
On Nov 7, 2007 10:16 AM, apfelmus [EMAIL PROTECTED] wrote:
Do you really need to realize the cycle by sharing? I mean, sharing
doesn't go well with insertion / updates / deletion since each of these
operations breaks it and needs to restore it everywhere. In other words,
your insert takes
So I'm the one user in a thousand that will want to provide my own I/O
functions, for example. In the old world, I guess I would be looking
for some extended API where my I/O functions are parameters to the open
or init function, and the IMAP functions take over from there. In a
more pure
I would like to create a data structure that uses an unboxed array as
one of its components. I would like the data structure to be
parameterized over the type of the elements of the array. Further, I'd
like to build the array using runSTUArray. I can't make the code work
though. My naive approach:
On Nov 10, 2007 12:24 PM, apfelmus [EMAIL PROTECTED] wrote:
Note that depending on your concrete setting, you may not need a fancy
ring structure for cellular automata. And with simple automata like
I realized that I never updated my automata once a row was created,
and ended up using an
I've compiled HDBC 1.0.1 and HDBC-postgresql-1.0.1 under Windows with
a little tweaking. However, when I try to run the tests I get this
error:
runghc -package HDBC-postgresql runtests.hs
ghc.exe: can't load .so/.DLL for: pq (addDLL: unknown error)
libpq.dll is in my path, and I added the
--
From: Justin Bailey [EMAIL PROTECTED]
Date: Nov 12, 2007 3:41 PM
Subject: Trouble using HDBC-postgres on Windows - can't find libpq.dll
To: Haskell Cafe haskell-cafe@haskell.org
I've compiled HDBC 1.0.1 and HDBC-postgresql-1.0.1 under Windows with
a little tweaking. However, when I try
On Nov 13, 2007 7:09 AM, Bayley, Alistair
[EMAIL PROTECTED] wrote:
You're using runghc, so I guess that must use ghci, or something
equivalent. You may find, now that you've changed the cabal entry to
libpq, that you can no longer build with ghc (the compiler). But my
memory of this is hazy.
On Nov 13, 2007 10:56 AM, John Lato [EMAIL PROTECTED] wrote:
I know there are several important differences between let-expressions
and where-clauses regarding scoping and the restriction of where to
a top-level definition. However, frequently I write code in which
One place I find it useful
I've been working on a program over the last few days to evolve
cellular automata rules using a genetic algorithm. Luckily, this email
has nothing to do with CAs but everything to do with Haskell
performance.
For those who don't know, a CA is represented as a row of cells, where
each can be
On Nov 13, 2007 2:21 PM, Ryan Ingram [EMAIL PROTECTED] wrote:
Never mind, I realized this is a ring buffer with `mod` s. That's another
slow operation when you're doing code as tight as this. If you can
guarantee the ring is a power of 2 in size you can use a mask instead, or
use my
On Nov 13, 2007 2:49 PM, Stefan O'Rear [EMAIL PROTECTED] wrote:
About how wide are your rules usually?
7 bits (3 neighbors on each side plus the current cell).
Justin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I implement bit shifting to get the next rule, as you suggested, and
that cut my run time by 75%. It went from 200 seconds to do 100 rules
on 100 CAs to 50 seconds. Amazing.
Justin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
It's:
f $! x = x `seq` f x
That is, the argument to the right of $! is forced to evaluate, and
then that value is passed to the function on the left. The function
itself is not strictly evaluated (i.e., f x) I don't believe.
Justin
___
Haskell-Cafe
On Nov 15, 2007 9:01 AM, Jim Burton [EMAIL PROTECTED] wrote:
How would I go about converting the little get program at
http://darcs.haskell.org/http/test/get.hs to use a proxy server? I tried
adding a call to setProxy like this but it doesn't work:
I think it needs to be a real URL:
On Nov 15, 2007 6:25 PM, Galchin Vasili [EMAIL PROTECTED] wrote:
Hello,
I have a Haskell script that contains several functions that are
implemented in terms on interact. When I do a function application,
Hugs/ghci is waiting for input from stdin. How do one denote EOF from stdin,
so
On Nov 19, 2007 10:25 AM, brad clawsie [EMAIL PROTECTED] wrote:
so far the haskell community has taken the cpan route for most
practical libs but i wonder if a batteries included approach might
help get some key libraries to a more complete state. in particular, i
would like to see support for
I posted awhile back asking for help improving my cellular automata
program. I am competing with a C program which evolves CAs using a
fairly simple genetic algorithm. The algorithm involves evaluating 100
rules on 100 CAs, 100 times. In C this takes about 1 second. In my
Haskell version, it takes
On Nov 29, 2007 9:11 PM, Jon Harrop [EMAIL PROTECTED] wrote:
Mathematica uses a single arbitrary-precision integer to represent each
generation of a 1D automaton. The rules to derive the next generation are
compiled into arithmetic operations on the integer. The offloads all such
work onto
On Nov 29, 2007 4:45 PM, Felipe Lessa [EMAIL PROTECTED] wrote:
Why don't you use an UArray of Bools? They're implemented as bit
arrays internally, AFAIK (e.g. see
http://www.haskell.org/haskellwiki/Shootout/Nsieve ). And then you
would get rid of a lot of shifts and masks in your code --
I'm working on a project which would generate a PHP data-access layer
from a Haskell model. I'm wondering what libraries might be already be
available for generating PHP or other types of code. The
pretty-printing library is one option. Any other suggestions?
Thanks in advance.
Justin
On Dec 20, 2007 7:42 PM, Sterling Clover [EMAIL PROTECTED] wrote:
I'm curious how much of the unboxing helped performance and how much
didn't. In my experience playing with this stuff, GHC's strictness
analyzer has consistently been really excellent, given the right
hints. Unboxed tuples are
Given this function:
dropTest n = head . drop n $ [1..]
I get a stack overflow when n is greater than ~ 550,000 . Is that
inevitable behavior for large n? Is there a better way to do it?
Justin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Dec 21, 2007 9:48 AM, Brad Larsen [EMAIL PROTECTED] wrote:
I'm curious as well. My first thought was to try the (!!) operator.
Typing
Prelude [1..] !! 55
overflows the stack on my computer, as does dropTest 55.
I think its [1..] which is building up the unevaluated thunk.
On Dec 21, 2007 2:55 PM, Bertram Felgenhauer
[EMAIL PROTECTED] wrote:
If you look at the generated machine code, you'll find that f and g
are identical functions. The sole purpose of the int2Word# and
word2Int# operations is to satisfy the type checker. (This is
even true at the core level.
When I joined the haskell-cafe mailing list, I was surprised to see
the reply-to header on each message was set to the sender of a given
message to the list, rather than the list itself. That seemed counter
to other mailing lists I had been subscribed to, but I didn't think
too much about it.
. Removing it
allowed me to remove all extensions except MultiParameterTypeClasses.
Justin
-- Forwarded message --
From: Justin Bailey [EMAIL PROTECTED]
Date: Dec 31, 2007 12:25 PM
Subject: Attempt at defining typeful primary key/foreign key relationships
To: [EMAIL PROTECTED
I can speak to haskelldb a little, see below:
On Jan 2, 2008 3:50 AM, Peter Verswyvelen [EMAIL PROTECTED] wrote:
·regarding Haskell and databases, the page
http://haskell.org/haskellwiki/Libraries_and_tools/Database_interfaces
describes a few, but which are the ones that are stable and
On Jan 13, 2008 5:54 AM, Torsten Otto [EMAIL PROTECTED] wrote:
Howdy,
with a just-in-time-learning approach I managed to teach my class of
advanced high schoolers the basics of functional programming using
Haskell (I had only used Scheme before). Now to show them that Haskell
That is
As part of the Ruby Quiz in Haskell solutions appearing on the wiki
recently, I just a solution to Ruby Quiz #100 - create a bytecode
interpreter for a simple expression language.
Like I said, the code below parses simple integer arithmetic
expressions and generates byte codes for a hypothetical
On 11/9/06, Brandon Moore [EMAIL PROTECTED] wrote:
Looks nice, especially if you're just getting started.
The overall structure looks good, I've just made a bunch of
little changes to the details. Mostly I found repeated patterns
to replace with library functions or extract as helper functions.
On 11/10/06, Dougal Stanton [EMAIL PROTECTED] wrote:
As you noted that doesn't seem right --- how does compile capture its
input? Well, the (.) operator is slightly different. It captures
variables and passes them into the 'innermost' function, a bit like
this:
That is a great explanation.
On 11/15/06, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
Yes, these techniques are fairly well known now, and hopefully some ofthe more experienced Haskellers are using them (I certainly use thenon-empty list tricks). Any anyone with more than 6 months Haskell knows
to avoid fromJust.The problem
I downloaded the SOE sources from http://www.haskell.org/soe and found they
were not compatible with the my version of WinHugs (Sep 2006). I have two
questions:
1) Is an updated version of those sources available?
2) If not, would someone like to host mine? I updated all the source files
so
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
On 11/30/06, Krasimir Angelov [EMAIL PROTECTED] wrote:
I wonder whether this may cause the problem. I have uploaded a new
vs_haskell.dll here:
http://www.haskell.org/visualhaskell/vs_haskell.zip
It is the same dll but without stripped debug symbols. Could you try
to replace it in your
I'm reading Chris Okasaki's Purely Functional Data Structures, and some
of his Haskell is confusing me. He defines the type Color and RedBlackSet
as:
data Color = R | B
data RedBlackSet a = E | T Color (RedBlackSet a) a (RedBlackSet a)
and then later he defines a function insertSet:
On 06 Dec 2006 19:33:51 +, Jón Fairbairn [EMAIL PROTECTED]
wrote:
and in the where statement:
T _ a y b = ins s
Here it's a pattern match. So if ins s returns (T x a' y'
b'), then a = a'; y = y'; b = b' are used in the expresion
covered by the where clause.
Great, thanks
I am learning Haskell, and I really want to be able to use .NET libraries
from it. I've found the Hugs98.NET binary available from Galois, but it
seems very, very stale. Is there anything more recent available? Or did I
miss something?
My motivation for this email is a recent series of posts[1]
On 12/12/06, Joachim Durchholz [EMAIL PROTECTED] wrote:
Agreed.
Something along the lines of The Art of Functional Programming.
+1 . I would love to read something that is the equivalent of 'design
patterns', but for functional languages. I thought Osasaki's book Purely
Functional Data
On 12/13/06, Krasimir Angelov [EMAIL PROTECTED] wrote:
The problem with Haskell for .NET is that the produced executables are
usually very slow. Good optimizing compiler like GHC has better chance
I don't really want something that compiles Haskell to the CLR, though that
would be great
Those are some great resources, thanks everyone!
Justin
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 12/14/06, Steve Downey [EMAIL PROTECTED] wrote:
i'm not naive enough to think they are the composition function, and
i've gathered it has something to do with free terms, but beyond that
i'm not sure. unless it also has something to do with fix points?
The points are the arguments. The
On 12/15/06, Jason Dagit [EMAIL PROTECTED] wrote:
On 12/15/06, Tomasz Zielonka [EMAIL PROTECTED] wrote:
The Haskell web server that Simon Peyton-Jones et al described in
their
paper would be a great example. But where's the download?
Let me stress this: HWS is an *exception*. It's the
On 1/7/07, Brandon S. Allbery KF8NH [EMAIL PROTECTED] wrote:
http://rubyforge.org/ , for one. But I'd argue it's not really
Hackage, so much as a pretty wrapper for darcs.haskell.org. (Gems is
the Ruby equivalent of Cabal and Hackage.)
I've been programming in Ruby for about 1.5 years, and
On 1/8/07, Sven Panne [EMAIL PROTECTED] wrote:
Am Montag, 8. Januar 2007 17:15 schrieb Justin Bailey:
[...]
For example, if I want to install Rails (ruby web-app framework), I just
type:
gem install rails
It's pretty slick.
How does this work with the native packaging mechanism on your
On 1/25/07, Simon Peyton-Jones [EMAIL PROTECTED] wrote:
Many of you will know that Paul Hudak, John Hughes, Phil Wadler and I have been
working on a paper called
A History of Haskell: being lazy with class
Just wanted to say this paper is excellent, and actually a great tool
for
In The Monad.Reader - Issue 6, that just came out, there is a really
interesting article that uses a circular technique to implement an
assembly language in Haskell. The technique demonstrated seems
fascinating. Can someone point me to more resources on the topic?
A quick google search turned up
On 2/1/07, Slavomir Kaslev [EMAIL PROTECTED] wrote:
would be sweet. Even sweeter is easily accessing .Net Framework from
ghc, especially for Windows users. .Net Framework is huge. It is
de-facto _the_ windows framework. Are there any projects going in this
direction?
I would so love to see
2008/1/15 Immanuel Normann [EMAIL PROTECTED]:
I don't know what pairs of strings this function needs. The API
description is to unspecific:
The connect function takes some driver specific name, value pairs use to
setup the database connection, and a database action to run.
What are the
On Jan 13, 2008 11:47 PM, Sterling Clover [EMAIL PROTECTED] wrote:
HStringTemplate is a port of Terrence Parr's lovely StringTemplate
(http://www.stringtemplate.org) engine to Haskell.
Reading about the original library, I'm impressed. Can you add some
examples to your darcs repository showing
All,
project doesn't easily let me add a few columns to an existing query
(or take a few columns away). Instead, each use of project requires me
to build the entire list of columns I'd like to pass on by hand.
Before I go further, if there is a way to do that, please let me know.
An example of
My apologies for the cryptic email below - I meant it for the
haskell-db users list. And now I have to apologize for this spam too.
Should I send yet another email? ;)
Justin
-- Forwarded message --
From: Justin Bailey [EMAIL PROTECTED]
Date: Jan 30, 2008 10:00 AM
Subject
-- Forwarded message --
From: Igal Koshevoy [EMAIL PROTECTED]
Date: Feb 8, 2008 12:01 PM
Subject: [pdxfunc] pdxfunc meeting: Monday, February 11, 7pm, CubeSpace
To: Igal Koshevoy [EMAIL PROTECTED]
Join us at the next meeting of pdxfunc, the Portland Functional
Programming Study
On Feb 9, 2008 2:12 AM, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
I'd like to build a database model with winHugs that allows
a recursive relation. For example a single instance of
entity components is related with at least another row of
the entity components (1 to many relationship). How
That looks really cool and I'd like to try it out. Can you provide
links to these packages?
gtk =0.9.12,
glib =0.9.12,
sourceview =0.9.12,
binary =0.4.1
I just don't have time to track them down myself ...
Justin
___
Haskell-Cafe mailing list
On Feb 19, 2008 8:04 AM, Peter Verswyvelen [EMAIL PROTECTED] wrote:
Actually, if you look at the way OO programmers design code, they usually
choose long descriptive names, like FindElementByName. Most Haskell people
seem more math oriented and use very short names, like fst and snd (which
2008/2/20 Jeff φ [EMAIL PROTECTED]:
I'd love to find a good article that describes the ins and outs of multi
parameter types, functional dependencies, and type assertions, in enough
detail to resolve these surprises. A step-by-step walk through showing how
the compiler resolve a type and
I don't know about hsql, but I have some patches that add parametes to
haskelldb. I'd be glad to send them along but I couldn't offer much
support.
2008/2/24 Roman Cheplyaka [EMAIL PROTECTED]:
Is there an ability to use placeholders in SQL statement using hsql?
(Actually I'm interested in
Adding pseudo columns to a projection is cumbersome, to say the list.
For example, to add a field named hidden to a query I have to write:
data Hide = Hide
instance FieldTag Hide where
fieldName _ = hide
hideField = mkAttr Hide
I wrote a little Template haskell that reduces this to:
On Wed, Feb 27, 2008 at 1:37 PM, Hitesh Jasani [EMAIL PROTECTED] wrote:
Sparklines are small, word sized graphs that can be interspersed with
text to provide context and enhance communication. There are
implementations in many languages and even some web services that will
generate them on
I'm interested in seeing what kind of assembler my functions turn
into. Is there a means of annotating assembler output, similar to the
{#- CORE -#} pragma? Is there a trickier way of doing it?
Justin
___
Haskell-Cafe mailing list
On Mon, Mar 3, 2008 at 5:41 PM, Ben Lippmeier [EMAIL PROTECTED] wrote:
Hi Justin.
try: ghc -c file -ddump-to-file -ddump-asm
Thanks, that does it. I also tried the -keep-s-files (possibly new to
6.8) and found it produces the same output.
Justin
2008/3/4, Dimitry Golubovsky [EMAIL PROTECTED]:
Hi,
I finally got the Yhc Web Service (web-based front end to the
compiler) running in public testing mode. There hasn't been any
documentation written, and Haddock stuff not brought in order, but if
anyone wants to just get a
Way off topic, but this is the cafe. The below is well worth reading.
http://changelog.complete.org/posts/698-If-Version-Control-Systems-were-Airlines.html
For the click-impaired, here's Darcs Airlines:
Darcs Airlines: Unlike every other airline, this one uses physicists
instead of
The Portland Functional Programming group is meeting again this
Monday, March 10, at 7 p.m. Join us!
-- Forwarded message --
From: Igal Koshevoy [EMAIL PROTECTED]
Date: Fri, Mar 7, 2008 at 11:26 AM
Subject: [pdxfunc] pdxfunc meeting: Monday, March 10, 7pm, CubeSpace
To: Igal
On Wed, Mar 12, 2008 at 12:12 PM, Krzysztof Kościuszkiewicz
[EMAIL PROTECTED] wrote:
I have tried both Poly.StateLazy and Poly.State and they work quite well
- at least the space leak is eliminated. Now evaluation of the parser
state blows the stack...
The code is at
On Thu, Mar 13, 2008 at 4:50 PM, Krzysztof Kościuszkiewicz
[EMAIL PROTECTED] wrote:
Retainers are thunks or objects on stack that keep references to
live objects. All retainers of an object are called the object's
retainer set. Now when one makes a profiling run, say with ./jobname
+RTS
2008/3/15 Greg Meredith [EMAIL PROTECTED]:
All,
The following Haskell code gives a 2-level type analysis of a
functorial approach to introducing naming and name management into a
given (recursive) data type. The analysis is performed by means of an
What's the upshot of this? That is, what
On Sun, Mar 16, 2008 at 10:21 AM, Adam Smyczek [EMAIL PROTECTED] wrote:
Somehow I cannot get cookies from the Response
using Network.Browser module (HTTP 3001.0.4).
The cookie header part seams to be empty and
getCookies returns empty list as well.
Network.Browser comes with a built-in
From a recent interview[1] with the guy leading Ruby development on
.NET at Microsoft:
You spend less time writing software than you spend maintaining
software. Optimizing for writing software versus maintaining software
is probably the wrong thing to do. Static typing makes it harder to
On Wed, Mar 19, 2008 at 10:55 AM, Marc Mertens [EMAIL PROTECTED] wrote:
Hello,
I'm trying to learn to use HaskellDb. I have managed to finally compile
and
install it on my linux box (I have ghc 6.8.2). But when I try to create a
database description (as described in
1 - 100 of 167 matches
Mail list logo
