problem is that ghci is unable to link
libstdc++. But the crash problem is probably still there.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
would love the ability to install it
locally and to link to it from the Haddock documentation.
[1]: http://hackage.haskell.org/package/operational
[2]: http://projects.haskell.org/operational/Documentation.html
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
on polymorphic combinators.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Emil Axelsson wrote:
Heinrich Apfelmus wrote:
Since every module of my DSL depends on the same
global variable, only two things should happen:
* Reloading a module does not reload the global counter. Everything is
fine.
* Reloading a module does reload the global counter. This forces *all
know whether that's the best way to go about it. It's worth trying, but
keep in mind that the goal is to have an expressive set of combinators,
not to shoehorn everything into monads.)
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
, the examples
WebSessionState.lhs
TicTacToe.hs
PoorMansConcurrency.hs
show how to suspend and resume the control flow. Feel free to request
additional examples.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell
look now, thanks for the suggestion.
I'm currently working on a variant of Elliott's and Hudak's original FRP
model. See also:
http://hackage.haskell.org/package/reactive-banana
http://apfelmus.nfshost.com/blog.html#functional-reactive-programming-frp
Best regards,
Heinrich Apfelmus
ghc-pkg hide offending-package
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
that simultaneity happen.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/2008/06/21/zipedit/
[hbeat]: http://dockerz.net/twd/hBeat
[midi streams]: http://hackage.haskell.org/package/streamed
[hwn]: http://www.haskell.org/haskellwiki/Haskell_Weekly_News
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
David Virebayre wrote:
Heinrich Apfelmus wrote:
Do you know any *small GUI programs* that you would *like* to see
*implemented with Functional Reactive Programming?*
I may have an example.
I want to hear!
I would love to hear your examples, so that I can try to convert them to FRP
style
Jason Dagit wrote:
Heinrich Apfelmus wrote:
Do you know any *small GUI programs* that you would *like* to see
*implemented with Functional Reactive Programming?*
I would love to hear your examples, so that I can try to convert them to FRP
style and test my library against them!
How about
Ketil Malde wrote:
Heinrich Apfelmus writes:
Do you know any *small GUI programs* that you would *like* to see
*implemented with Functional Reactive Programming?*
I don't know if this fits the bill, but a tool that I'd like to see is
plotting for one or more live streams of data. I guess I
Chris Smith wrote:
Heinrich Apfelmus wrote:
Do you know any *small GUI programs* that you would *like* to see
*implemented with Functional Reactive Programming?*
This isn't really a specific application, but what I'd like to see most
from FRP is an example of something that involves moving
Dmitriy Nikitinskiy wrote:
Heinrich Apfelmus пишет:
Do you know any *small GUI programs* that you would *like* to see
*implemented with Functional Reactive Programming?*
Maybe realize on FRP one of following bored examples:
CRUD table: create, update, delete records in table (for example
Haskell, the latency is just too big.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
David Virebayre wrote:
Heinrich Apfelmus:
I want to hear!
Just a description. :) You can also mention why you find it interesting etc.
Well I have an old program sitting around. Anyway, it's very simple :
The GUI has
- a window with a menu bar, 2 directory selects (source and dest
Henning Thielemann wrote:
Heinrich Apfelmus wrote:
Can GUI programming be liberated from the IO monad? Functional
Reactive Programming (FRP) promises as much, and I'm trying to make
this dream a reality with my [reactive-banana][] library. Having
released version 0.4.0.0, I am now looking
Henning Thielemann wrote:
Heinrich Apfelmus wrote:
Could you expand a little on your arrow-like stream processors? What
do the arrows look like,
data SF a b = SF (a - (b, SF a b))
?
My stream processors are not Arrows, because 'first' cannot be
implemented. However, 'arr' and '.' can
Henning Thielemann wrote:
Heinrich Apfelmus wrote:
Question: how would you actually like to describe the guitar simulator
at a high-level? Did you already wish for some specific combinators?
Assume that you had something like reactive-banana available and
imagine that there were a benevolent
is equal in
expressiveness to the approach I took in reactive-banana .
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Heinrich Apfelmus wrote:
Dear Haskellers,
Can GUI programming be liberated from the IO monad? Functional Reactive
Programming (FRP) promises as much, and I'm trying to make this dream a
reality with my [reactive-banana][] library. Having released version
0.4.0.0, I am now looking for example
is that you can use one and the
same finger tree implementation for a variety of data structures.
Practically every tree-based data structure can be obtained this way.
See also
http://apfelmus.nfshost.com/articles/monoid-fingertree.html
Best regards,
Heinrich Apfelmus
--
http
, the resulting text will be very useful to readers with a high
attention span, too.)
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
and
code. I interpret this as a sign that my library is easy to understand
(if you know Applicative Functors, that is) even though a key part of
the documentation is still missing.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
happens if you change it to
map_ applyAction sas
return [1..100]
? If this still throws a stack overflow, then problem is in the part of
the code that consumes said list.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
introducing this change?
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
- a
- showDouble :: Double - String
+ showDouble :: Floating a = a - String
will break the program
foo :: String - String
foo = showDouble . read
That said, is it true that *removing* a class constraint will never
cause ambiguities?
Best regards,
Heinrich Apfelmus
--
http
regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
was using the names for a Show instance. I am assuming there is no
syntax sugar to recover the name of the variable used in a binder as a
String.
Ah, good point. There is no referentially transparent way to recover the
name of a variable.
Best regards,
Heinrich Apfelmus
--
http
Tutorial
http://apfelmus.nfshost.com/articles/operational-monad.html
The link to the Cont monad is explained at the very end.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Or equivalently:
evalState (sequence . repeat . state $ \s - (s,s+1)) 0
Thanks, I've changed it.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
are better off with a library/approach geared directly towards
incremental computations.
[1]: http://haskell.org/haskellwiki/Reactive-banana
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe
David Barbour wrote:
Heinrich Apfelmus wrote:
Even then, events and behaviors are one abstraction level too low. In my
opinion, you are better off with a library/approach geared directly towards
incremental computations.
I believe behaviors are precisely the 'right' abstraction if the goal
bytecode language for the browser; something that can be JITted
efficiently while guaranteeing safety/security. This way, the
compilation chain
Haskell - bytecode - browser
would finally be viable.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
of two causal functions. The point is
that the innermost behavior was already available in full, so it's
perfectly possible to evaluate it at any time desired.
Of course, the function
double' x t = \t' - if t' = t then x t' else _|_
is causal.
Best regards,
Heinrich Apfelmus
--
http
to reason about other demand patterns than normal form is
Okasaki's method of attributing a debt to each constructor. See also
http://apfelmus.nfshost.com/articles/debit-method.html
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
in a certain sense. But to my knowledge, there is no way to
make this knowledge internal to System F.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
in Haskell.
* Conor McBride and Ross Paterson.
Applicative Programming with Effects.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
/Examples
Jeremy, I would love to be able to use wxHaskell from ghci on MacOS X;
that would speed up my GUI development cycle considerably.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe
language. However, trying to
squeeze that into GHC rules is hopeless. Having some way of compiling
code at run-time would solve that. Examples:
** Conal Elliott's image description language Pan
** Henning Thielemann's synthesizer-llvm
Best regards,
Heinrich Apfelmus
--
http
It's irrelevant whether _|_ is unrealistic, it's just a mathematical
model anyway, and a very useful one at that. For instance, we can use it
to reason about strictness, which gives us information about lazy
evaluation and operational semantics.
Best regards,
Heinrich Apfelmus
--
http
* functions [a] - r and express average in constant space.
In other words, partial evaluation would make it unnecessary to reify
case expressions for the purpose of controlling performance / space leaks.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
Sebastian Fischer wrote:
Heinrich Apfelmus wrote:
Likewise, each function from lists can be represented in terms of our new
data type [...]
length' :: ListTo a Int
length' = CaseOf
(0)
(\x - fmap (1+) length')
length = interpret length'
This version of `length
want the system discrete in
both input (specification) and output.
Consider me interested. How does your approach compare to
Conal-style FRP with behaviors and events?
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe
.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
John Lato wrote:
From: Heinrich Apfelmus apfel...@quantentunnel.de
* Meta-programming / partial evaluation. When designing a DSL, it is
often the case that you know how to write an optimizing compiler for
your DSL because it's usually a first-order language. However, trying to
squeeze
Steve Horne wrote:
Heinrich Apfelmus wrote:
Purity has nothing to do with the question of whether you can express
IO in Haskell or not.
The beauty of the IO monad is that it doesn't change anything about
purity. Applying the function
bar :: Int - IO Int
to the value 2
; it's on the same footing as [Char], Maybe
Int, Int - String, Bool, and so on. I see no difference between the
list [1,2,3] :: [Int] and the action pick a random number between 1
and 6 :: IO Int .
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
Steve Horne wrote:
Heinrich Apfelmus wrote:
Again, purity refers to the semantics of functions (at run-time):
given the same argument, will a function always return the same
result? The answer to this question solely decides whether the
language is pure or impure. Note that this depends
Steve Horne wrote:
Heinrich Apfelmus wrote:
Maybe it helps to try to find an example of a function f :: A - B
for some cleverly chosen types A,B that is not pure, i.e. does not
return the same values for equal arguments.
[..]
For your specific challenge, place that as a left-hand
to find out.
Personally, the operational semantics given in SPJ's Tackling the
Awkward Squad always struck me as an accurate model of how GHC performs IO.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Conal Elliott wrote:
Heinrich Apfelmus wrote:
The function
f :: Int - IO Int
f x = getAnIntFromTheUser = \i - return (i+x)
is pure according to the common definition of pure in the context of
purely functional programming. That's because
f 42 = f (43-1) = etc.
Put differently
partial evaluation by hand.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Jan Christiansen wrote:
On Jan 2, 2012, at 2:34 PM, Heinrich Apfelmus wrote:
Without an explicit guarantee that the function is incremental, we can't do
anything here. But we can just add another constructor to that effect if we
turn ListTo into a GADT:
data ListTo a b where
, a fancy REPL built on wxHaskell?
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Tom Murphy wrote:
Heinrich Apfelmus wrote:
For instance, I'm currently
dabbling with sound generation and it is only natural that I want to hear
the sound instead of seeing a textual representation.
Does this mean we're going to see music FRP examples soon?!
I'm not so sure about the soon
serialhex wrote:
Heinrich Apfelmus wrote:
I'm not so sure about the soon part, but yes, using FRP to make music is
part of the plan.
you know, i've been thinking about this recently, and while i need more
haskell skillz if i want to do some sound synthesis, i think it would be
really spiffy
of concept or two.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
sure that someone
will volunteer to be a mentor.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sergiu Ivanov wrote:
Heinrich Apfelmus wrote:
What's the time frame for project proposals? I have two ideas in my head
that I think are unusually cool. To make a successful SOC project, they need
a bit of preparation on my part, though, so I'm wondering how much time I
have to implement a proof
, instead of letting
the students pick themselves.
Here we go, I've written up a proposal:
http://apfelmus.nfshost.com/blog/2012/02/14-summer-of-code-proposal.html
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing
library.
http://haskell.org/haskellwiki/Reactive-banana
http://www.haskell.org/haskellwiki/Reactive-banana/Examples
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
in GHC 7.2 that break reactive-banana-wx.
Watching the build log on Hackage is fun: sometimes it doesn't build,
then it does build, then not. Fortunately, everything works fine on GHC
7.0.4 .
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
and if possible fun example of what one can
achieve in Haskell. Things that sprung to my mind are rather dull: prime
factors, fibonacci numbers.
A morse code decoder, perhaps?
http://apfelmus.nfshost.com/articles/fun-with-morse-code.html
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
your reduction steps.
It's not wrong to perform graph reduction, and any student should do it
at one point in their lives, but the restriction to operational
semantics would miss an important abstraction that is part of the
Haskell spirit.
Best regards,
Heinrich Apfelmus
--
http
be more suitable mentors out there.
This sounds like a great GSoC project to me. Maybe you can add it to the
list of project suggestions, Jurriën?
http://hackage.haskell.org/trac/summer-of-code/report/1
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
to make that
available to non-Emacsers, via the web browser.
http://hackage.haskell.org/trac/summer-of-code/ticket/1609
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
:
http://www.google-melange.com/gsoc/org/google/gsoc2012/haskell
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sajith T S wrote:
Heinrich Apfelmus apfel...@quantentunnel.de wrote:
Just for reference, here the direct link that is now online:
http://www.google-melange.com/gsoc/org/google/gsoc2012/haskell
How up-to-date/relevant are the projects in the ideas page?
http://hackage.haskell.org/trac
serialhex wrote:
On Sat, Mar 17, 2012 at 11:01 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
The task is to implement a small audio synthesizer in Haskell.
seriously?!?! i'm not in his class, but i'm game! i learn better
when i'm working on something interesting, and i want to make
-banana library.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
a list of samples that you've calculated
yourself. That's cool if you're only interested in sound design, but bad
for learning how audio programming works.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
and trying stuff out.
Concerning UI, the following project suggestion aims to give GHCi a web GUI
http://hackage.haskell.org/trac/summer-of-code/ticket/1609
But one of your criteria is that a good UI should come with a help
system, too, right?
Best regards,
Heinrich Apfelmus
--
http
John Lato wrote:
From: Heinrich Apfelmus
Also, as far as I am aware, you can't do low-level audio programming in
SuperCollider, i.e. play a list of samples that you've calculated
yourself. That's cool if you're only interested in sound design, but bad
for learning how audio programming works
way round?
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
. show, flip ())
I guess that didn't help a lot, somebody with deeper GHC-fu than me will
have to step in.
The problem is that f1 and f2 are polymorphic functions. To put
polymorphic functions in a pair, you need *impredicative polymorphism*.
Best regards,
Heinrich Apfelmus
--
http
Florian Hartwig wrote:
Heinrich Apfelmus wrote:
So while the two are related, CAS is a machine primitive that works
for a single operation and on a single word while STM is a software
abstraction that isolates sequences of operations on multiple memory
locations from each other
traditionally been hard.)
P.S. Sorry about the long mail, the explanation ended up a little longer
than I originally expected. :)
I know it was time to get a blog when my mailing list posts got too long. ;)
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
for that and peruse the documentation
in Reactive.Banana.Frameworks in case something is unclear.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
homepage. Thanks
for your great explanation!
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
: whether memory is transactional or not is
unimportant, the only thing that matters is a computation that composes
atomically.)
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
don't know the structure of the parser
until we run it on some input.
See also this answer on StackOverflow:
http://stackoverflow.com/a/7863380/403805
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
/archive/reactive-banana/latest/doc/html/Reactive-Banana-Model.html
The key idea is to keep all events synchronous and to reify some cases
of this event does not occur right now.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
By the way, Conal's Bezier editor doesn't make much use of the switcher
combinator, so you can directly translate it into reactive-banana.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
do not need to follow a uniform time step.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the representation Behavior a = Time - a and this
introduces other efficiency problems not present in reactive-banana.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
. You have to reify the type a in Key a in the value
of the key. I think it's possible to use a data type family for the map
type.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
ExistsShow = E { showE :: String }
instance Show ExistsShow where
show = showE
withShow :: String - (forall a. Show a = a - c) - c
withShow s f = f (E s)
Essentially, the point is that the types are equivalent
ExistsShow == exists a. Show a = a
Best regards,
Heinrich Apfelmus
becomes out-of-date.
This already exists:
http://packdeps.haskellers.com/
Indeed. It even has RSS feeds, like this
http://packdeps.haskellers.com/feed/reactive-banana
Extremely useful!
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
to introduce a type signature (:: Int) to make
a program unambiguous.
In this light, I don't think that the trade-off made by the
OverloadedLists extension is big enough.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell
library.
How do I access internal modules with cabal test , though? Last time I
tried, I could not find a way to expose in the test section of the cabal
file.
Best regards,
Heinrich Apfelmus
--
http://apfelmus.nfshost.com
___
Haskell-Cafe mailing
Simon Hengel wrote:
On Sun, Sep 23, 2012 at 06:11:59PM +0200, Heinrich Apfelmus wrote:
How do I access internal modules with cabal test , though? Last
time I tried, I could not find a way to expose in the test section
of the cabal file.
It works, if you add the source directory to hs-source
701 - 800 of 837 matches
Mail list logo
