Hi,
I have some problems getting profiling to work with a ghc-6.4 that I
compiled from source. Everything seems to work all right, but the
output doesn't contain any times; in time profiling (+RTS -p) times are
all zeros, with heap profiling, I never get any 'samples' output, just
an empty one.
On Thu, Apr 21, 2005 at 01:26:29AM +0200, Antonio Regidor Garca wrote:
Very interesting! What license uses jhc? The COPYING file seems to be empty.
It is under the GPL.
For some reason the darcs.cgi browser isn't displaying it, but if you
look in the repo directly it is there.
Some parts are
As usual a beginner in Haskell. Trying to write a simple program in haskel
shown below
main :: IO()
main =catch (do
hexFile - readFile file
putStr What is the key number (0 or 1)?\n
keyno - getLine
putStr Input key.\n
key - getLine
newLine - outputLine keyno key (lines(hexFile))
bla
On Apr 20, 2005, at 10:04 PM, Alexandre Weffort Thenorio wrote:
As usual a beginner in Haskell. Trying to write a simple program in
haskel
shown below
outputLine keyno key orgFile = do
part1 - getLeft keyno orgFile
part2 - getRight keyno orgFile
total - part1 ++ (strUpper key) ++
And while I'm posting to the list, I'll send something I wish I had
found earlier.
I had wanted to write show several things, and writing show 10 times
was not clever.
And so I initially created an infix operator to put between everything
to do the showing, which was not much better.
But
Im running GHC 6.4 on Windows XP
Professional. In GHCi, I try to load the following source file (also attached
as Bad.hs)
module Paper where
data Hash = Sha256 String
class HasHash
where hasHash :: HasHash - Hash
and I get the following panic.
___ ___ _
/ _ \ /\ /\/
Thanks, this is a known bug and will be fixed in
6.4.1.
Cheers,
Simon
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of John
DeTrevilleSent: 19 April 2005 22:31To:
glasgow-haskell-bugs@haskell.orgSubject: Panic in GHC
6.4
Im running GHC 6.4 on
Windows XP Professional.
Bugs item #1186741, was opened at 2005-04-20 15:17
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1186741group_id=8032
Category: Compiler
Group: 6.2.2
Status: Open
Resolution:
Bugs item #1186853, was opened at 2005-04-20 15:10
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1186853group_id=8032
Category: Compiler
Group: 6.4
Status: Open
Resolution: None
Yeah, you probably want the main parser to be many beParser and not
just beParser:
-- main parser function
parseBencoded :: String - Maybe [Bencode]
parseBencode str = case parse (many beParse) str of
Left err - Nothing
Right val -
I was bored so I ran it through ghci and fixed the small errors I
found, here's the working version, I don't really have much of test
data to play with, but it seems to be working with the small examples
I copy-n-pasted from the wiki and the bittorrent website:
import qualified Data.Map as Map
Thank you very much! I really appreciate your help!
I have to read a little bit more about Parsec to fully understand what
your code does, but it seems to be what I was looking for.
Regards,
Tommi
On Wed, Apr 20, 2005 at 08:58:41PM +0200, Sebastian Sylvan wrote:
I was bored so I ran it through
Hi,
Im currently working on a haskell constraint parser for polymorhpic data types
for a group of third year programmers, and was wondering if there was a help
resource, or board on the internet for haskell programmers to ask questions
about code they're working on. Any help or links would be
beDictionary is wrong, though. It will only find dictionaries with a
single entry.
This next parser should do the trick (again, untested!).
It basically reads a d and then a list of (key,value) pairs (which
is now a separate parser) and then an e, and then it returns a Map
String Bencode.
Should
On 4/20/05, Sebastian Sylvan [EMAIL PROTECTED] wrote:
-- parses an association list of the contents
-- of a dictionary
beDicContents :: Parser (String, Bencode)
beDicContents =
do (BEString key) - beString
val - beParse
return (String, Bencode)
bah, I should get some sleep :-)
Alexandre Weffort Thenorio [EMAIL PROTECTED] writes:
outputLine keyno key orgFile = do
part1 - getLeft keyno orgFile
part2 - getRight keyno orgFile
total - part1 ++ (strUpper key) ++ part2 ++ \n
newHexFile - openFileEx newfile (BinaryMode WriteMode)
hPutStrLn newHexFile
[I've asked this question on lambda-the-ultimate, but it remained unanswered,
and it's probably more appropriate here in any case]
The papers referenced here:
http://lambda-the-ultimate.org/node/view/552
describe a means of projecting values in an implementation
language to and from
Bernard Pope [EMAIL PROTECTED] writes:
I also meant to add that I think these solutions are not what Lloyd is
after, because they rely on recursive equations, which I believe was
avoided in Lloyd's SML code.
Those recursive equations are avoided in SML because SML is eager - y
f = f (y f)
18 matches
Mail list logo
