history than you do.
Is it possible to make pqueue a full pSqueue implementation?
Not without rewriting the API and data structure...or, equivalently, just
starting from scratch.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Thu, Mar 28, 2013 at 10:20 PM
I don't remember the answer to either of your questions, I'm afraid --
queuelike was last updated in 2009 (!), and that's really the last time I
looked at it. That said, I'm not sure I follow how queuelike is a psqueue
at all as opposed to a pqueue?
Louis Wasserman
wasserman.lo...@gmail.com
http
Out of curiosity, do we know why the Language Shootout has
upgradedhttp://shootout.alioth.debian.org/u64q/program.php?test=spectralnormlang=ghcid=4to
GHC 7.4.1, but still isn't using -fllvm for e.g. the spectral-norm
benchmark? (It results in a nonnegligible speedup on my machine.)
Louis
) size, but its design reflects my willingness to
trade memory and code size for speed. ;)
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
(n). That threw
me off..)
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Tue, Feb 22, 2011 at 4:28 PM, Don Stewart d...@galois.com wrote:
bos:
On Sat, Feb 19, 2011 at 11:58 AM, Louis Wasserman
[1]wasserman.lo...@gmail.com wrote:
size
loc)
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Tue, Feb 22, 2011 at 8:45 PM, Johan Tibell johan.tib...@gmail.comwrote:
On Tue, Feb 22, 2011 at 6:28 PM, Louis Wasserman
wasserman.lo...@gmail.com wrote:
Apologies!
Accepted. :)
I was, in point
Hmmmkay. I'm not entirely convinced, 'cause I've seen genuine (and
benchmarked) speedups in applying some of these ideas to my TrieMap library,
but I don't have any examples handy.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Tue, Feb 22, 2011 at 9:10
A couple thoughts:
size takes O(n). That's just depressing. Really.
Do you think union, intersection, etc. could be supported?
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell
I'd like to complain about that, too ;)
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Sat, Feb 19, 2011 at 9:02 PM, Edward Kmett ekm...@gmail.com wrote:
On Sat, Feb 19, 2011 at 7:27 PM, Sterling Clover s.clo...@gmail.comwrote:
On Sat, Feb 19, 2011
What is the relationship between -XGenerics and -XTypeFamilies? Can I
automatically create a data family instance based on its generic
decomposition?
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe
the rankings
http://shootout.alioth.debian.org/u64q/program.php?test=threadringlang=ghcid=3.
Previously, it'd been doing most of its work on a single core, now it's
spread out. Any ideas for fixin' it? (I'm going to to try using forkOnIO.)
Louis Wasserman
wasserman.lo...@gmail.com
http
There are 4 sets of rankings so -
http://shootout.alioth.debian.org/u64/program.php?test=threadringlang=ghcid=3
Yes, but Haskell used to be doing much better specifically on the u64q,
which was why I was surprised.
___
Haskell-Cafe mailing list
Hmmm. Now that I've had a chance to rewatch the video, I am enlightened.
Nevertheless, I will confess that I wouldn't mind the idea of just doing an
external parallelism wrapper, running multiple sessions of GHC rather than
making GHC internally parallel. Hm.
Louis Wasserman
wasserman.lo
. As it stands, I'm going to submit a version which asks not to be
compiled with --threaded (and has a few other improvements).
http://shootout.alioth.debian.org/u64q/program.php?test=chameneosreduxlang=ghcid=3
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
What, if anything, stands in the way of parallelizing Cabal installs, make
-j style?
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
Heh, I'm interested in both, but I'm feeling like I needed a new project,
and I thought this might make a good one =)
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Thu, Jun 3, 2010 at 5:42 PM, Don Stewart d...@galois.com wrote:
chrisdone:
On 4 June
On a similar note, there was no parallelized implementation for
spectral-norm, even though Haskell had been doing rather well on the
single-core benchmark. Heh.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Tue, Jun 1, 2010 at 10:38 AM, Gwern Branwen
.
The code is at http://hpaste.org/fastcgi/hpaste.fcgi/view?id=25865; the
previous implementation is at
http://shootout.alioth.debian.org/u32/program.php?test=revcomplang=ghcid=2
.
Let the arguing begin?
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
distribution package --
and my implementation, with LLVM -O2. Benchmarking code is
herehttp://hpaste.org/fastcgi/hpaste.fcgi/view?id=25309#a25309
.)
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing
139
Segmentation fault
make[1]: ***
[libraries/dph/dph-base/dist-install/build/Data/Array/Parallel/Base/DTrace.o]
Error 139
make: *** [all] Error 2
I get segfaults. Segfaults make me unhappy. Halp plz?
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
to set up a darcs repo for FGL-Prime or something at
code.haskell.org, and start cracking? I'm really excited for this project.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe
, and I'm pretty
clueless.
Any suggestions?
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'd be really interested; I have a lot of improvements I'd personally like
to make.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
, the darcs
repo is http://code.haskell.org/containers-pqueue/
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Actually, with existential types and type equality constraints, GADTs
are redundant.
The algorithm is pretty simple:
- existentially quantify over all type variables mentioned in the GADT
constructor
- add a type equality constraint to match the result type
- (optional) simplify
While
-kinds includes a workaround to this bug, but if
the bug is fixed, it'll break again. Yuck, bugs.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Where is GHC 6.13 head? I can find sources of 6.13, and darcs for 6.12, but
not darcs for 6.13...I'm trying to play with the LLVM backend, and this is
the one question it seems to presuppose that you know the answer to. Heh.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com
a linear program
around this, just by working in the LPT Variable c UniqueM monad.
That's actually a nicer solution than my current implementation. I'll do
that, then...
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Mon, Mar 1, 2010 at 9:29 AM, Henning
features, like exporting/importing
from CPLEX LP files. I've kind of been overdoing the Haskell lately...)
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Sun, Feb 28, 2010 at 5:24 PM, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
Louis
outputs directly to stdout, but whose output I'd like to use...
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Okay, okay, I'm convinced that trying to mess with it in C is easier than in
Haskell. =P
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Fri, Feb 26, 2010 at 2:14 PM, Brandon S. Allbery KF8NH
allb...@ece.cmu.edu wrote:
On Feb 26, 2010, at 14:44
x2 ContVar
main = print = glpSolveVars mipDefaults lp
This requires GLPK to be installed, like below.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Wed, Feb 24, 2010 at 4:07 AM, Alberto Ruiz ar...@um.es wrote:
I have uploaded to hackage an interface
Is there a nice package out there somewhere with a linear programming
implementation? Preferably with a nicely functional interface?
Kthxbai,
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing
structures with similar asymptotic guarantees. (Observation: I'm
pretty sure that the Fibonacci heap is actually surprisingly functional.)
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
coordinates...
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Wed, Nov 4, 2009 at 4:38 AM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
Louis Wasserman wrote:
+1 on Control.Monad.Omega. In point of fact, your diagN function is
simply
diagN
.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
allowed for use in type signatures, with m becoming
simply an alias for pat. Thoughts?
I've added a ticket here http://hackage.haskell.org/trac/ghc/ticket/3545.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
The goal is similar, but I'm attempting to automatically infer the
appropriate map type for any algebraic datatype -- and while I'm at it, the
TrieMap package aims to include all the methods Data.Map offers.
Louis Wasserman
wasserman.lo...@gmail.com
2009/9/9 José Pedro Magalhães j...@cs.uu.nl
This is about the same as the other paper I linked to, I think, but I'm
interested in actually connecting the fully general trie construction to
Template Haskell and other facilities to reduce the coder's overhead of
using these tries in practice to a minimum.
Louis Wasserman
wasserman.lo
for any algebraic
type based on its algebraic representation. (I am working on writing up my
methods for publication.)
Of course, if I could get automatic access to the mechanisms of a type's
constructors, I wouldn't even require users to describe the algebraic
representation of their type...
Louis
Oh, geez. Wrong link. I meant
http://portal.acm.org/citation.cfm?id=967471 .
Louis Wasserman
wasserman.lo...@gmail.com
On Tue, Sep 8, 2009 at 1:06 PM, Louis Wasserman
wasserman.lo...@gmail.comwrote:
Sean,
The answer is, I'm working on a recently semi-released package called
TrieMap
Yo,
I don't know a thing about SYB, Data.Data, or Data.Typeable, mostly because
I'm an efficiency fanatic. Nevertheless, I'd like to know whether or not
there's a way to deconstruct a (mostly) arbitrary type, into tuples, unions,
etc. using this framework. Any thoughts?
Louis Wasserman
Count me in. I'm a student at UChicago.
Louis Wasserman
wasserman.lo...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Pardon my asking, but are fromEnum and toEnum guaranteed to preserve order
on types like Double? I'd like to see a Double-backed Patricia tree map,
but are we certain that EnumMap as presented will behave properly on such
types?
Louis Wasserman
wasserman.lo...@gmail.com
package.)
Louis Wasserman
wasserman.lo...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Where might I find or submit a paper on functional data structures?
Examples I've found so far include ICFP http://www.icfpconference.org/ and
the JFP http://journals.cambridge.org/action/displayJournal?jid=JFP, but
Google hasn't found me anything else.
Louis Wasserman
wasserman.lo...@gmail.com
match family declaration; expected 1
In the type synonym instance declaration for `Map'
In the instance declaration for `Key (k1, k2)'
Is this a bug with type synonym families? Is there something silly I'm
missing?
Louis Wasserman
wasserman.lo...@gmail.com
families?
b) Is there a reason this isn't made a lot clearer in the documentation?
GHC's docs say that higher-order type families can be declared with kind
signatures, but never gives any examples -- which would make it a lot
clearer that the below program doesn't work.
Louis Wasserman
wasserman.lo
? Is this impossible? That is, is
there any way to do something like
data family Foo a
data instance Foo Int = Bar Int -- Bar is actually a newtype
Louis Wasserman
wasserman.lo...@gmail.com
On Thu, Apr 2, 2009 at 12:47 PM, David Menendez d...@zednenem.com wrote:
2009/4/2 Louis Wasserman wasserman.lo
?
Thoughts?
Louis Wasserman
wasserman.lo...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
) or
reimplement my own stream fusion. Would it make sense to duplicate
uvector's internals, copying licensing information and other stuff of
course, inside my package? It's a suboptimal solution, but it seems better
than the alternative...
Louis Wasserman
wasserman.lo...@gmail.com
for in the documentation -- but such a
method no longer exists in IntMap. ::sad::
Who do I tell this to / how do I ask to get it fixed?
Louis Wasserman
wasserman.lo...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
GCC output.
Louis Wasserman
wasserman.lo...@gmail.com
On Sat, Feb 21, 2009 at 5:21 PM, Bulat Ziganshin
bulat.zigans...@gmail.comwrote:
Hello Louis,
Saturday, February 21, 2009, 4:16:10 AM, you wrote:
In the meantime, a brief summary:
a minor correction: the best gcc result shown
determined Haskellers are interested in learning how to
obtain the absolute optimal perfection from their code. Don's results *are*
useful, but not in the way you say we're claiming.
Louis Wasserman
wasserman.lo...@gmail.com
On Sat, Feb 21, 2009 at 5:35 PM, Bulat Ziganshin
bulat.zigans
.)
His point is valid. But Don's results *not* obtained by optimizing in this
fashion are valid comparisons, and the results obtained with this
optimization are useful for other reasons.
Louis Wasserman
wasserman.lo...@gmail.com
On Sat, Feb 21, 2009 at 5:55 PM, Sebastian Sylvan
syl
civilly on all sides.)
Louis Wasserman
wasserman.lo...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the MonadQueue abstraction while using an ArrayT on the back
end. The final code doesn't see the presence of the array at all, it only
has access to the priority queue operations through the HeapT.
Thank y'all for your helpful comments, by the way =D
Louis Wasserman
wasserman.lo...@gmail.com
On Fri
by Bulat's
original comparison.
Can we move on?
Louis Wasserman
wasserman.lo...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
It does. In the most recent version, the full class declaration runs
class MonadST m where
type StateThread m
liftST :: ST (StateThread m) a - m a
and the StateThread propagates accordingly.
Louis Wasserman
wasserman.lo...@gmail.com
On Thu, Feb 19, 2009 at 2:10 AM, Sittampalam, Ganesh
a
StateThread associated type, but that'd just be RealWorld for IO and STM, I
guess.
Louis Wasserman
wasserman.lo...@gmail.com
On Thu, Feb 19, 2009 at 2:40 PM, Ryan Ingram ryani.s...@gmail.com wrote:
So, why not use this definition? Is there something special about ST
you are trying to preserve
kind -- usually
STArrays for intermediate computations are what I'm actually interested in,
and the actual outputs of my code are generally not monadic at all.
But I see how it would be useful in general. I'll add it in.
Louis Wasserman
wasserman.lo...@gmail.com
On Thu, Feb 19, 2009 at 2:51 PM
Yes, it really is like MonadIO -- just capable of being used to produce
guaranteed purely functional results ^^
Louis Wasserman
wasserman.lo...@gmail.com
On Wed, Feb 18, 2009 at 5:43 PM, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Mon, 16 Feb 2009, Louis Wasserman wrote:
I
of code reexamines
the polymorphism in every recursion, so that mappend, which is used in the
Monoid instance of Foo, looks up the Monoid instance of Foo *again* (for the
sole purpose of looking itself up) and recurses with that. Why is this, and
is there a way to fix that?
Louis Wasserman
transformers have been
unwrapped, it should be possible to invoke runST on the final ST s a.
- Both normal transformers and ST-bound transformers should propagate
MonadST.
I'm going to go try implementing this idea in stateful-mtl now...
Louis Wasserman
wasserman.lo...@gmail.com
On Mon, Feb 16
a
instance MonadTrans t = MonadSTTrans s t where
stLift = lift
which, as a side effect, makes explicit the distinction between normal monad
transformers and ST-wrapped monad transformers.
Louis Wasserman
wasserman.lo...@gmail.com
On Mon, Feb 16, 2009 at 10:04 AM, Sittampalam, Ganesh
that this approach is airtight, but let me know if you encounter
contradictions or problems.
Louis Wasserman
wasserman.lo...@gmail.com
On Mon, Feb 16, 2009 at 10:21 AM, Sittampalam, Ganesh
ganesh.sittampa...@credit-suisse.com wrote:
Oh, I see, every derived monad has to have an 's' in its type
(execIntMapT_ dijkstraM) [(v, v) :-
0]) g
As an imperative programmer for many years, this is pretty much the most
intuitive implementation of Dijkstra's algorithm that I've seen. Let me
know what you think.
Louis Wasserman
wasserman.lo...@gmail.com
) -
[(s, y)], as desired?
Louis Wasserman
wasserman.lo...@gmail.com
On Sun, Feb 15, 2009 at 4:06 PM, Reid Barton rwbar...@math.harvard.eduwrote:
On Sun, Feb 15, 2009 at 09:59:28PM -, Sittampalam, Ganesh wrote:
Stateful-mtl provides an ST monad transformer,
Is this safe? e.g. does
to think about whether or not it'd remain referentially transparent if the
ST thread were only visible to a very tightly encapsulated set of commands
(i.e. priority queue operations).
Louis Wasserman
wasserman.lo...@gmail.com
On Sun, Feb 15, 2009 at 5:33 PM, Henning Thielemann
lemm...@henning
-threaded array
transformer backing HeapT fail in that fashion as well?)
Louis Wasserman
wasserman.lo...@gmail.com
On Sun, Feb 15, 2009 at 6:15 PM, Ryan Ingram ryani.s...@gmail.com wrote:
You can roll your own pure STT monad, at the cost of performance:
-- Do not export any of these constructors
that monads don't... I'm going to test out some ideas, I think.
Louis Wasserman
wasserman.lo...@gmail.com
On Sun, Feb 15, 2009 at 6:45 PM, Louis Wasserman
wasserman.lo...@gmail.comwrote:
The module I put together already has everything I'd need to do it in terms
of an IntMap with much less
, but that's not an argument that such
magic exists...it's certainly an interesting topic to mull.
Louis Wasserman
wasserman.lo...@gmail.com
On Sun, Feb 15, 2009 at 9:20 PM, Dan Doel dan.d...@gmail.com wrote:
On Sunday 15 February 2009 9:44:42 pm Louis Wasserman wrote:
Hello all,
I just uploaded
abstraction than anything else I've seen. Areas
that could specifically be improved include the stuff that uses LRTrees, and
other stuff that isn't especially intuitive, elegant, or even efficient in
fgl's implementation.
Louis Wasserman
wasserman.lo...@gmail.com
leftApp :: (ArrowApply a) = a b c - a (Either b d) (Either c d)
returnA :: (Arrow a) = a b b
() ::
(Control.Category.Category cat) = cat b c - cat a b - cat a c
() ::
(Control.Category.Category cat) = cat a b - cat b c - cat a c
Does anybody know what's going on?
Louis Wasserman
wasserman.lo
there is a functional dependency involved, assuming by default that the
newtype is the more general of the types, perhaps?
Louis Wasserman
wasserman.lo...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
How might I go about finding out how many processors are available in a
concurrent GHC program? I have some code I'd like to parallelize, but I
don't want to spawn a separate (even lightweight) thread for each of
thousands of minor tasks.
Louis Wasserman
wasserman.lo...@gmail.com
apologies for the old-digest copy spam. .
Louis Wasserman
wasserman.lo...@gmail.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Do CORE pragmas inhibit optimizations going between the code inside and
outside of the pragma? This seems the case with certain code of mine, but
it's not even alluded to in the GHC documentation. ;_;
Louis Wasserman
wasserman.lo...@gmail.com
)
{-# RULES
scanr [~1] forall f x l . scanr f x l = build (scanrFB f x l);
-# RULES}
--
Louis Wasserman
[EMAIL PROTECTED]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
80 matches
Mail list logo
