to run down a
Prelude.read: No Parse error and I need to see the value that it is
failing to parse on.
Thanks.
Steve
On Tue, Aug 31, 2010 at 11:05 AM, Pepe Iborra pepeibo...@gmail.com wrote:
Hi Steve
The debugger only traces calls in interpreted code. Perhaps the call
to myMethod
Hi Steve
The debugger only traces calls in interpreted code. Perhaps the call
to myMethod is being made from object code?
Admittedly, the ghci debugger can take some effort to learn to use
properly. Make sure that you give a look to the ghc user guide if you
haven't done so yet.
Best,
pepe
On
(moving to the cafe)
There is an incompatibility between the version of iconv in Mac Os and
the one included in MacPorts.
As the RTS of the build of ghc in the Haskell Platform is linked
against Mac Os iconv, you cannot use it with the build of gtk2hs from
MacPorts.
This is a known issue already
On Fri, Jul 11, 2008 at 2:39 PM, John D. Ramsdell [EMAIL PROTECTED] wrote:
Are you aware of Term Rewriting and all That? It describes how to do
associative commutative unification; whether it satisfies your
'obviously correct' criterion I don't know.
Oh yes, I know about term rewriting. If
Actually, in 6.8 we can build isWHNF on top of the GHC-API.
First, you need to import the ghc package:
ghci -package ghc
GHCi, version 6.7: http://www.haskell.org/ghc/ :? for help
Then, you can define the isWHNF function as follows:
Prelude :m +RtClosureInspect
Prelude RtClosureInspect
Very cool. This is much nicer than when I asked much the same
question a few years back (and I can think of all sorts of
interesting things I can learn from the interface in that module).
But what about indirection chasing? Surely we want isWHNF to
return True if we have an indirection
On 13/09/2007, at 0:06, Don Stewart wrote:
ok:
In Monad.Reader 8, Conrad Parker shows how to solve the Instant
Insanity
puzzle in the Haskell type system. Along the way he
demonstrates very
clearly something that was implicit in Mark Jones' Type Classes with
Functional Dependencies paper
For a taste, see Instant Insanity transliterated in this functional
language:
http://hpaste.org/2689
I thought I'd better paste here the code for Instant Insanity with
Type Families. Otherwise it will vanish in a short time.
I took the opportunity to clean it up a bit.
Although AT are
I can give the following partial explanation.
When you run ghc test.hs it compiles your test file and produces
some auxiliar files at the same time.
When you run ghci afterwards, if the mod. date of the auxiliar files
is more recent than that of the source file, it directly loads the
There is a related discussion, with a lot of pointers, in a recent
D.Piponi blog post:
http://sigfpe.blogspot.com/2007/04/homeland-security-threat-level-
monad.html
On 25/06/2007, at 10:58, peterv wrote:
I'm baffled. So using the Arrow abstraction (which I don't know
yet) would
solve
Thanks for the report. That was an error I introduced in a previous
patch, just pushed the fix.
By the way, there is a Shim mailing list at
http://shim.haskellco.de
Cheers
pepe
On 11/06/2007, at 9:22, Johan Grönqvist wrote:
Hi,
I am trying to install shim
MacPorts works fine here, and the maintainer, Gregory Wright, is very
supportive.
If it works for you, I really recommend MacPorts. The only downside
are the lengthy compile times, but this is not a big deal, you can
just leave it installing overnight.
Carbon Emacs flavour here instead of
On 13/05/2007, at 12:44, Neil Mitchell wrote:
Hi
Thanks for all the responses, I'm busy reading through them.
I'm still trying to decide whether I should use them or not. They
complicate things, are less intuitive than names. But on the other
hand, the language I'm working in is untyped and
On 16/04/2007, at 12:30, Mitar wrote:
Hi!
On 4/16/07, Bertram Felgenhauer
[EMAIL PROTECTED] wrote:
Since all the threads block on a single MVar how do they run in
parallel?
The idea is that before the threads block on the MVar, they run their
action x to completion.
The rendering
input2 =
[ InputDecs [ inp emaLength TyNumber (20 + 40) ] ]
(untested). Imho the simple, dumb, best fix for this is to give a
explicit type to those values.
input2 = [ InputDecs [ inp emaLength TyNumber ((20::Integer) +
(40::Integer)) ] ]
This is just one way to fix it. You
On 02/04/2007, at 16:26, Daniel Brownridge wrote:
Hello.
I am a Computer Science student attempting to write an emulator
using Haskell.
One of my main design choices is how to deal with machine code.
Clearly it is possible to represent 0's and 1's as ASCII
characters, however it strikes
On 13/03/2007, at 17:46, Jefferson Heard wrote:
Simon will probably chime in on it as well, but his paper on the
subject is
the best there is:
http://research.microsoft.com/~simonpj/Papers/strategies.ps.gz
It does work in GHC 6.6 very nicely.
You can try it with the following naive fib
(moreover, I can see, that
googling over haskell.org is not sufficient ;-) ).
Regards,
Dusan
Pepe Iborra wrote:
On 13/03/2007, at 17:46, Jefferson Heard wrote:
Simon will probably chime in on it as well, but his paper on the
subject is
the best there is:
http://research.microsoft.com
Did anyone with knowledge of Associated Types pursue this solution?
Where did you get this from. My haskell-cafe mail folder doesn't seem
to have the thread you are replying to.
Sorry I replied from gmane; I should have included a link to the
original thread, but I really expected gmane
I am really curious about this style of programming, and find myself
playing with it from time to time.
The example so far is very nice, but the funniest part is missing.
That is, defining appendL.
appendL :: List a t1 - List a t2 - List a t3
This says that the append of a list of length
David Roundy droundy at darcs.net writes:
My latest attemp (which won't compile with the HEAD ghc that I just compiled,
probably because I haven't figured out the synatax for guards with indexed
types is:
class WitnessMonad m where
type W m :: * - * - *
(=) :: (WitnessMonad m',
There is also an excellent paper in tutorial style which imho is very
useful to understand the interaction of lazyness with the
Control.Parallel.Strategies combinators:
Algorithm + Strategy = Parallelism
Philip W. Trinder, Kevin Hammond, Hans-Wolfgang Loidl, and Simon L.
Peyton Jones.
hi Dominic
Explicit recursion works just fine for me and keeps things simple:
pad :: [Word8] - [Word8]
pad xs = pad' xs 0
pad' (x:xs) l = x : pad' xs (succ l)
pad' [] l = [0x80] ++ ps ++ lb
where
pl = (64-(l+9)) `mod` 64
ps = replicate pl 0x00
lb = i2osp 8 (8*l)
at the
Hi J Garrett,
I don't see any problem in GHC 6.6. with:
runTest c = runST (runErrorT c)
*Main runTest (return True)
Loading package mtl-1.0 ... linking ... done.
Right True
*Main
On the other hand, I try to define it firstly as below and got the
following error.
runTest = runST .
Wait, there are two monads in scene here, IO and Maybe.
The right solution is to compose them indeed. One could use the
MaybeT monad transformer defined in the 'All about monads' tutorial
[1], or we could just define the IOmaybe monad:
import Data.Traversable (mapM)
newtype IOMaybe a =
On 12/12/2006, at 20:31, Alec Berryman wrote:
Greg Fitzgerald on 2006-12-12 11:24:58 -0800:
I'd like to be able to reorganize my code and then verify that I
didn't
change any functionality. That is, the old and new code have
precisely the
same meaning.
Also, I'd like to be able to
On 30/11/2006, at 17:04, Spencer Janssen wrote:
I believe you're talking about the `pl' plugin for lambdabot.
Lambdabot has an offline mode, visit the homepage for the source:
http://www.cse.unsw.edu.au/~dons/lambdabot.html
There is also a web interface to lambdabot, but I can't
On 28/11/2006, at 12:25, Krasimir Angelov wrote:
On 11/28/06, Johannes Waldmann [EMAIL PROTECTED] wrote:
seriously, how hard would it be to adapt VH to Eclipse?
the interfaces (for syntax highlighting, typechecking etc.)
should be similar - in theory.
Parsing and typechecking in VH is all
advise you to stick to Debug.Trace and friends.
Cheers
pepe
On 13/11/2006, at 17:29, Valentin Gjorgjioski wrote:
On 13.11.2006 16:54 Valentin Gjorgjioski wrote:
On 13.11.2006 16:48 Pepe Iborra wrote:
Hi Valentin
Please, take a look at the Haskell Wiki page for debugging.
http://haskell.org
hi Sebastian
I think that it would be more appropriate to use english when you
post to this particular list.
On non linear equations or jacobi, I'm sorry but I cannot help you.
But hopefully someone else in this list may be able to.
Saludos.
Cheers.
pepe.
On 09/11/2006, at 4:52, Sebastian
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
On 07/09/2006, at 10:53, Tamas K Papp wrote:
Dear Pepe,
Thank you for the information. I finally ended up working with
Debug.Trace, and found the bug very quickly. I also tried Hood, but
couldn't load it in ghci: import Observe can't find the library, but
% locate Observe
Hi Tamas
There are several ways to debug a Haskell program.
The most advanced ones are based in offline analysis of traces, I
think Hat [1] is the most up-to-date tool for this. There is a Windows
port of Hat at [5].
Another approach is to simply use Debug.Trace. A more powerful
alternative
Thanks for the suggestion Don,
I started the wiki page at http://haskell.org/haskellwiki/Debugging
On 06/09/06, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
mnislaih:
Hi Tamas
There are several ways to debug a Haskell program.
The most advanced ones are based in offline analysis of
On 06/09/2006, at 17:10, Andrae Muys wrote:On 06/09/2006, at 8:22 PM, Neil Mitchell wrote:It's been my experience that debugging is a serious weakness ofHaskell - where even the poor mans printf debugging changes thesemantics! And everyone comes up with arguments why there is no needto debug a
1) Lack of debugging support. Yes there are print statements and trace,
but I would like to set a breakpoint. It would be nice to do so and
launch the GHCi interpreter with all the variable context supported. A
google search revealed that there is current work on this, but
unfortunately the
Bulat, now that Krasimir has resumed work on Visual Haskell, I have
planned to pursue an integration of the ghc-api debugger with Visual
Haskell as soon as possible.
But as we get closer to having dynamic breakpoints working 100%, the
plain ghci debugging support starts to look as a fairly nice
http://code.google.com/soc/
This is not news. SoC was presented a few days ago, and by now there are a
lot of projects available, yet none(?) Haskell related :(
This is a plea for Haskell FOSS project managers to apply as mentor
organizations, so that we students can have a choice.
Surely there
Graham Klyne [EMAIL PROTECTED] escribió en el mensaje
news:[EMAIL PROTECTED]
One of the features of Haskell that I like is that it doesn't require lots
of
IDE support to write complex programs... the compact syntax and clean
separation
of concerns that can be achieved make it iasy enough
39 matches
Mail list logo
