.
Any idea why that could be?
On Wed 13 Nov 2013 18:16:48 GMT, Michael D. Adams wrote:
ANNOUNCE: Haskell Pdf Presenter (hpdfp) 0.2.2
I'm pleased to announce the first public release of the Haskell Pdf
Presenter (hpdfp).
Project home page:
http://michaeldadams.org/projects/haskell-pdf
or implementation are most welcome.
Michael D. Adams
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
.
Michael D. Adams
mdmko...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. [| ... $( ... ) ... |] ) for expressing the
generated code. However, quotations and splices are tied to the Q
monad which means that as it is now I have to manually write LamE ...
VarP ... VarE ... etc. instead of using the much nicer quotation
syntax.
Michael D. Adams
mdmko...@gmail.com
. [| ... $( ... ) ... |] ) for expressing the
generated code. However, quotations and splices are tied to the Q
monad which means that as it is now I have to manually write LamE ...
VarP ... VarE ... etc. instead of using the much nicer quotation
syntax.
Michael D. Adams
mdmko...@gmail.com
hotel (at the conference rate)
with check-in on January 22 (the day before the first workshop) and
check-out on January 30 (the day after the last workshop).
Michael D. Adams
Ph.D. Student, Indiana University
___
Haskell-Cafe mailing list
Haskell-Cafe
I've found a roommate now. So I don't need any more replies. :-)
On Sun, Aug 29, 2010 at 11:45 PM, Michael D. Adams mdmko...@gmail.com wrote:
Hi all,
I'm a graduate student (male) and am looking for a (male) roommate to
split the cost of a hotel room at ICFP. If anyone is interested
hotel (at the conference rate)
with check-in on September 24 (the day before the first workshop) and
check-out on October 3 (the day after the last workshop).
Michael D. Adams
Ph.D. Student, Indiana University
___
Haskell-Cafe mailing list
Haskell-Cafe
? (e.g. the suffix of a cons list is always a list, but
getting suffix of an array requires allocating a whole new array.)
On Sat, Aug 21, 2010 at 5:00 PM, Evan Laforge qdun...@gmail.com wrote:
On Sat, Aug 21, 2010 at 6:52 PM, Michael D. Adams mdmko...@gmail.com wrote:
Could you be more specific about
you need the tail sharing property that
regular cons lists have?
Michael D. Adams
On Thu, Aug 19, 2010 at 9:22 PM, Evan Laforge qdun...@gmail.com wrote:
Is there a data type that's spine lazy like a list, but can be seeked
(sought?)
efficiently? IntMap and Sequence are spine strict so if you
to the
library or the documentation are most welcome and should be sent to me
at adamsmd-AT-cs-DOT-indiana-DOT-edu.
Michael D. Adams
Ph.D. Student
Indiana University
http://www.cs.indiana.edu/~adamsmd/
___
Haskell mailing list
Haskell@haskell.org
http
to the
library or the documentation are most welcome and should be sent to me
at adamsmd-AT-cs-DOT-indiana-DOT-edu.
Michael D. Adams
Ph.D. Student
Indiana University
http://www.cs.indiana.edu/~adamsmd/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
I've opened a ticket for this
(http://hackage.haskell.org/trac/ghc/ticket/3245), but someone else
will have to do the investigation into the problem.
Michael D. Adams
On Thu, May 14, 2009 at 10:59 AM, Simon Peyton-Jones
simo...@microsoft.com wrote:
Interesting. Would anyone care to make a Trac
(s a)). This is a bit of speculation and I don't have
hard evidence for that being the source of the problems, but tests
that I have run (not listed here) are strongly suggestive of appKey
being the culprit.
Michael D. Adams
mdmko...@gmail.com
{-# LANGUAGE ExistentialQuantification #-}
import
it in half as
many lines reduced the number of bugs by half). This is one area that
Haskell does well in.)
Michael D. Adams
mdmko...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
://portal.acm.org/citation.cfm?id=1178597.1178604). The current
implementation is C based (to get base-case performance) but we would
love to get that work ported to Haskell and a much more functional
setting.
Michael D. Adams
___
Haskell-Cafe mailing list
problem?
Michael D. Adams
mdmko...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
system I've seen. (I don't have a good link for learning cabal;
you'll have to google around (e.g. haskell cabal) for info.)
Michael D. Adams
[1] http://www.haskell.org/ghc/docs/latest/html/users_guide/hsc2hs.html
[2] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hpapi
general
solution because you have to worry about allocating memory to have
c_string_field point to.
I'll leave figuring out #{enum}, but it can also be quite helpful in
translating C enums/defines into Haskell.
Michael D. Adams
(*) For the lawyers: I hereby place that and these code snippet
for module Foo will be listed as several lines of the
form import Foo(x,y,z), etc. From there on it's just a bit of text
munging to get it into your export list code (about two lines of
perl).
Michael D. Adams
2008/11/16 Jason Dagit [EMAIL PROTECTED]:
On Sun, Nov 16, 2008 at 5:35 AM, Thomas
If you are using hsc2hs (if you are using Cabal this is easy; just
rename the file to *.hsc and Cabal will take care of the rest), then
there is a macro for making this easier and so you don't have to think
about it.
First, place the following at the top of your source file:
#let alignment t =
to correct some time in
the future.
It remains to be seen whether it would be worth while to unify these
two systems.
Bug reports as well as suggestions, feedback or contributions to the
API or the documentation most welcome.
Michael D. Adams
to correct some time in
the future.
It remains to be seen whether it would be worth while to unify these
two systems.
Bug reports as well as suggestions, feedback or contributions to the
API or the documentation most welcome.
Michael D. Adams
On Fri, Nov 7, 2008 at 3:46 AM, Lutz Donnerhacke [EMAIL PROTECTED] wrote:
* Michael D. Adams wrote:
But as far as I can tell, hsc2hs doesn't support bit
fields. On top of that I'm not sure I can make any safe assumptions
about what order the bit fields are packed (LSB or MSB first
are packed (LSB or MSB first).
Have others run into this problem before? What options are there for
working around it?
Michael D. Adams
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
25 matches
Mail list logo