in wxWidgets, but we (i.e.
https://github.com/wxHaskell?tab=members) hope to release announce in
not too much time.
cheers,
Atze
On 30 Sep, 2013, at 20:32 , Conal Elliott co...@conal.net wrote:
Hi Conrad,
Great. The challenge is not specific to Pan, Vertigo, etc. If we can get
some low-level
again?
(I’m
guessing that the latter might be hard.)
Thanks
Simon
-Original Message-
From: Haskell-Cafe [mailto:haskell-cafe-boun...@haskell.org] On
Behalf
Of
Paul Liu
Sent: 30 September 2013 07:18
To: Conal Elliott
Cc: Haskell Cafe
elements, just basic windowing and
input handling.
Euterpea has a UI layer on top of GLFW that provides text boxes and
sliders, etc, entirely written in Haskell.
On Wed, Oct 2, 2013 at 8:40 AM, Conal Elliott co...@conal.net wrote:
Hi Paul. Is there a way to use GLFW with GUI elements other than
of the way
there (again, noting the properties I listed).
-- Conal
On Fri, Sep 27, 2013 at 1:40 AM, Conrad Parker con...@metadecks.org wrote:
Hi Conal!
Yes. I'd be very interested to help get Pan and Vertigo working. Do you
have a repo somewhere?
Conrad.
On 27 September 2013 13:32, Conal
I'm polling to see whether there are will and expertise to reboot graphics
and GUIs work in Haskell. I miss working on functional graphics and GUIs in
Haskell, as I've been blocked for several years (eight?) due to the absence
of low-level foundation libraries having the following properties:
*
I'm looking for an ICFP roommate. I plan to attend Sunday through Saturday
and stay the nights of Saturday the 21st through Saturday the 28th. I
missed the discounted price of $225 (yipes) at the Airport Hilton (sold
out). Perhaps someone already has a room reserved with two beds or could
switch
Has anyone given a go at a Category class and friends (including cartesian
and closed) with associated constraints (presumably using the
ConstraintKinds language extension)? I gave it a try a while back and
wasn't able to keep the signatures from getting very complicated.
Thanks, -- Conal
In writing GHC plugins, how can I (a) add a module import (preferably
qualified) and (b) make vars/ids for names imported from the newly imported
module (to insert in the transformed Core code)?
Thanks,
- Conal
___
Haskell-Cafe mailing list
I want to convert lambda expressions into a vocabulary of monoidal
categories, so that they can be given multiple interpretations, including
circuit generation and timing analysis, and hopefully some other far-out
alternatives (3D visualization, animated evaluation, etc). More
specifically, I want
superb and I'd love to learn more!
greetings,
Sjoerd
On May 8, 2013, at 12:09 AM, Conal Elliott co...@conal.net wrote:
I'm using a collection of classes similar to Category, Arrow, ArrowChoice,
etc (though without arr and with methods like fst, snd, dup, etc). I think
I need some associated
Hi Wren,
Have you taken this constrained categories experiment further,
particularly for adding products? As I mentioned in a haskell-cafe note
yesterday, I tried and got a frightening proliferation of constraints when
defining method defaults and utility functions (e.g., left- or
I'm using a collection of classes similar to Category, Arrow, ArrowChoice,
etc (though without arr and with methods like fst, snd, dup, etc). I think
I need some associated constraints (via ConstraintKinds), so I've tried
adding them. However, I'm getting terribly complex multiplication of these
, they do not seem to be applicable
for things that lack a denotation, such as IO. Maybe it is a question of
how to relate denotational semantics to operational ones?
Hans
On 24 apr 2013, at 02:18, Conal Elliott wrote:
Hi Hans,
Do you have a denotation for your representation (a specification
Hi Jared,
Oh -- does Elm have a denotational semantics? I haven't heard of one. I
just now skimmed the informal description of the Signal
typehttp://elm-lang.org/docs/Signal/Signal.elm,
and from the reference to updates in the description of merge, it sound
like whatever semantics it might have,
The intuition intrigues me. If, upon inspection, it survives morphs into
something else, I'd like to hear about it.
Good luck! -- Conal
The object of mathematical rigor is to sanction and legitimize the
conquests of intuition, and there was never any other object for it. -
Jacques Hadamard
I
Hi Hans,
Do you have a denotation for your representation (a specification for your
implementation)? If so, it will likely guide you to exactly the right type
class instances, via the principle of type class
morphismshttp://conal.net/papers/type-class-morphisms/(TCMs). If you
don't have a
Hi Jan,
What you're suggesting is called non-linear patterns, and it's a
perfectly sensible, well-defined feature in a language with
pattern-matching. As you point out, non-linearity allows for more direct
succinct programming. I've often wished for this feature when writing
optimizations on
You can use a general fold and unfold, without any type-specific
programming if you re-express Expr as the least fixed point of its
underlying base functor:
data ExprF a = Add a a | Sub a a | Mul a a | Eq a a | B Bool | I Int
deriving (Show,Functor)
data Expr = Fix ExprF
Then use the
On Tue, Feb 19, 2013 at 9:28 PM, Anton Kholomiov
anton.kholom...@gmail.comwrote:
Do you think the approach can be extended for non-regular (nested)
algebraic types (where the recursive data type is sometimes at a different
type instance)? For instance, it's very handy to use GADTs to capture
What a delightfully elegant approach to CSE! I've been thinking about CSE
for DSELs and about functor fixpoints, but it never occurred to me to put
the two together.
Do you think the approach can be extended for non-regular (nested)
algebraic types (where the recursive data type is sometimes at a
On Thu, Feb 7, 2013 at 5:41 PM, Ross Paterson r...@soi.city.ac.uk wrote:
On Thu, Feb 07, 2013 at 02:49:40PM -0800, Conal Elliott wrote:
I make some use of arrow notation, though sadly I often have to avoid
it because my (pseudo-)arrows don't have arr. I'd love to see a
variant that has
Hi Ross,
I make some use of arrow notation, though sadly I often have to avoid it
because my (pseudo-)arrows don't have arr. I'd love to see a variant that
has restricted expressiveness in exchange for arr-freeness.
-- Conal
On Thu, Feb 7, 2013 at 6:08 AM, Ross Paterson r...@soi.city.ac.uk
[mailto:glasgow-haskell-
| users-boun...@haskell.org] On Behalf Of Richard Eisenberg
| Sent: 14 January 2013 03:47
| To: Conal Elliott
| Cc: glasgow-haskell-us...@haskell.org; Haskell Cafe
| Subject: Re: Advice on type families and non-injectivity?
|
| Hi Conal,
|
| I agree that your initial example
for different types.
On Sun, Jan 13, 2013 at 2:10 PM, Conal Elliott co...@conal.net wrote:
I sometimes run into trouble with lack of injectivity for type families.
I'm trying to understand what's at the heart of these difficulties and
whether I can avoid them. Also, whether some of the obstacles
I sometimes run into trouble with lack of injectivity for type families.
I'm trying to understand what's at the heart of these difficulties and
whether I can avoid them. Also, whether some of the obstacles could be
overcome with simple improvements to GHC.
Here's a simple example:
{-# LANGUAGE
appear in the signature
directly (e.g., something like 'a - F a' would be ok).
-Iavor
On Sun, Jan 13, 2013 at 11:10 AM, Conal Elliott co...@conal.net wrote:
I sometimes run into trouble with lack of injectivity for type
families. I'm trying to understand what's at the heart
...@tbi.univie.ac.at wrote:
Hi,
How would you infer a from F a? Given bar :: Bool, I can't see how
one could go from Bool to F a = Bool and determine a uniquely.
My question is not completely retorical, if there is an answer I would
like to know it :-)
Gruss,
Christian
* Conal Elliott co...@conal.net
Oh, I see Ross's trick. By quantifying over the domain range types, they
can later be specialized to analysis-time types (like circuit labels) or to
run-time types (like Boolean or Integer).
On Thu, Dec 20, 2012 at 4:55 PM, Conal Elliott co...@conal.net wrote:
If you require the circuit
generalized arrows?
http://www.cs.berkeley.edu/~megacz/garrows/
-- Kim-Ee
On Fri, Dec 21, 2012 at 7:55 AM, Conal Elliott co...@conal.net wrote:
If you require the circuit to be parametric in the value types, you can
limit the types of function you can pass to arr to simple plumbing.
See
If you require the circuit to be parametric in the value types, you can
limit the types of function you can pass to arr to simple plumbing.
See the netlist example at the end of my Fun of Programming slides (
http://www.soi.city.ac.uk/~ross/papers/fop.html).
I'm running into this same
Hi Tillmann. Wow. Lovely and spot on! And I almost never hear monad
explanations without wincing. Thanks for sharing. -- Conal
On Sun, Sep 16, 2012 at 7:48 AM, Tillmann Rendel
ren...@informatik.uni-marburg.de wrote:
Hi,
Kristopher Micinski wrote:
Everyone in the Haskell cafe probably has
On Fri, Sep 14, 2012 at 2:18 PM, Andrew Pennebaker wrote:
A summary of the changes I've included so far:
[...]
Another comment:
As a declarative language, Haskell manipulates expressions, eventually
reducing expressions to values.
Huh? In what sense do declarative languages manipulate
Hi Andrew,
To save others the search, here's the/a reddit URL:
http://www.reddit.com/r/programming/related/nhnyd/nfa_in_a_single_line_of_haskell/.
The terribly misleading/mistaken remarks on fib memoization are still in
your post. As hammar commented on reddit commenter, you're not memoizing in
Someone at work just asked me about the inflexibility of the derived Read
instances for records -- specifically that they require fields to be given
in the same order as in the type definition and that fields cannot be
omitted. I hadn't been aware of these restrictions.
A few questions:
* Are
Oh, yeah. Thanks, Sjoerd.
I wonder if there's some way not to require Monad. Some sort of
ApplicativeFix instead. Hm.
-- Conal
On Wed, Jun 6, 2012 at 2:43 PM, Sjoerd Visscher sjo...@w3future.com wrote:
If there would be a package where this could be in it would be
contravariant[1], but it
newtype Q p a = Q (p a - a)
instance ContraFunctor p = Functor (Q p) where
fmap h (Q w) = Q (h . w . cmap h)
using cmap for contravariant map. For instance, p a = u - a.
instance ContraFunctor p = Applicative (Q p) where
pure a = Q (pure a)
Q fs * Q as = Q (\ r -
let
f =
Agreed. The original note confuses programs (syntax) with functions
(semantics). -- Conal
On Thu, Apr 5, 2012 at 8:52 AM, Dan Doel dan.d...@gmail.com wrote:
On Thu, Apr 5, 2012 at 10:14 AM, Grigory Sarnitskiy sargrig...@ya.ru
wrote:
First, what are 'functions' we are interested at? It can't
This general applicative pattern for numbers is packed up in the
applicative-numbers package [1].
In addition to Ralf's paper, there's a discussion in section 10 of
*Denotational design with type class morphisms* [2] and an application in
sections 2 4 of *Beautiful differentiation* [3].
[1]:
Has anyone implemented pattern-matching substitution for
haskell-src-exts? - Conal
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'm using haskell-src-exts together with SYB for a code-rewriting project,
and I'm having difficulty with parenthesization. I naïvely expected that
parentheses would be absent from the abstract syntax, being removed during
parsing and inserted during pretty-printing. It's easy for me to remove
Is the standard pair-with-monoid monad instance in some standard place? I
see the Applicative instance in Control.Applicative, and the
pair-with-monoid Functor instance in Control.Monad.Instances, and the (-)
e and Either e monad instances also in Control.Monad.Instances.
I'm looking for
On 2012/1/1 Ertugrul Söylemez e...@ertes.de wrote:
Steve Horne sh006d3...@blueyonder.co.uk wrote:
Of course even the bind operator arguably isn't primitive. We could
translate to get rid of those too, and see what lies underneath. This
is where we start seeing functions of type...
... World - (x, World) ...
I look at this World parameter as purely hypothetical, a trick used to gain
an intuition. Whereas Jerzy (I think) uses it to claim Haskell is
referentially transparent - those differing x and y values come from
different worlds, or different world-states.
I
In that sense every value in maths is a function. In other words: Your
extension of everything (!) to functions is redundant.
And function is not unique in this way. All types can be embedded into
pairs also, e.g., newtype MyInt = MyInt ((),Int), or newtype MyInt = MyInt
(((),Int),()), etc.
On Fri, Dec 30, 2011 at 12:52 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Conal Elliott wrote:
I wrote that post to point out the fuzziness that fuels many
discussion threads like this one. See also http://conal.net/blog/posts/**
notions-of-purity-in-haskell/http://conal.net/blog
On Fri, Dec 30, 2011 at 8:12 AM, Conal Elliott co...@conal.net wrote:
On Fri, Dec 30, 2011 at 12:52 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Conal Elliott wrote:
I wrote that post to point out the fuzziness that fuels many
discussion threads like this one. See also http
On Fri, Dec 30, 2011 at 9:11 AM, Chris Smith cdsm...@gmail.com wrote:
time t: f 42 (computational process implementing func application
begins…)
t+1: keystroke = 1
t+2: 43 (… and ends)
time t+3: f 42
t+4: keystroke = 2
t+5: 44
Conclusion: f 42 != f 42
That
On Fri, Dec 30, 2011 at 9:20 AM, Colin Adams colinpaulad...@gmail.comwrote:
On 30 December 2011 17:17, Gregg Reynolds d...@mobileink.com wrote:
On Dec 30, 2011, at 11:04 AM, Colin Adams wrote:
On 30 December 2011 16:59, Gregg Reynolds d...@mobileink.com wrote:
On Fri, Dec 30, 2011 at
On Fri, Dec 30, 2011 at 9:19 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
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
On Fri, Dec 30, 2011 at 9:30 AM, Colin Adams colinpaulad...@gmail.comwrote:
On 30 December 2011 17:27, Conal Elliott co...@conal.net wrote:
On Fri, Dec 30, 2011 at 9:20 AM, Colin Adams
colinpaulad...@gmail.comwrote:
proof: f is a function, and it is taking the same argument each time
On Fri, Dec 30, 2011 at 9:43 AM, Gregg Reynolds d...@mobileink.com wrote:
On Dec 30, 2011, at 11:20 AM, Colin Adams wrote:
On 30 December 2011 17:17, Gregg Reynolds d...@mobileink.com wrote:
On Dec 30, 2011, at 11:04 AM, Colin Adams wrote:
On 30 December 2011 16:59, Gregg Reynolds
On Fri, Dec 30, 2011 at 9:43 AM, Conal Elliott co...@conal.net wrote:
On Fri, Dec 30, 2011 at 9:43 AM, Gregg Reynolds d...@mobileink.com wrote:
On Dec 30, 2011, at 11:20 AM, Colin Adams wrote:
On 30 December 2011 17:17, Gregg Reynolds d...@mobileink.com wrote:
On Dec 30, 2011, at 11:04 AM
On Fri, Dec 30, 2011 at 10:24 AM, Gregg Reynolds d...@mobileink.com wrote:
On Dec 30, 2011, at 11:43 AM, Conal Elliott wrote:
roof: f is a function, and it is taking the same argument each time.
Therefore the result is the same each time.
That's called begging the question. f
On Fri, Dec 30, 2011 at 10:45 AM, Gregg Reynolds d...@mobileink.com wrote:
On Dec 30, 2011, at 11:21 AM, Conal Elliott wrote:
And I also raised a more fundamental question than whether this claim of
sameness is true, namely what is equality on IO? Without a precise
consistent definition
I wrote that post to point out the fuzziness that fuels many discussion
threads like this one. See also
http://conal.net/blog/posts/notions-of-purity-in-haskell/ and the comments.
I almost never find value in discussion about whether language X is
functional, pure, or even referentially
I suspect this definition is what Sebastian meant by converting back and
forth to ordinary lists.
2011/8/29 Ryan Ingram ryani.s...@gmail.com
On Sun, Aug 28, 2011 at 8:24 PM, Maciej Marcin Piechotka
uzytkown...@gmail.com wrote:
f `fmap` FList g = _|_
f `fmap` FList g = map id
f `fmap`
Note that data-reify will only find *some* common/equal sub-expressions,
namely the pointer-equal ones. In all of my code-generating (deep) DSLs,
it's been very important for efficiency to also pull out
equal-but-pointer-unequal expressions.
- Conal
On Thu, Aug 11, 2011 at 4:41 AM, Vo Minh
yes.
On Fri, Aug 12, 2011 at 11:02 AM, Anton Kholomiov anton.kholom...@gmail.com
wrote:
Do you mean that x and y in
x = a + 1
y = a + 1
are different from data-reify point of view?
2011/8/12 Conal Elliott co...@conal.net
Note that data-reify will only find *some* common/equal sub
Is there a collection of laws associated with the Foldable class? Or for
Traversable? - Conal
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
if this applies in your case though.
Maybe it's my NIH, but I like to start with something too simple and
add what I need rather than start with something that has more than I
need and try to get it working.
On Wed, May 25, 2011 at 11:58 AM, Conal Elliott co...@conal.net wrote:
Thanks, John. Encouraging
, 2011 at 6:01 AM, Conal Elliott co...@conal.net wrote:
Last I tried, there wasn't native support for OpenGL with gtk, and I need
OpenGL. Then more recently, I heard of some progress in that area, but
requiring lots of hacking to get it all compiling. Any recent news? - Conal
On Mon, May 23
Last I tried, there wasn't native support for OpenGL with gtk, and I need
OpenGL. Then more recently, I heard of some progress in that area, but
requiring lots of hacking to get it all compiling. Any recent news? - Conal
On Mon, May 23, 2011 at 2:33 AM, John Lato jwl...@gmail.com wrote:
moving resizing isn't able to move resize this one
window. Have you noticed something similar?
- Conal
On Wed, May 18, 2011 at 12:33 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Conal Elliott wrote:
I still haven't found any way to do GUIs or interactive graphics in
Haskell
Last I heard, wx still had the problem of crashing its host the second time
one opens a window (which is typical in ghci). And last I heard, Jeremy
O'Donoghue (cc'd) was exploring solutions but had very little time to pursue
them. - Conal
On Wed, May 18, 2011 at 11:42 AM, Tom Murphy
Has anyone figured out a way to get libraries that open windows to work with
ghci? With libraries like glut I get the body of a window, but no frame, and
the process wedges. I guess the problem has to do with lack of .app bundle.
If so, perhaps a work-around might involve running ghci in an app
I still haven't found any way to do GUIs or interactive graphics in Haskell
on a Mac that isn't plagued one or more of the following serious problems:
* Incompatible with ghci, e.g., fails to make a window frame or kills the
process the second time one opens a top-level window,
* Goes through the
This release adds support for GHC 7.0.3, and significant improvements for
Mac OS X users.
Enticing! What are these significant improvements for Mac OS X users?
- Conal
On Fri, Apr 15, 2011 at 3:44 PM, Don Stewart don...@gmail.com wrote:
We're pleased to announce the 2011.2.0.1 release
Speaking of which, for a while now I've been interested in designs of
make-like systems that have precise simple (denotational) semantics with
pleasant properties. What Peter Landin called denotative (as opposed to
functional-looking but semantically ill-defined or intractable).
Norman Ramsey
On Tue, Feb 8, 2011 at 7:04 AM, Patrick Browne patrick.bro...@dit.iewrote:
Consider the following definitions:
1. Denotational semantics can be considered as relation between syntax
and mathematical objects (the meaning of the syntax).
2. Operational semantics can be considered as set of
On Tue, Feb 8, 2011 at 9:02 PM, ke...@froglingo.com wrote:
On Tue, Feb 8, 2011 at 07:55 pm, Conal Elliott co...@conal.net wrote:
Here's my personal denotational answer to question 2: I think of a type as
denoting a collection of (mathematical) values. If an expression e has type
T
Does anyone have a working example of #include'ing Haskell code into a
bird-tracks-style .lhs file with GHC? Every way I try leads to parsing
errors. Is there documentation about how it's supposed to work?
Help much appreciated. - Conal
___
...@googlemail.com wrote:
On Thursday 03 February 2011 10:33:23, Conal Elliott wrote:
Does anyone have a working example of #include'ing Haskell code into a
bird-tracks-style .lhs file with GHC? Every way I try leads to parsing
errors. Is there documentation about how it's supposed to work
I'm trying to find some way to do interactive, OpenGL-based graphics in
Haskell on Mac OS X.
Does anyone here use GLUT or SDL on Mac OS X with ghci, or maybe an
alternative library?
Using ghci is very important to me, as my programs are pretty high-level and
are often half-liners.
I'm using gtk2hs
I like C morphism in general, where C is the class name, so I use
Applicative morphism or applicative functor morphism (as in
http://conal.net/papers/type-class-morphisms/).
- Conal
On Fri, Nov 5, 2010 at 8:49 PM, rocon...@theorem.ca wrote:
An applicative functor morphism is a polymorphic
:
Hello everyone!
It's well known that Num Co type classes are not adequate for vectors
(I don't mean arrays). I have an idea how to address this problem.
Conal Elliott wrote very nice set of type classes for vectors.
(Definition below). I used them for some time and quite pleased
I like it!
Are the other sections available as well, e.g.,
(if False then else Cafe) Haskell -- Cafe
- Conal
On Sat, Oct 2, 2010 at 11:23 AM, Max Bolingbroke batterseapo...@hotmail.com
wrote:
Hi Cafe,
I implemented the proposed Haskell' feature lambda-case/lambda-if [1]
during the
For another model of GUIs, see Tangible Values (
http://www.haskell.org/haskellwiki/TV), which is composable MVC.
And amen to targeting GPUs.
In addition to getting clunky, imperative GUI frameworks like wx gtk
working robustly and easily in Haskell across platforms, I'd love to see
more
Hi Alex,
In Haskell, data structures cache, while functions do not.
Memoization is conversion of functions into data structures (and then
trivially re-wrapping as functions) so as to exploit the caching property of
data structures to get caching functions.
- Conal
On Wed, Sep 15, 2010 at
I'm updating a library (TV) and getting haddock parse errors for the doc
strings attached to GADT constructors. Is there a way to haddock-document
GADT constructors? I've tried both -- | ... before and -- ^ ...
after. Both give parse errors. Thanks, - Conal
Thanks David. Glad to know. I'll kludge around the missing feature for
now. I've added myself to the CC list for the ticket. Regards, - Conal
On Fri, Sep 10, 2010 at 10:47 AM, David Waern david.wa...@gmail.com wrote:
2010/9/10 Conal Elliott co...@conal.net:
I'm updating a library (TV
something
stupid or
incorrect.
On Mon, Aug 23, 2010 at 9:57 PM, Conal Elliott co...@conal.net
wrote:
So perhaps this could be a reasonable semantics?
Iteratee a = [Char] - Maybe (a, [Char])
I've been tinkering with this model as well.
However, it doesn't really
simpler. I
have one idea that I think will at least maintain performance for many
operations, although there will be performance hits too. If the drawbacks
are in areas that aren't particularly useful, though, it may be acceptable.
John
From: Conal Elliott co...@conal.net
Here's a way
, 2010 at 4:06 PM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Conal Elliott wrote:
For anyone interested in iteratees (etc) and not yet on the iteratees
mailing list.
I'm asking about what iteratees *mean* (denote), independent of the
various
implementations. My original note (also
be fixed?
Comments?
- Conal
On Mon, Aug 23, 2010 at 8:13 PM, Luke Palmer lrpal...@gmail.com wrote:
On Mon, Aug 23, 2010 at 1:06 AM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
Conal Elliott wrote:
For anyone interested in iteratees (etc) and not yet on the iteratees
mailing list
-- Forwarded message --
From: Conal Elliott co...@conal.net
Date: Sun, Aug 22, 2010 at 11:02 PM
Subject: Re: Semantics of iteratees, enumerators, enumeratees?
To: John Lato jwl...@gmail.com
Hi John,
I just remembered: Luke Palmer wrote an accessible helpful description of
this approach
On Sat, Aug 14, 2010 at 10:11 PM, Bill Atkins watk...@alum.rpi.edu wrote:
On Saturday Aug 14, 2010, at 12:50 AM, Conal Elliott wrote:
And the IO monad is what Jerzy asked about. I'm pointing out that the
state monad does not capture concurrency, and the EDSL model does not
capture FFI
There are various models. One (the state monad model) of them would
desugar this to:
\world0 -
let (x, world1) = getLine world0
world2 = print (x+1) world1
world3 = print (x+2) world2
in world3
Hi Ertugrul,
This state monad model does not really work for IO, since it
On Sat, Aug 14, 2010 at 9:27 AM, Ertugrul Soeylemez e...@ertes.de wrote:
Conal Elliott co...@conal.net wrote:
There are various models. One (the state monad model) of them would
desugar this to:
\world0 -
let (x, world1) = getLine world0
world2 = print (x+1) world1
distracted.
On Sat, Apr 17, 2010 at 3:46 AM, Roman Leshchinskiy r...@cse.unsw.edu.au
wrote:
On 17/04/2010, at 11:00, Conal Elliott wrote:
I'm unsure now, but I think I tried making Basis a data type (not
syn)
and ran into the problem I mentioned above. The Basis *synonyms* also
, Apr 17, 2010 at 3:46 AM, Roman Leshchinskiy r...@cse.unsw.edu.auwrote:
On 17/04/2010, at 11:00, Conal Elliott wrote:
I'm unsure now, but I think I tried making Basis a data type (not syn)
and ran into the problem I mentioned above. The Basis *synonyms* also have
HasTrie instances, which
Hi Brent,
I'm sorry to hear that the non-injectivity issue bit you. It's bitten me
also at times, leading me to choose associated data types (injective)
instead of associated synonyms (potentially non-injective). And sometimes,
the data types route is problematic, as the new types aren't
Hi Max. Thanks much for passing on this info. Very encouraging news! -
Conal
On Wed, Mar 10, 2010 at 8:41 AM, Max Bolingbroke batterseapo...@hotmail.com
wrote:
This is my understanding:
Old story (GHC 6.12.1 (?) and below):
1) Function bodies are only optimised if they are not marked
I think Jake is referring to my vector-space package. He did the work of
writing 171 INLINE pragmas, covering lots of methods and standalone function
defs. I'm simultaneously grateful for the effort and repelled by the added
syntactic noise. Also concerned about the impact of all these
Even if the implementation is discrete (as all digital hardware), it may be
more natural to treat things such as a temperature sensor, mouse position,
and perhaps even video as functions of continuous time, values that vary
continuously. So behaviors are not a workaround at all, in this
I call it an m or (more specifically) an Int m or a list of Int. For
instance, a list or an Int list or a list of Int. - Conal
On Wed, Jan 27, 2010 at 12:14 PM, Luke Palmer lrpal...@gmail.com wrote:
On Wed, Jan 27, 2010 at 11:39 AM, Jochem Berndsen joc...@functor.nl
wrote:
Now, here's the
I don't like this bias toward singling out Monad among all of the type
classes, thereby perpetuating the misleading mystique surrounding Monad. If
you're going to call [3,5,8] a monadic value, then please give equal time
to other type classes by also calling [3,5,8] a functorial value
Odd. Looks like most of the packages on d.h.o evaporated. I'll push the
repo to a new location. - Conal
On Sat, Jan 23, 2010 at 10:38 AM, Thomas Hartman tphya...@gmail.com wrote:
I was inspired by the google tech talk and would like to install and
play with eros, but the
Thanks, Matt. I see libev is available via macports. - Conal
On Fri, Dec 4, 2009 at 3:03 PM, Matt Morrow moonpa...@gmail.com wrote:
Conal,
If I were looking to do this, I'd read the relevant parts of the libev
code.
Matt
On 12/3/09, Conal Elliott co...@conal.net wrote:
I'd like
://monkeymail.org/archives/libevent-users/2007-January/000450.html.
*Libevent* should compile on Linux, *BSD, Mac OS X, Solaris and Windows.
On Fri, Dec 4, 2009 at 10:52 PM, Conal Elliott co...@conal.net wrote:
Thanks, Matt. I see libev is available via macports. - Conal
On Fri, Dec 4, 2009 at 3:03
I'd like to make some FRPish toys that keep files updated to have functional
relationships with other files. hinotify looks like just the sort of
underlying magic I could use for efficient implementation on linux. Is
there any support for mac os x? Could support be either added to hinotify
or
1 - 100 of 278 matches
Mail list logo
