+1 - does anyone know the answer to this?
On Jul 27, 2011 2:04 PM, Chris Smith cdsm...@gmail.com wrote:
On Wed, 2011-07-27 at 07:20 -0400, Jack Henahan wrote:
Bundling things with the HP is just going to bloat that download
and confuse new users more (and my god, the dep-chasing... the
number
,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
(availability of the $5 XCode in App Store, for example).
Thanks for your time,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with Apple's constant upgrade
requirements, registration requirements, etc., and it seems like a
small function that XCode actually performs in the Haskell development
toolchain.
Again, I'm ignorant of the details and I'm sorry if this is ranty, but
I'd love to hear your reactions.
Thanks!
Tom
is basically orthogonal to the
needs of Haskell developers.
Thanks for your time,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to an output
signal. If you want to learn more about sequential monte carlo, there
are lots of videos on videolectures.net. Nando de Freitas has a good
introduction.
Tom
On Sat, Jul 23, 2011 at 2:30 AM, bob zhang bobzhang1...@gmail.com wrote:
Hi all,
I am doing a survey on combining Functional Reactive
Is anyone using Cloud Haskell yet? I'm really excited by the possibilities.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
As described in Towards Haskell in the Cloud:
http://research.microsoft.com/en-us/um/people/simonpj/papers/parallel/
Tom
On Jul 22, 2011 11:01 AM, Antoine Latter aslat...@gmail.com wrote:
On Fri, Jul 22, 2011 at 8:25 AM, Tom Murphy amin...@gmail.com wrote:
Is anyone using Cloud Haskell yet? I'm
$ handleErrors $ (output . renderHtml) ourTable
ourTable = body simpleTable [cellpadding 30, cellspacing 10, border
2, bordercolor gray] [bgcolor aqua, align right, align bottom]
ourTable'
ourTable' = map (map lineToHtml) [[J\nJ\nJay nbsp y, Jay, Jay],
[Leno, -Z, Dilla]]
Tom
On Jul 17, 2011 3
] ourTable'
ourTable' = map (map lineToHtml) [[Jay, Jay, Jay], [Leno,
-Z, Dilla]]
ourStyle = style (stringToHtml body { font-size: 50px }) ! [thetype
text/css]
On 7/17/11, Tom Murphy amin...@gmail.com wrote:
Here's the description of simpleTable:
http://hackage.haskell.org/packages/archive/xhtml
Oh! I have a good, small (single-purpose; reusable), useful one!
A text field which tab-completes words or phrases from a dictionary.
Haskeline provides useful (non-FRP) for implementing this, but it
seems like FRP could handle this in an interesting way.
Tom
On 7/10/11, Heinrich Apfelmus
Hi,
I've found good explanations of the HaskellDB combinators, but I
can't find good information about how to correctly define the database
layout. Can anyone point me to a resource, or give a quick example?
Thanks!
Tom
___
Haskell-Cafe mailing
Seconded. This would have been very useful to me many times.
I tried forwarding this to cabal-de...@haskell.org (Cabal development
discussion), but it's a members-only list. Can someone in the in-crowd
pass along the suggestion?
Thanks,
Tom
On 7/9/11, Andrew Pennebaker andrew.penneba
On 6/28/11, Jason Dagit dag...@gmail.com wrote:
I'd try asking on StackOverflow. I think the people who know the
answer might be watching there instead of here.
Really? I had thought that everyone who was on SO was on here also.
Tom
___
Haskell
That is so cool! Thank you.
To anyone who's interested: Try it. It's enlightening.
Tom
On 6/26/11, Don Stewart don...@gmail.com wrote:
Yes, via the -hpc tracing mechanism.
When executed HPC generates a highlighted log of your source, and
expressions that aren't evaluated will be marked up
Hi All,
Is there a way to determine whether a thunk was evaluated during
code's execution?
Thanks,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
an instance of a typeclass like that?)
Thanks for your time,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 6/19/11, Arlen Cuss cel...@sairyx.org wrote:
In no particular order, the following seem to have good Linux support:
Gentoo, Arch, Fedora and Debian (I think Testing).
Please allow me to register my amusement at the idea of a distribution
with good Linux support. :D
I was very surprised
On 6/18/11, Alexander Solla alex.so...@gmail.com wrote:
Since the iPhone OS is pretty much OS X for ARM, and GHC apparently now
supports cross-compilation, you can compile GHC for iOS.
Can you provide a link for info? I don't understand how this would be done.
Thanks
Tom
Hi List,
If my choice of Lunix distro depended 100% on its solidness as a
Haskell devel platform (I am), what would you all recommend?
Thanks for your time,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
in future releases).
What is the way to indicate actual code stability? Some packages on
Hackage definitely have broken parts.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
for complex mesh generation. (Thanks Corey, for pointing me to
OpenCSG.)
Here is a screenshot of OpenSCAD rendering a Mecha solid:
http://tomahawkins.org/index.html#Mecha
Here is the Mecha source:
https://github.com/tomahawkins/mecha/blob/master/Language/Mecha/Examples/CSG.hs
-Tom
[1
On Sun, Jun 5, 2011 at 10:41 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On 04/06/2011 08:25 PM, Tom Hawkins wrote:
What is the easiest way to generate polygon meshes from constructive
solid geometry? Marching cubes [4] seems pretty involved.
As I understand it, this is a Very Hard
.
What is the easiest way to generate polygon meshes from constructive
solid geometry? Marching cubes [4] seems pretty involved.
-Tom
[1] http://hackage.haskell.org/package/mecha
[2] https://github.com/tomahawkins/mecha
[3] http://tomahawkins.org/
[4] http://en.wikipedia.org/wiki/Marching_cubes
How about this:
myFoldr :: (a - b - b) - b - [a] - b
myFoldr f z xs = foldl' (\s x v - s (x `f` v)) id xs $ z
Cheers,
Ivan
Great! Now I really can say Come on! It's fun! I can write foldr with foldl!
___
Haskell-Cafe mailing list
the archive:
http://erlang.org/pipermail/erlang-questions/2011-May/058769.html
Food for thought...
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
when we start
to get lots of questions from Java programmers? :)
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
software for
end-users (i.e. people who'll be thrown off by gtk widgets or x11
windows)*, then it would be a very good idea to focus our energies on
one or two promising pre-existing libraries, and hammer them into
completion. A roadmap for this could be worked on at Hac Phi?
Just my 2¢,
Tom
people are showing interest in FP is because of
purity, and therefore its potential speed on multicore machines. If we
just generate to JS, this is also lost. In fact, speed on single-core
machines is lost also.
Again, my 2¢,
Tom
___
Haskell-Cafe mailing
in. Time to get on board!
Count me as onboard; I'm just not sure which ship I'm on yet.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
do wish somebody had a free week to concentrate on
the issue. Maintainer Jeremy made some progress on it, the last time I
checked...
Do you have the link for the progress so far?
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
solutions. I wasn't implying you were
saying we should only use Haskell for JS. Most useful Haskell apps
right now are pretty GUI-free!
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with native look-and-feel like Wx?
Thanks,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to everything on Hackage?
Thanks for clarifying,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. Enumera*tor** *feeds Itera*tee* -- subject, verb,
object. Producer/Consumer connotes the same by allusion to the
producer-consumer pattern of thread synchronization.
Tom
On Fri, May 6, 2011 at 9:47 AM, dm-list-haskell-c...@scs.stanford.eduwrote:
This is a question I struggled a lot with. I
$ fromChunks [a,bc]
When I run the above, I get:
True
True
Given that pattern matching is based on data constructors, how is it
possible that (Chunk abc Empty) and (Chunk a (Chunk bc Empty)) match
the same pattern?
Tom
___
Haskell-Cafe mailing list
Haskell
, ImProve can now generate models in Simulink and Modelica.
-Tom
[1] http://github.com/tomahawkins/improve/wiki/ImProve
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
language for automotive and
aerospace control systems.
-Tom
[1] http://hackage.haskell.org/package/improve
[2] http://www.mathworks.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Why can they assess the risk and the probable benefits of trying out
another innovation and can contain the risk? Because they can do that of
almost anything. They are surviving investors. Trying out another innovation
is just another investment, not unlike trying out another stock, another
+x you don't really mean it; you
mean something like liftM2(+) xdist xdist in a probability monad. Had
I changed x+y to x+x, I would obviously have gotten identical
variances. So maybe referential transparency is not lost after all.
Tom
___
Haskell-Cafe
I'm writing the parser for a Haskell-like language in Parsec
https://github.com/glutamate/baysig/blob/master/Baysig/Syntax/Parser.hs
The hand-written lexer and layout resolution code is in the same
directory. It has do-notation and custom infix declarations.
Tom
On Sun, Mar 20, 2011 at 5:25 AM
not going down this route this because probabilistic data
analysis gives you the correct error estimate without propagating
error terms.
Tom
PS if you're a scientist and your accuracy estimate is on the same
order as your rounding error, your are doing pretty well :-) At least
in my field...
On Sun
the mean and standard deviation of xs? that's every bit
as correct as propagating the uncertainty of f, except for the finite
number of samples. (assuming your original uncertainties are gaussian)
Tom
On Sun, Mar 20, 2011 at 11:59 PM, Edward Amsden eca7...@cs.rit.edu wrote:
I'm actually a CS undergrad
tokenized some sourcecode which contains comments,
these should be ignored except when they are located above a function, in
which case I want them to parse.
Any ideas about this issue are greatly appreciated!
Thanks,
Tom
___
Haskell-Cafe mailing list
I am curious -- how easy is it to use theoremquest for playing with
equational theories?
Let me turn the question around: How easy is it to play with
equational theories in HOL Light? Because this is the planed basis
for TheoremQuest.
-Tom
That two-pass lexer sounds like a good idea. I actually want to keep the
happy parser if possible, can you elaborate on adding extra error handling
cases for production rules? Do you mean I have to add a line for comments on
possible places where they can occur?
Thanks
Alright thanks for your comprehensive answer! I think I got something to
work with :)
Cheers,
Tom
On Tue, Mar 8, 2011 at 8:09 PM, Stephen Tetley stephen.tet...@gmail.comwrote:
Hi Tom
Here's how I'd do comment annotation in the Parser:
type Comment = String
type Identifier = String
theorem proving?
-Tom
[1] http://theoremquest.org
[2] http://www.cl.cam.ac.uk/~jrh13/hol-light/
[3] http://hackage.haskell.org/package/theoremquest
[4] http://hackage.haskell.org/package/theoremquest-client
[5] http://github.com/tomahawkins/theoremquest
I find this fairly interesting. Once you're finished grappling with the
logical core, I wouldn't mind helping out with a web interface, time
permitting. I suspect attracting mass appeal, or getting users at all, is
helped massively by having a web interface.
Thanks for your interest. Yes, a
. Then these reductions
would be perform automatically. The greater the ability of the search
to bridge the gap between dissimilar conclusions and assumptions, the
greater the automation.
Thanks for your interest. Let me know if you have any suggestions or guidance.
-Tom
Blue) 4
But I hope you read my last email in the other thread you started...
Tom
On Thu, Feb 3, 2011 at 10:15 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 3 February 2011 21:09, Patrick Browne patrick.bro...@dit.ie wrote:
Hi,
I am studying type classes using examples from
), somewhat crisper.
Tom
On Sun, Jan 30, 2011 at 10:27 AM, Patrick Browne patrick.bro...@dit.ie wrote:
On 29/01/2011 20:56, Henning Thielemann wrote:
Is there a reason why you use an individual type for every unit?
The existing implementations of typed physical units only encode the
physical
?
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I think you have to do it yourself. lhs2TeX isn't that clever - it
doesn't really know haskell syntax, it just applies some very simple
transformation rules.
e.g. change
runE :: Monad m = Enumerator e s m - m r - (e - m r) - (s -
Enumerator e s m - m r) - m r
to
runE :: Monad m = Enumerator e
On Mon, Dec 13, 2010 at 9:30 PM, Brent Yorgey byor...@seas.upenn.eduwrote:
Hi all,
Today I wanted this function
strongLocal :: (MonadReader r1 m1, MonadReader r2 m2) =
(r2 - r1) - m1 a - m2 a
Of course, after staring at this type for ten seconds I realized that
it cannot
.
-Tom
[1] http://hackage.haskell.org/package/improve
[2]
http://groups.google.com/group/fp-embedded/browse_thread/thread/63cd023e8f17b613?hl=en
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
pointless, but there are plenty of people who
got tenure that way... There's tons of this stuff in Artificial Life
and a book with that title by Stephen Levy which make many grand
claims.
Tom
On Thu, Dec 9, 2010 at 2:09 PM, Ketil Malde ke...@malde.org wrote:
In order to simulate nature, you need
Have you read: Fontana Buss : What would be conserved if 'the tape
were played twice'? in PNAS? It's quite fun - they model chemical
reaction as alpha-reduction in the lambda calculus and look at
evolution.
Tom
On Thu, Dec 9, 2010 at 10:15 PM, Ketil Malde ke...@malde.org wrote:
Michael Lesniak
is essentially Haskell 98 for the JVM.
There would still be a porting exercise, because CAL has less syntactic sugar
and fewer libraries (and doesn't have the GHC extensions you may use), but it
has good (though verbose) Java interoperability.
Tom
, providing a Haskell interface to CIL.
-Tom
[1] http://cil.sourceforge.net/
[2] http://hackage.haskell.org/package/cil
[3] http://github.com/tomahawkins/cil
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
On 05/11/2010, at 4:11 PM, Luke Palmer wrote:
Also they don't
scale well, which I guess means that they don't make it inconvenient
to design badly.
And they don't communicate enough information about the
preconditions/postconditions of their functions to easily allow large programs
to
`ilasm`, can create a .exe file which
can be run by Mono or .NET.
The package is not finished, it only supports a subset of the full
language, but it's already usable. For more information, as well as an
example to quickly get started, see the github page [3].
Cheers,
Tom Lokhorst
[1]: http
codecs, I thought it was science
fiction based on the description :-).
What I find amazing is RaptorQ fountain codes can complete the
decoding after receiving only 1% more symbols than the original
message.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe
.
Which language is that? ImProve?
No. It would be something STMish, similar to Atom.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
?
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of packets needed to
decode a message.
-Tom
[1] http://hackage.haskell.org/package/fountain
[2] http://en.wikipedia.org/wiki/Fountain_code
[3] http://en.wikipedia.org/wiki/Binary_erasure_channel
[4] http://en.wikipedia.org/wiki/LT_codes
___
Haskell
type. And during your evaluation of
Core, you would simply ignore fakeRun.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
transformation. It uses information about the shape of
the data type to create a more optimal worker function.
Sum types aren't explored in depth in the paper, and I haven't done so
yet either in my work on UHC, but my hope is that those can also be
optimized using the typed representation.
- Tom Lokhorst
Hi,
Are there any plans to extent the current Data.Judy package to include
bindings to JudySL and JudyHS? There's a standalone binding to JudySL by
Andrew Choi that is usable but it would of course be better to have the
functionality in the Data.Judy package proper.
Thanks
Tom
:
cabal.exe: failed to parse output of 'ghc-pkg dump'
ghc-pkg dump --global appears to run just fine.
Ideas? Suggestions?
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Classic pilot error. I had an old cabal.exe on the search path.
-Tom
On Tue, Oct 5, 2010 at 8:09 PM, Tom Hawkins tomahawk...@gmail.com wrote:
I'm having trouble installing Haskell Platform on Windows. After the
install, I run cabal update, which appears to work: 00-index.tar.gz
is deposited
similar semantics to STM. If Atom were to relax it's
rule atomicity in this fashion, it could open the door to improved
task scheduling and higher levels of program description. Has STM
research already gone down this path?
-Tom
[1] http://hackage.haskell.org/package/atom
. In the embedded domain, this could be a fault monitor that
reads a bunch of constantly changing sensors.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Sep 28, 2010 at 6:44 PM, Serguey Zefirov sergu...@gmail.com wrote:
2010/9/29 Tom Hawkins tomahawk...@gmail.com:
In the embedded domain, this could be a fault monitor that
reads a bunch of constantly changing sensors.
I think that sensor reading belongs to IO, not STM.
Sensors would
to the values
related to IO.
What are my options?
Thanks.
-Tom
[1] Lack of observable sharing; function definitions, case
expressions, ADTs disappear at compile time; etc.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
, then run the program to generate code. This is not
what I want. Rather, I am looking for advice on how to splice GHC --
or another implementation -- where I can build a compiler starting
from a type checked, simplified Haskell AST; or better yet, an
unevaluated call graph.
-Tom
a b
tree :: (Eq a, Ord a) = (b - [a]) - [b] - [Tree a b]
Note, type 'a' is some sort of label, most often a string, and type
'b' form the leaves of the tree. The function passed into 'tree'
returns the hierarchical path of a leaf object.
-Tom
[1]
http://hackage.haskell.org/packages/archive
://hackage.haskell.org/package/copilot
* Others?
ImProve http://hackage.haskell.org/package/improve
We are using ImProve for some safety critical code on a hydraulic
hybrid shuttle bus.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
On 20/09/2010, at 6:36 AM, Johannes Waldmann waldm...@imn.htwk-leipzig.de
wrote:
from time to time request for Haskell running on top of Java's VM pops
on the haskell related mailing list and then usually dies off when
someone mentions that JDK does not have proper support for tail-calls.
I use CAL for various hobby projects, and despite development being quiet I
find it robust. I suspect that the lack of extensions over Haskell 98 puts some
people off.
Tom
On 10/09/2010, at 5:31 AM, Karel Gardas karel.gar...@centrum.cz wrote:
Hello,
as this is really friendly forum, I'd
question: The Kvaser canlib library has a different name
depending on if the machine is Linux or Windows. What is the best way
to configure the build based on the platform? Current I have the
library name hard coded in the extra-libraries field in the cabal
file.
-Tom
http://hackage.haskell.org
_ _) VNil
but of course VNil and VCons can never have the same type.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
has open-sourced their experimental CCN protocol, CCNx [3]. I
thought it'd be cool to have a Haskell implementation of CCNx, so I
started a little hackage project [4].
-Tom
[1] http://video.google.com/videoplay?docid=-6972678839686672840#
[2] http://www.parc.com/work/focus-area/networking/
[3] http
I agree, Data.Text is great. Unfortunately, its internal use of UTF-16
makes it inefficient for many purposes.
In the first iteration of the Text package, UTF-16 was chosen because
it had a nice balance of arithmetic overhead and space. The
arithmetic for UTF-8 started to have serious
2010/8/17 Bulat Ziganshin bulat.zigans...@gmail.com:
Hello Tom,
snip
i don't understand what you mean. are you support all 2^20 codepoints
in Data.Text package?
Bulat,
Yes, its internal representation is UTF-16, which is capable of
encoding *any* valid Unicode codepoint.
-- Tom
ambiguities
arising from multiple, conflicting requirements. Due to the nature of
the conflict, it is highly unlikely that the defects would have been
identified with conventional testing.
-Tom
[1] http://hackage.haskell.org/package/improve
[2] http://yices.csl.sri.com
, questions, comments, and
feedback welcome.
-Tom
[1] http://hackage.haskell.org/package/improve
[2] http://yices.csl.sri.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
who's hiring.
Actually I'm very glad. Investment banking is the first industry to
adopt functional programming on a large scale. And others will
follow.)
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
On Mon, Aug 9, 2010 at 12:06 PM, Lennart Augustsson
lenn...@augustsson.net wrote:
But do you think there would be more Haskell jobs offered (in absolute
terms), if no investment firms offered jobs?
Is there some kind of quota of job offers that gets used up?
No and no. Again, I think it's
aptitude is
determined at birth.
Best of luck with the job hunt. If by chance Eaton starts hiring
again, I'll give you a ping.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 03/08/2010, at 10:09 PM, Ertugrul Soeylemez wrote:
Tom Davies tgdav...@gmail.com wrote:
I find it convenient sometimes to convert a Maybe value to an Either
thus (excuse the syntax, it's CAL, not Haskell):
maybeToEither :: a - Maybe b - Either a b;
maybeToEither errorValue = maybe
I find it convenient sometimes to convert a Maybe value to an Either thus
(excuse the syntax, it's CAL, not Haskell):
maybeToEither :: a - Maybe b - Either a b;
maybeToEither errorValue = maybe (Left errorValue) (\x - Right x);
but that seemingly obvious function isn't in Hoogle, AFAICT, so
On Mon, Jul 19, 2010 at 11:54 AM, Stephen Tetley
stephen.tet...@gmail.com wrote:
Hi Tom
This will the job for a UserHooks - probably preBuild? - see
Distribution.Simple.UserHooks.
postConf - Hook to run after configure command
preBuild - Hook to run before build command. Second arg
I have a script I'm using to generate some Haskell code for a library.
How do I specify this flow in the cabal setup file? Would someone
point me to a relevant library I can reference as an example?
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe
be
parsed.
Comments, bug reports, or suggestions for improvements welcome.
-Tom
[1] http://hackage.haskell.org/package/smt-lib
[2] http://goedel.cs.uiowa.edu/smtlib/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
According to the criterion.cabal file shipped with the latest (0.5.0.1)
version of criterion, the Chart package is broken under GHC 6.12:
flag Chart
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
, previous email sent prematurely!)
Tom
On 1 July 2010 10:16, Tom Doris tomdo...@gmail.com wrote:
According to the criterion.cabal file shipped with the latest (0.5.0.1)
version of criterion, the Chart package is broken under GHC 6.12:
flag Chart
Statechart [1] is a program that compiles Rhapsody [2] statechart
diagrams [3] into C. Rhapsody is a UML cough, choke, gag... tool
from IBM intended for embedded systems development. If you use
Rhapsody, and its code generator makes your eyes bleed, statechart may
provide some relief.
-Tom
[1
A little library for reading s-record files:
http://hackage.haskell.org/package/srec
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
in with my powerpc instruction set simulator [1].
-Tom
[1] http://hackage.haskell.org/package/powerpc
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
201 - 300 of 681 matches
Mail list logo
