Re: [Haskell] Haskell Platform 2011.2.0.1 now available

> > 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 wrote: > We're pleased to announce the 2011.2.0.1 release of the Hask

[Haskell] ANN: package Boolean: Generalized booleans

I just uploaded a new package [1] for generalized booleans, which provides type classes with generalizations of boolean values & operations, if-then-else, Eq and Ord. These values & types come up for me with every new deep DSEL, and I think they do for others as well. The design space has some tr

Re: [HOpenGL] Re: [Haskell] ANNOUNCE: OpenGLRaw 1.0.0.0

On Fri, Jun 12, 2009 at 2:24 AM, Sven Panne wrote: > > A few final remarks: Leaving out "Graphics." completely would be a very bad > idea, the naming hierarchy should reflect the underlying conceptual > hierarchy. > The only problem with hierarchies in general is that sometimes the position > in

[Haskell] Re: [Haskell-cafe] Haskell Weekly News: Issue 111 - March 28, 2009

> > conal: Recursion is the goto of functional programming > BTW, I certainly did not mean to take credit for this wonderful quote. I don't know the origin. I first heard it from Erik Meijer. - Conal ___ Haskell mailing list Haskell@haskell.org http

[Haskell] Announce: FieldTrip library (functional 3D) and mailing list

FieldTrip [1] is a library for functional 3D graphics. It is intended for building static, animated, and interactive 3D geometry, efficient enough for real-time synthesis and display. Since FieldTrip is functional, one describes what models are, not how to render them (being rather than doing).

[Haskell] Announce: Reactive library (FRP) and mailing list

Reactive [1] is a library for functional reactive programming (FRP), similar to the original Fran [2] but with a more modern interface (using standard type classes) and a hybrid push/pull implementation. It is designed to be used in a variety of contexts, such as interactive 2D and 3D graphics, gr

Re: [Haskell] ANNOUNCE: lhs2tex-1.14

Hi Andres, I just downloaded and compiled lhs2tex-1.14 on ghc 6.10.1, and I'm getting an error: ... [16 of 19] Compiling Math ( Math.lhs, Math.o ) [17 of 19] Compiling FileNameUtils( FileNameUtils.lhs, FileNameUtils.o ) FileNameUtils.lhs:81:35: Ambiguous type variable `b' in

[Haskell] extending GeSHi's haskell.php ?

The haskell.php module in GeSHi (Generic Syntax Highlighter) knows how to make Haddock doc links for several value & type identifiers in the Prelude. I'd like it to know a lot more than that, at least including the "base" package. It looks pretty simple, though tedious, to add more, and so begs fo

Re: [Haskell] garbage collection of Concurrent Haskell threads?

> Simon > > > > *From:* [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] *On > Behalf Of *Conal Elliott > *Sent:* 24 December 2007 00:15 > *To:* haskell@haskell.org > *Subject:* [Haskell] garbage collection of Concurrent Haskell threads? > > > > The classic paper "

[Haskell] garbage collection of Concurrent Haskell threads?

The classic paper "The Incremental Garbage Collection of Processes" ( http://citeseer.ist.psu.edu/baker77incremental.html) describes "futures" and how particularly garbage collecting them when their pending result is no longer referenced. I've been playing with an implementation of futures in Conc

[Haskell] problem with hs-plugins 1.1 on Windows: _WaitForSingleObject

I compiled a fresh darcs-get of the latest hs-plugins (through patch 209). it all compiles fine, but the tests die with complaints like this one: +Main.exe: +c:/ghc/ghc-6.8.1.20071102/lib\base-3.0.0.0/HSbase-3.0.0.0.o: unknown symbol `_WaitForSingleObject' +Main.exe: user error (resolv

Re: [Haskell] IVars

L PROTECTED]> wrote: > You can make them from MVars. > > On Dec 2, 2007 8:03 PM, Conal Elliott <[EMAIL PROTECTED]> wrote: > > > what became of (assign-once) IVars? afaict, they were in concurrent > > haskell and now aren't. > > > > ___

[Haskell] IVars

what became of (assign-once) IVars? afaict, they were in concurrent haskell and now aren't. ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] pretty-printing Haskell with automatic parens?

The haskell-src package contains a pretty-printer for Haskell syntax that requires parentheses to be explicitly placed in the (abstract) syntax representation. I have some code for automatically inserting parentheses where necessary (for use before pretty-printing), but I'm guessing someone else h

[Haskell] Re: Ref class?

Thanks to all for the replies. I have it now. - Conal On 8/16/07, Conal Elliott <[EMAIL PROTECTED]> wrote: > > does anyone know where there's a class that abstracts over IORefs? it > includes newRef, readRef, and writeRef. i've seen it but can

[Haskell] Ref class?

does anyone know where there's a class that abstracts over IORefs? it includes newRef, readRef, and writeRef. i've seen it but can't remember where. - conal ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] ghc.haddock?

All clear now. :) Much appreciated, Isaac! - Conal On 8/14/07, Isaac Dupree <[EMAIL PROTECTED]> wrote: > > Conal Elliott wrote: > > Hi David. Thanks for the reply. > > > > I'm pretty confused. I understand your first paragraph as saying *not* > to >

Re: [Haskell] ghc.haddock?

Hi David. Thanks for the reply. I'm pretty confused. I understand your first paragraph as saying *not* to use that repo, and the second as saying to use it. Is the new haddock included in GHC 6.7 or is it still an app that works separately from GHC? If the latter, where is the app's repo? Than

Re: [Haskell] ghc.haddock?

ndows? Is the plan to merge it into the main ghc sources, and if so, when? I'd love to hear from others using ghc.haddock. Thanks, - Conal On 8/9/07, Simon Marlow <[EMAIL PROTECTED]> wrote: > > Conal Elliott wrote: > > I've heard of a version Haddock that understands

[Haskell] ghc.haddock?

I've heard of a version Haddock that understands all of GHC's syntax extensions. Does anyone the current status?- Conal ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] Quantified class constraints (& back-chaining)

> On Wed, Aug 01, 2007 at 05:29:19PM -0700, Conal Elliott wrote: > > Sadly, this solution runs into the problem of instance selection based only > > on head-matching, not back-chaining into constraints. For instance, I'd > > like also to use the following

[Haskell] Quantified class constraints (& back-chaining)

I'm developing a type constructor class and want the constraint forall a. Monoid (m a) (where m :: * -> *), which is neither legal Haskell, nor supported by GHC. As a work-around, I used the first encoding suggested in "Simulating Quantified Class Constraints" (Valery Trifonov, Haskell Workshop '0

Re: [Haskell] Re: type class instance selection & search

On 8/1/07, apfelmus <[EMAIL PROTECTED]> wrote: > There are some fundamental problems/design choices for type classes > in conjunction with separate compilation/modularity that need to be > researched before trying anything like that. In particular, any > ad-hoc Prolog, CHR or -fallow-undecidable-i

Re: [Haskell] Re: type class instance selection & search

On 7/31/07, jeff p <[EMAIL PROTECTED]> wrote: > Hello, > > My understanding is that this sort of instance collection doesn't > > work together because instance selection is based only on the > > matching the head of an instance declaration (part after the > > "=>"). I'm wondering why not use the

Re: [Haskell] Re: type class instance selection & search

Thanks for these pointers, Ken. And belated thanks to Oleg for his reply in June. Impressive tricks! Perhaps I'm not the only person who'd prefer a more straightforward formulation of backtracking search? Cheers, - Conal On 7/31/07, Chung-chieh Shan <[EMAIL PROTECTED]>

[Haskell] Re: type class instance selection & search

ive f, Num a) => Num (f a) where (+) = liftA2 (+) fromInteger = pure . fromInteger -- etc \end{code} Currently, I place such instance declarations in comments as boilerplate to be instantiated manually. - Conal On 7/31/07, Conal Elliott <[EMAIL PROTECTED]> wrote: &g

[Haskell] type class instance selection & search

I keep running into situations in which I want more powerful search in selecting type class instances. One example I raised in June, in which all of the following instances are useful. > instance (Functor g, Functor f) => Functor (O g f) where > fmap h (O gf) = O (fmap (fmap h) gf) > instance

[Haskell] Wanted: tricks for conflicting instances

In playing with compositions involving functors & cofunctors, I've run into a conflict in the instances I want to provide. I imagine this sort of problem is well-known, and I'd like to hear what kinds of strategies people apply. Here's a definition of type composition: newtype O g f a = O { un

[Haskell] Paper draft: "Applicative Data-Driven Computation"

I would love to get comments on a short (4.5 page) paper draft called "Applicative Data-Driven Computation", which describes a very simple approach to data-driven (push-based) computation and its application to GUI programming. Please see http://www.haskell.org/haskellwiki/Applicative_Data-Driv

[Haskell] ANNOUNCE: Phooey 1.0 and GuiTV 0.3

I'm happy to announce a new version of Phooey, a library for functional user interfaces. Highlights in this release: - Uses new TypeCompose package, which includes a simple implementation of data-driven computat

[Haskell] ANNOUNCE: TypeCompose 0.0

TypeCompose provides some classes & instances for forms of type composition. It also includes a very simple implementation of data-driven computation. I factored it out of a new implementation of Phooey . I am ve

[Haskell] Composing applicative functors?

Is the composition instance of Control.Applicative defined somewhere? I see it in the McBride & Paterson paper [1], but not in the library docs [2]. I'd rather pull it in from a library than (re)define it myself. [1] http://www.soi.city.ac.uk/~ross/papers/Applicative.pdf [2] http://www.haskell.o

[Haskell] ANNOUNCE: cabal-make version 0.1

Cabal-make is a GNU make include file to be used with Cabal in creating and sharing Haskell packages. A few highlights: * Web-based, cross-package links in Haddock docs * Syntax coloring via hscolour, with per-project CSS * Links from the Haddock docs to hscolour'd code and to wiki-base

[Haskell] Re: ANNOUNCE: TV-0.2 and GuiTV-0.2

in. Problem fixed. (Slight difference in regexp handling in Opera vs FF & IE.)- Conal On 2/12/07, Conal Elliott <[EMAIL PROTECTED]> wrote: *TV* <http://haskell.org/haskellwiki/TV> is a library for composing *tangible values* ("TVs"), i.e., values that carry along e

[Haskell] ANNOUNCE: TV-0.2 and GuiTV-0.2

*TV* is a library for composing *tangible values* ("TVs"), i.e., values that carry along external interfaces. In particular, TVs can be composed to create new TVs, *and* they can be directly executed with various kinds of interfaces. Values and interfaces are *c

[Haskell] class instance lost during re-export & packaging

I have a package P that contains a class instance specified in one module P.M and re-exported in packaging module P (one that gathers & re-exports for the whole P package). When I import the package module P in a test module, Under ghc-6.6, my instance is not found. If the test module also says

[Haskell] Hyperlinking source code formatter?

I'd like to turn source code (mine and others') into a fully hyperlinked form, in which every name reference links to the name's definition. Syntax-coloring would be great also. I see Programmatica. Is it in use, supported, and reasonably easy to install and use? Are there other options? Thank

[Haskell] ANNOUNCE: TV 0.0 -- Tangible Values / composable interfaces

I'm happy to announce the birth of *TV*, a library for composing *tangible values* ("TVs"), i.e., values that carry along external interfaces. In particular, TVs can be composed to create new TVs, *and* they can be directly executed with a friendly GUI, a process that reads and writes character st

[Haskell] ANNOUNCE: Phooey 0.1 -- Functional user interface library

I've just release version 0.1 of Phooey, an arrow-based functional user interface library. Please see the new project page at http://haskell.org/haskellwiki/phooey . What's new in version 0.1: - Relocated, improved & wikified home page, with new section on Motivation. - Text input (textEn

[Haskell] ANNOUNCE: DeepArrow 0.0 -- Arrows for "deep application"

I'm happy to announce the birth of DeepArrow, a Haskell library for composable "editors" of pure values. DeepArrow enables "deep function application" in two senses: deep application of functions and application of deep functions. These tools generalize beyond values and functions, via the DeepAr

Re: [Haskell] ANNOUNCE: Phooey -- a Functional UI library for Haskell

Hi Neil, Thanks for the pointer. From first skim-through at some PropLang library & example code, I'm not seeing much similarity between the two systems. GuiHaskell looks nifty. Cheers, - Conal On 12/13/06, Neil Mitchell <[EMAIL PROTECTED]> wrote: Hi, > Thanks for your comments, Steve. T

Re: [Haskell] ANNOUNCE: Phooey -- a Functional UI library for Haske ll

Push vs pull, rather than imperative vs functional, as the crux of the inversion issue makes a lot of sense to me. And I see your point about publish/subscribe removing the dependency inversion, while keeping a push implementation and an imperative style. I also see how pull can be done easily i

Re: [Haskell] ANNOUNCE: Phooey -- a Functional UI library for Haskell

the biggest challenge to presenting a purely functional API but using a standard GUI toolkit for the underlying widget set. Regards, -Antony On 12/12/06, Conal Elliott <[EMAIL PROTECTED]> wrote: > Announcing Phooey <http://conal.net/phooey>, a functional UI library f

Re: [Haskell] ANNOUNCE: Phooey -- a Functional UI library for Haskell

On 12/12/06, Brian Hulley <[EMAIL PROTECTED]> wrote: This looks really interesting, but I'm struggling to understand what you mean by "reversal". Can you elaborate on what you mean by "the imperative approach imposes an implementation dependence of inputs on outputs." In the model-view-control

[Haskell] ANNOUNCE: Phooey -- a Functional UI library for Haskell

Announcing Phooey , a functional UI library for Haskell. GUIs are usually programmed in an "unnatural" style, in that implementation dependencies are inverted, relative to logical dependencies. This reversal results directly from the imperative orientation of most GUI lib

Re: [Haskell] haddock-via-cabal: --prologue option?

Sure enough -- it does. Thanks, Duncan. - Conal On 12/7/06, Duncan Coutts <[EMAIL PROTECTED]> wrote: On Thu, 2006-12-07 at 13:22 -0800, Conal Elliott wrote: > Is it possible to get haddock's --prologue flag passed in through > cabal? Is there perhaps a way to get arbitrary

[Haskell] haddock-via-cabal: --prologue option?

Is it possible to get haddock's --prologue flag passed in through cabal? Is there perhaps a way to get arbitrary options passed in?- Conal ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] Re: haddock not finding base lib docs -- $topdir ?

Oops! There's another problem with these paths. Haddock-generated links to library functions come out like c:/ghc/ghc-6.6/doc/html/libraries/base/Data-Char.html#t%3AString which is not a valid URL, as it's missing a "file:///" prefix. On 12/5/06, Conal Elliott <[

[Haskell] Re: haddock not finding base lib docs -- $topdir ?

Marlow <[EMAIL PROTECTED]> wrote: Conal Elliott wrote: > I'm running haddock for the first time, via cabal. I get the following > message when i do "runhaskell Setup.hs haddock" on monadLib: > > Warning: cannot use package base-2.0: > HTML directory $topdir

[Haskell] cabal + haddock on Windows default paths working?

When I configure libraries (monadLib, arrows) with default locations and then cabal-haddock my own library, I get this sort of warning: Warning: cannot use package arrows-0.2: HTML directory "C:\\Program Files\\Common Files\\arrows-0.2\\doc\\html" does not exist. That directory *does* exist, h

[Haskell] haddock not finding base lib docs -- $topdir ?

I'm running haddock for the first time, via cabal. I get the following message when i do "runhaskell Setup.hs haddock" on monadLib: Warning: cannot use package base-2.0: HTML directory $topdir\html\libraries\base does not exist. I do have c:/ghc/ghc-6.6/doc/html/libraries/base/. Is there so

[Haskell] Pajama & Eros; collaborators sought

I'm looking for collaborators on two projects, as described below.The first project is Pajama, which is a re-implementation of the Pan language and optimizing compiler for image synthesis and manipulation ( http://conal.net/Pan).  The Pajama home page is http://conal.net/Pajama, and a new wiki is a

Re: [Haskell] Haskell.org and Google Summer of Code 2006

I have some projects I'd like help with, and I'd enjoy mentoring.  Is there any match-making structure yet (even a wiki page) for Haskell mentors and mentees, e.g., listing interest areas and/or specific projects?  Cheers,  - Conal On 4/22/06, Paolo Martini <[EMAIL PROTECTED]> wrote: Hello everybod

[Haskell] lhs2TeX: lazy pattern "~" formatting

Does anyone have a nice way to format the "~" of a lazy pattern in lhs2TeX? I use %format ~ = "{} ^\sim " but the result isn't as pretty as I'd like. For one thing, no space is inserted before the "~" after a lambda, "do", or whatever. Thanks, - Conal ___

Re: [Haskell] Re: lhs2TeX-friendly emacs mode?

Thanks a bunch, Nils!  Your elisp code works great for me.  No more manual switching between LaTeX and literate Haskell modes.  The one visible shortcoming is that it doesn't handle inline Haskell (|...| or @...@).  I see you added support but commented it out.  When I tried it myself, I see why. 

Re: [Haskell] Re: lhs2TeX-friendly emacs mode?

]> wrote: >>>>> "Conal" == Conal Elliott <[EMAIL PROTECTED]> writes:Conal> Is there a Haskell emacs mode that works well with lhs2TeX?Conal> Specifically (a) treating \begin{spec} ... \end{spec} like Conal> \begin{code}... \end{code}, and (b) coloring inline co

[Haskell] lhs2TeX-friendly emacs mode?

Is there a Haskell emacs mode that works well with lhs2TeX?  Specifically (a) treating \begin{spec} ... \end{spec} like \begin{code}... \end{code}, and (b) coloring inline code ("||)" and maybe inline verbatim ("@@") as Haskell rather than LaTeX code.   - Conal _

Re: [Haskell] ANNOUNCE: lhs2tex-1.11

Hi Andres.  I just successfully installed & tested lhs2TeX on cygwin.  The only hitch was in an inconsistent translation of "/usr/local" into "c:/cygwin/usr/local" (I guess bash vs Haskell).  The fix was very simple: "./configure --prefix=c:/cygwin/usr/local" before "make" and "make install".  I su

[Haskell] Tools for web-based Haskell editing & compilation?

Has anyone set up GHC to run on a server with modules created, saved, edited, imported, and executed via a web interface?  Are there tools existing or under development that support some or all of this scenario? I'm working on a new implementation, "Pajama", of the Pan functional image synthesis D

[Haskell] functional dependency violation?

The program below fails to compile under ghc 6.4, giving the following error message: c:/conal/Eros/Haskell/PTest.hs:13:0: Illegal instance declaration for `Path (PCompose po pi) a a' whole whole'' (the instance types do not agree with the functional dependencies of the cla

RE: [Haskell] pretty printing Haskell code with auto parens?

Never mind.  I rolled my own.  If you need a HsExp parens inserter, just holler.  - Conal   -Original Message- From: Conal Elliott [mailto:[EMAIL PROTECTED] Sent: Tuesday, April 12, 2005 6:33 PM To: 'haskell@haskell.org' Subject: RE: [Haskell] pretty printing Haskell

RE: [Haskell] pretty printing Haskell code with auto parens?

lto:[EMAIL PROTECTED] On Behalf Of Conal Elliott Sent: Friday, April 08, 2005 3:54 PM To: haskell@haskell.org Subject: [Haskell] pretty printing Haskell code with auto parens?   What pretty printers are available for Haskell code (not necessarily complete) that handle automatic insertion of minima

[Haskell] pretty printing Haskell code with auto parens?

What pretty printers are available for Haskell code (not necessarily complete) that handle automatic insertion of minimally required parentheses?  I assumed that Language.Haskell.Pretty did that, but apparently it relies on manual insertion of parentheses in the abstract syntax.   Thanks,

RE: [Haskell] Re: Why is getArgs in the IO monad?

Elliott Cc: 'Jim Apple'; haskell@haskell.org Subject: Re: [Haskell] Re: Why is getArgs in the IO monad? Conal Elliott wrote: >The meaning of >"length getArgs" would then have to be a value whose type is the meaning >of Haskell's "Int", i.e. either

RE: [Haskell] Re: Why is getArgs in the IO monad?

Sent: Tuesday, January 18, 2005 12:15 AM To: haskell@haskell.org Subject: [Haskell] Re: Why is getArgs in the IO monad? I still think I'm missing your point, but let me take a stab at it. Conal Elliott wrote: > I'm suggesting you might better understand the > why of Haskell if you th

RE: [Haskell] Re: Why is getArgs in the IO monad?

D] [mailto:[EMAIL PROTECTED] On Behalf Of Jim Apple Sent: Monday, January 17, 2005 10:28 PM To: haskell@haskell.org Subject: [Haskell] Re: Why is getArgs in the IO monad? Conal Elliott wrote: > If getArgs had type [String], then its denotation must be a (lazy) list > of (lazy) sequen

RE: [Haskell] Why is getArgs in the IO monad?

How about a semantic answer instead of an operational one? If getArgs had type [String], then its denotation must be a (lazy) list of (lazy) sequences of characters (extended by bottom). For instance, the expression (words "hello world") denotes the list ["hello","world"]. What list would "getArg

RE: Expiring cached data?

lto:[EMAIL PROTECTED] On Behalf Of Tom Pledger Sent: Monday, November 03, 2003 12:18 PM To: [EMAIL PROTECTED] Subject: RE: Expiring cached data? Conal Elliott writes: | Hi Andrew. This situation is what weak pointers [1] are for. You keep | weak rather than regular pointers to your cache

RE: Expiring cached data?

about *which* cache data gets discarded, for instance least recently (or frequently) used. Doing so would seem to be an interesting and useful extension. Regards, - Conal [1] Stretching the storage manager: weak pointers and stable names in Haskell, Simon Peyton Jones, Simon Marlow, and

RE: proposal for anonymous-sum syntax

Looks nice to me. For consistency, how about "(||c)" instead of "[||c]", of type (a|b|c). Also, I think you mean mapSum f g [|b] = [| g b ] - Conal -Original Message- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Richard Nathan Linger Sent: Friday, February 2

RE: zipWith, zipWith3, zipWith4.... looks gawky, IMHO

Looks good to me, and very insightful for a Haskell relative newbie. You could also use "repeat f >< as" in place of "f :< as". Or define the latter as the former. If you think of lists as functions from integers, then :<, ><, and repeat are the classic combinators B ("." in Haskell), S, and K (

RE: BAL paper available

Small comment. Marcin wrote: > About program transformation possibility: I don't see how it would > be applied in practice. There is no use of associativity of (+) for > the compiler. It can do many optimizations, but it won't rewrite > x+(y+z) to (x+y)+z nor vice versa. Associativity and commu

RE: Combinator library gets software prize

> From: C.Reinke [mailto:[EMAIL PROTECTED]] > Am I the only one who finds the exclusive emphasis on combinator > languages slightly disappointing [...]? > [...] > The paper somewhat downplays the role of embedding the > combinator-based DSL in a full functional language while also > mentioning

ANNOUNCE: "Pan" -- a language & compiler for image synthesis & ma nipulation

[Sorry for the resend. This time hopefully without auto-formatting.] Pan Release announcement Pan is an experimental embedded language and compiler for image synthesis and manipulation, based on functional programming. You can get the compiler and do some Haskell progr

ANNOUNCE: "Pan" -- a language & compiler for image synthesis & manipulation

Pan is an experimental embedded language and compiler for image synthesis and manipulation, based on functional programming. You can get the compiler and do some Haskell programming do make your own effects, or get some of the precompiled effects and twiddle parameters to your heart's content.

RE: ANNOUNCE: Haskell HTML Combinators

Interesting. Why a new set of HTML combinators? How about a comparison with Erik Meijer's and with Malcolm Wallace & Colin Runciman? - Conal -Original Message- From: Andy Gill [mailto:[EMAIL PROTECTED]] Sent: Friday, November 12, 1999 6:41 PM To: [EMAIL PROTECTED]; [EMAIL PROTE