2013 11:48:42 +0200, Sergey Mironov grr...@gmail.com
wrote:
Hi, Cafe. I'd like to write simple GUI utility containing tray icon
and the menu. Could you please suggest Haskell example to make my
start easier?
There is a simple wxHaskell program for this:
https://github.com/wxHaskell
Hi. Pat asked a question [1] about AST parametrized with types. People
suggest to use Functor machinery if possible. Have anything changed
since them? Do we have a way to safely transform the tree like
data Expr a = Id { id :: Id a } | Op { op :: Char, expra :: (Expr a) ,
exprb :: (Expr a) }
Hi, Cafe. I'd like to write simple GUI utility containing tray icon
and the menu. Could you please suggest Haskell example to make my
start easier?
Regards,
Sergey
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi, cafe.
Neil Mitchell mentioned more than ten build systems written in Haskell in his
paper [1]. The list includes shake (of cause) Abba, Coadjuke, hake, hmk, and
even two cakes.
I'm glad to announce the thirdcake - a DSL for make language. Thirdcake allows
user to produce clean and safe (I
Hi, I have a Path problem when installing threepenny-gui from Hackage.
Probably somtething trivial.
Sergey
src/BarTab.hs:9:8:
Could not find module `Paths'
Use -v to see a list of the files searched for.
Failed to install threepenny-gui-0.1.0.0
cabal: Error: some packages failed to
Hi. I'd like to announce the vsim - the simulator for (small subset
of) VHDL language. Currently
the project contains pretty large Java part and is not maintained.
That's why I don't want to
publish it on Hackage. Still, as far as I now have a permission to
share the code, I would like to do it.
Hi. I'm pleased to announce haskdogs-0.3.2, a source navigation helper.
Haskdogs is a small HSH-based tool which calls hasktags to create tag file for
entire haskell project. It takes into account first-level dependencies by
recursively scanning imports and adding matching packages to the final
Hi folks. Hackage contains several JSON packages but as far as I see,
they all provide 'static' conversion from JSON format to Haskell data
type. Is there a method of converting object containing optional filed
'a' to for example Maybe a.
Thanks, Sergey
2013/2/17 Oliver Charles ol...@ocharles.org.uk:
On 02/17/2013 03:01 PM, Sergey Mironov wrote:
Hi folks. Hackage contains several JSON packages but as far as I see,
they all provide 'static' conversion from JSON format to Haskell data
type. Is there a method of converting object containing
Hi. Great idea, I'm in.
Sergey
2012/12/3 Serguey Zefirov sergu...@gmail.com:
I would like to announce MskHUG December meeting and invite everyone
interested.
The meeting will take place December 13th, 20:00 to 23:30 in the nice
conference center in centre of Moscow:
Hi! I have a syntax tree defined like this:
data A a = A Int Int (B a)
data B a = B String String (C a)
data C a = C Int Int (D a)
and so on, all the data are parametrized with a type variable. This variable
is actually used as a field in the very end of a hierarchy:
data D a = D Int a
:
You could add {-# LANGUAGE DeriveFunctor #-}, and then add 'deriving
Functor' to all your data types (or you could of course manually
define your functor instances). Then what you want is just 'fmap
show'.
Erik
On Tue, Oct 2, 2012 at 9:55 AM, Sergey Mironov ier...@gmail.com wrote:
Hi! I have
Hi. Just a brief question. System.IO functions are defined in IO monad
and have signatures like Foo - IO Bar.
Would it be better to have all of them defined as (MonadIO m) = Foo
- m Bar? What are the problems that would arise?
Sergey
___
Haskell-Cafe
Hello list. Do we have a guideline for selecting correct category for
a package being developed? I'd like to choose between Web.MyLib and
Network.MyLib. Or probably just MyLib if I feel ambitious?
Sergey.
___
Haskell-Cafe mailing list
I'm happy to announce a new package called VKHS:
http://hackage.haskell.org/package/VKHS
https://github.com/ierton/vkhs
VKHS provides access to Vkontakte [1] (popular Russian social network)
API methods.
Library can be used to login into the network as a standalone application
(OAuth
ARM guys use native ghc to build arm binaries
2012/8/24 Taylor Hedberg t...@tmh.cc:
Thiago Negri, Fri 2012-08-24 @ 13:27:32-0300:
Is it possible to compile Haskell code targetting a OS/arch that
differs from the one where the compiler (GHC) is running?
No, GHC doesn't currently support
Hi. I need map equivalent for Bijection type which is defined in fclabels:
data Bijection (~) a b = Bij { fw :: a ~ b, bw :: b ~ a }
instance Category (~) = Category (Bijection (~)) where ...
I can define this function as follows:
mapBij :: Bijection (-) a c - Bijection (-) [a] [b] - Bijection
Yes, you are right, I don't really need the second argument. I am not
skilled enough to join the discussion, but I do understand your
solution. Thanks!
Sergey
2012/8/27 Tillmann Rendel ren...@informatik.uni-marburg.de:
Hi,
Sergey Mironov wrote:
I need map equivalent for Bijection type
Hi. Does anybody know anything about Sebastiaan Visser, the maintainer
of Salvia-* packages (web server) ? Looks like his email is dead.
Sergey
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
just what I was looking for, thanks!
2012/8/20 Erik Hesselink hessel...@gmail.com:
Untested, but this should be about right:
osi (Bij f b) = iso (Bij b f)
Erik
On Mon, Aug 20, 2012 at 2:35 PM, Sergey Mironov ier...@gmail.com wrote:
Hi. I'm porting old code, which uses fclabels 0.5. Old
Hi. I'm porting old code, which uses fclabels 0.5. Old fclabels
define Iso typeclass as follows:
class Iso f where
iso :: a :-: b - f a - f b
iso (Lens a b) = osi (b - a)
osi :: a :-: b - f b - f a
osi (Lens a b) = iso (b - a)
Newer one defines iso:
class Iso (~) f where
iso ::
Hi list!
Could you please give me a quick example of navigating throw
Data.Typeable.Zipper built on top of a Rose Tree?
eg. (See ??? in the last line - is my question)
{-#LANGUAGE TemplateHaskell, DeriveDataTypeable, TypeOperators #-}
import Data.Typeable.Zipper
data Tree k a = Tree {
2012/1/8 Sergey Mironov ier...@gmail.com
Hi list!
Could you please give me a quick example of navigating throw
Data.Typeable.Zipper built on top of a Rose Tree?
eg. (See ??? in the last line - is my question)
{-#LANGUAGE TemplateHaskell, DeriveDataTypeable, TypeOperators #-}
import
2011/12/10 Jose A. Ortega Ruiz j...@gnu.org
I'm happy to announce the release of xmobar 0.14.
Xmobar is a text-based, minimalistic status bar for linuxy systems,
written in Haskell. See http://projects.haskell.org/xmobar for
details.
Many, many thanks to the many, many contributors, and
2011/9/30 John Lask jvl...@hotmail.com:
On 30/09/2011 7:15 AM, Sergey Mironov wrote:
Hello. I am reading Programming with Arrows by John Hughes (very
helpful and interesting!), the book has an exercises requiring a
module called Circuits for checking the answer. There should be things
like
Hello. I am reading Programming with Arrows by John Hughes (very
helpful and interesting!), the book has an exercises requiring a
module called Circuits for checking the answer. There should be things
like class ArrowCircuit and various functions related to digital logic
circuits simulation. Does
2011/9/16 Mathijs Kwik math...@bluescreen303.nl:
Do I need any special .el file to use these?
Or commandline arguments to use etags format?
Emacs tells me 'visit-tags-table-buffer: File
/home/mathijs/packages/snap/tags is not a valid tags table'
Please try haskdogs-0.3.
haskdogs -e
should
2011/9/14 Ivan Lazar Miljenovic ivan.miljeno...@gmail.com:
On 14 September 2011 19:18, Sergey Mironov ier...@gmail.com wrote:
Yes, I forgot to mention PATH. I expect somthing like
export PATH=$HOME/.cabal/bin:$PATH
in .bash_profile or similar.
Also, I probably should remove hasktags from
2011/9/14 Ivan Lazar Miljenovic ivan.miljeno...@gmail.com:
Re-cc'ing -cafe:
On 14 September 2011 14:29, yi huang yi.codepla...@gmail.com wrote:
On Wed, Sep 14, 2011 at 11:32 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 14 September 2011 13:27, yi huang
Hi! I am pleased to announce haskdogs - project-level ctag file generator.
haskdogs is a small shellscript-like tool which creates tag file for
entire haskell project directory. It takes into account first-level
dependencies by recursively scanning imports and adding matching
packages to the
Hi. I was searching for info about building ghc on ARM arch. I already
know about [1] approach, and also saw debian binaries [2], but I am
afraid I have to compile ghc by myself this time, since our system
uses incompatible libc, so my question is addressed to gentoo users
and sympathetic :) Did
2011/7/14 John Lato jwl...@gmail.com:
Sorry for the followup, but I forgot about one other important reason
(probably the real reason) for the nullC case in bindIteratee. Note
what happens in the regular case: the iteratee is run, and if it's in
a completed state, the result is passed to the
Hi community, hi John. I find myself reading bindIteratee[1] function
for a several days.. there is something that keeps me away from
completely understanding of the concept. The most noticeble thing is
\nullC\ guard in the definition. To demonstate the consequences of
this solution, let me define
Forgot reply to all
-- Forwarded message --
From: Sergey Mironov ier...@gmail.com
Date: 2011/6/16
Subject: Re: [Haskell-cafe] [iteratee] how to do nothing .. properly
To: John Lato jwl...@gmail.com
Thanks for explanations! /ErrorT String (Iteratee s m) a/ definitely
does
Ok. I've checked iteratee-0.8.3.0 and 0.8.4.0. Results are same.
Sergey
2011/6/2 John Lato jwl...@gmail.com:
Hi Sergey,
I can't explain this; maybe it's a bug in enumWith? I'll look into it.
Thanks,
John
Message: 20
Date: Thu, 2 Jun 2011 02:46:32 +0400
From: Sergey Mironov ier
constraint on enumPure1Chunk, unfortunately.
Thanks very much for reporting this.
John L
On Thu, Jun 2, 2011 at 10:02 AM, Sergey Mironov ier...@gmail.com wrote:
Ok. I've checked iteratee-0.8.3.0 and 0.8.4.0. Results are same.
Sergey
2011/6/2 John Lato jwl...@gmail.com:
Hi Sergey,
I
Hi. Would anybody explain a situation with iter6 and iter7 below?
Strange thing - first one consumes no intput, while second consumes it
all, while all the difference is peek which should do no processing
(just copy next item in stream and return to user).
What I am trying to do - is to write an
, Sergey Mironov wrote:
Hi Cafe. I wonder if it is possible to write a IO putback function
with following interface
putback :: a - IO a - IO a
putback x io = ???
where io is some action like reading from file or socket.
I want putback to build new action which will return x on first call
Hi Cafe. I wonder if it is possible to write a IO putback function
with following interface
putback :: a - IO a - IO a
putback x io = ???
where io is some action like reading from file or socket.
I want putback to build new action which will return x on first call,
and continue executing io
Hello cafe.
Haskell wiki told me about continuation-based parser
Data.Binary.IncrementalGet [1] from binary-strict package. I found the
idea very useful and tried to use it. Original library by Lennart
Kolmodin raises some questions. The lib's main data structures are:
data IResult a = IFailed S
2010/8/8 Stephen Tetley stephen.tet...@gmail.com:
Maybe this paper is close?
Type-safe diff for families of datatypes
Eelco Lempsink Sean Leather Andres Löh
Thanks a lot! Just what I need.. and more trickier than I thought.
They represent any ADT as a tree and use diff algorithm for trees to
Hi Cafe. I am searching for materials on one data type-related problem.
Suppose we have version control system storing values of user-defined algebraic
data type. 'User' (actually, programmer) wants to store his/her data and later
update it by applying patches.
By patch I mean value of some
2010/7/15 Serguey Zefirov sergu...@gmail.com:
2010/7/14 Sergey Mironov ier...@gmail.com:
Hi cafe! I have a question of C-to-Haskell type:)
Imagine web application wich allows users to browse some shared
filesystem located at the server.
Application stores every users's position within
15 июля 2010 г. 2:01 пользователь Victor Gorokhov m...@rkit.pp.ru написал:
You can implement pure pointers on top of Data.Map with O(log n) time:
{-# LANGUAGE ExistentialQuantification #-}
import Data.Map ( Map )
import qualified Data.Map as Map
import Data.Typeable
import
Hi cafe! I have a question of C-to-Haskell type:)
Imagine web application wich allows users to browse some shared
filesystem located at the server.
Application stores every users's position within that filesystem
(current directory or file).
In C this can be implemented with the help of
2010/7/2 Heinrich Apfelmus apfel...@quantentunnel.de:
Sergey Mironov wrote:
Hello list!
I am trying to understand zipper concept using papers like [1] and [2].
Though main idea looks clear, I still have a problem in applying it for
custom data types.
Please help me with deriving Zipper
Hello list!
I am trying to understand zipper concept using papers like [1] and [2].
Though main idea looks clear, I still have a problem in applying it for
custom data types.
Please help me with deriving Zipper-type from
data DTree a = P | D [(a, DTree)]
Looking in [1] ('Zippers via
47 matches
Mail list logo
