Hi Conal,
I'm glad you're bringing this up. I am currently working on FLTK bindings (
github.com/deech/fltkhs). It's main advantage of this toolkit is that it
lets the user deploy apps as a self-contained binary on all platforms.
Right now the work consists of the tedium of binding Haskell to the
Hi all,
I've installed Hoogle but am having issues creating the databases. I first
did: `hoogle data all`, tried a search `hoogle [a] - a and got:
Could not find some databases: default
Searching in:
.
~/.cabal/share/hoogle-4.2.21/databases
Either the package does not exist or has not been
a discussion about what the higher level abstraction should look
like. There's so many choices.
Thanks!
-deech
On Sun, Sep 8, 2013 at 8:20 PM, John Lask jvl...@gmail.com wrote:
On 9/09/2013 7:09 AM, aditya siram wrote:
Hi all,
I'm working on a FLTK [1] GUI binding [2]. The attraction
Hi all,
I'm working on a FLTK [1] GUI binding [2]. The attraction of FLTK is that
it is portable across many platforms, meaning it is easy to:
1. provide a binary for your application that works without installing
anything else. eg. no need to install X on Mac. Just double-click!
2. develop on
Hi all,
I working through a few papers and Oleg's delimited continuation
implementation and I'm wondering how the operators (shift, shift0P,
control, reset, etc) got their name.
-deech
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Wonder what they'd make of bottom :)
Maybe we can also incorporate some tongue-in-cheek tip-of-the-hat to
Shakespeare :
http://www.shakespearesantacruz.org/about/images/dream_34_thaler_web.jpg
-deech
On Wed, Nov 16, 2011 at 6:50 PM, Tom Murphy amin...@gmail.com wrote:
I'm used to (on the east
I just pulled the latest version of HList :
darcs clone http://code.haskell.org/HList
I compiled it with GHC 7.2.1 and I am still running into the same issue the
makeLabels function:
runQ (makeLabels [test1,test2]) = putStrLn . pprint
data Foo_0 deriving (Data.Typeable.Internal.Typeable)
foo_1
, it loaded fine into
GHCI.
-deech
On Fri, Nov 11, 2011 at 1:20 PM, aditya siram aditya.si...@gmail.comwrote:
I just pulled the latest version of HList :
darcs clone http://code.haskell.org/HList
I compiled it with GHC 7.2.1 and I am still running into the same issue
the makeLabels function
I have verified that the issue with the makeLabels function goes away if
I install 7.0.4. I got an extremely large error (~ 5000 lines) when loading
OCamlTutorial.hs. When I've parsed through it, I'll post back. Sorry for
the confusion.
-deech
On Fri, Nov 11, 2011 at 1:33 PM, aditya siram
Thanks for updating the Cabal file. The reason I commented out the
Data.HList.TypeEqO was because I couldn't find it. I grepped the HList
source tree for it and I found references to it only in the following
places:
./Data/HList/RecordD.hs:import Data.HList.TypeEqO
Awesome! The samples now work. Thanks so much for your help.
-deech
On Fri, Nov 11, 2011 at 11:14 PM, o...@okmij.org wrote:
The reason I commented out the Data.HList.TypeEqO was because I
couldn't find it.
My apologies! It turns out I have forgotten to 'darcs add' it. It is
committed
Hi all,
I am exploring OOHaskell and ran into some compilation issues with some of
the samples. I hope this is the right place to report it.
For example OCamlTutorial.hs generates the following error:
../samples/OCamlTutorial.hs:98:3:
Multiple declarations of `foo'
Declared at:
I don't think OP realizes that we *avoid* success at all costs.
-deech
On Sun, Oct 23, 2011 at 9:17 PM, Tom Murphy amin...@gmail.com wrote:
The GUI list could definitely use this type of moderation.
Tom / amindfv
On Oct 23, 2011 9:54 PM, Erik de Castro Lopo mle...@mega-nerd.com wrote:
R J
Non snarky question - what does it need?
-deech
On Fri, Oct 21, 2011 at 12:51 PM, Albert Y. C. Lai tre...@vex.net wrote:
On 11-10-21 03:59 AM, Ivan Lazar Miljenovic wrote:
2011/10/21 Goutam Tmvvo1d_poin...@live.com:
Would you ever see yourself write a web application like Twitter or
I'm afraid you're going to have a lot of OCD's completely miss the point of
your email and annoy you with comments about the quote which you'll then
have to refute.
I'd actually stick with the old comment, remove it completely, include a
short summary with a link to the paper or attribute it to
Hi all,
I would like for the GHCI interpreter to save its environment before
reloading a file and allowed the user to revert back to that state if the
compilation was unsuccessful.
Many times I've changed files, loaded them, hit a compilation error and
needed, for example, the inferred type
:
2011/8/27 aditya siram aditya.si...@gmail.com:
Hi all,
I would like for the GHCI interpreter to save its environment before
reloading a file and allowed the user to revert back to that state if
the compilation was unsuccessful.
That would be awesome. I would like this too.
http
I just had a problem closely related to this on StackOverflow [1]
which was explained beautifully by cammcann.
The problem is that because type CPUFunc cpu is located inside the
definition of the class CPU it creates the illusion that they are
somehow tied together where CPUFunc is somehow in the
What compiler errors are you getting?
-deech
On Fri, Jul 1, 2011 at 12:55 AM, Ruohao Li liruo...@gmail.com wrote:
Hi guys,
I just started learning some Haskell. I want to implement a mean function to
compute the mean of a list. The signature of the function is:
mean :: (Num a, Fractional b) =
Try enabling OverlappingInstances extension by adding this to the top
of the file:
{-# LANGUAGE OverlappingInstances #-}
-deech
On Wed, Jun 29, 2011 at 4:50 PM, Philipp Schneider
philipp.schneid...@gmx.net wrote:
Hi cafe,
in my program i use a monad of the following type
newtype M a = M
Hi all,
Is anyone in the Haskell community doing web development using
delimited continuations? Oleg had a talk on it [1] using Ocaml and CGI
but I haven't heard of anyone taking it further.
-deech
[1]http://okmij.org/ftp/continuations/index.html#shift-cgi
The problem is that the all@(w1:words) pattern-match fails when all is
empty. The quick and dirty fix is:
import Control.Monad.State
import Data.Map
import Debug.Trace
type Prefix = (String,String)
type GeneratorState = State ((Map Prefix [String]),Prefix,[String])
I wonder if it would be useful to be able to download and use only necessary
modules from Hackage. This way if someone writes, say a superior XML parsing
API, and someone else has better generating API, the user can pull just
those modules , write the glue and have the best of both worlds.
On the
Have you considered Dynamic DNS [1]? I haven't personally tried it but
a friend of mine told me it works pretty well.
-deech
[1] http://www.dyndns.com/services/dns/dyndns/
On Fri, May 6, 2011 at 1:07 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
OK, so strictly this is unrelated to
Yes! This is a great idea.
I'm a Haskell enthusiast in St. Louis, MO, USA and have given numerous
talks on Haskell locally at Lambda Lounge[1], a catch-all groups for
functional programmers, and the St.Louis Perl Mongers[2].
I would love to have a dedicated Haskell User Group, but unfortunately
Hi all,
I'm looking to start a Haskell user group in St. Louis, MO. Anyone
Haskellers or people interested in learning Haskell around these
parts?
-deech
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Knot-tying has a page [1].
-deech
[1] http://www.haskell.org/haskellwiki/Tying_the_Knot
On Wed, Mar 16, 2011 at 10:42 AM, Andrew Coppin
andrewcop...@btinternet.com wrote:
On 16/03/2011 03:05 PM, Brent Yorgey wrote:
This kind of knot-tying approach is nice for static graphs.
I think we
A couple of years ago, Lambda Lounge [1] a local group of language
enthusiasts had a shootout [2] where you were supposed to implement a
simple vending machine [3] that took coins and dispensed candy.
With *very* little experience using Haskell I was able to implement a
vending machine server [4]
two sets of
conflicting instructions but I suggest you follow one to completion,
and if it doesn't work, back out the conflicting changes and follow
the other.
-deech
On Fri, Feb 25, 2011 at 7:53 AM, Daniel Díaz danield...@asofilak.es wrote:
El Vie, 25 de Febrero de 2011, 2:34 pm, aditya siram
Possibly HSH[1]?
[1] http://hackage.haskell.org/package/HSH-2.0.3
On Thu, Feb 10, 2011 at 8:44 AM, Thomas Davie tom.da...@gmail.com wrote:
A while ago I remember someone showing me some tool, I *think* ghci that
allowed you to pass it a function of type String - String as an input, and
have
There's the stm-io-hooks [1] package but it looks like it hasn't been
updated in a while.
-deech
[1]http://hackage.haskell.org/package/stm-io-hooks
On Sat, Feb 5, 2011 at 3:46 AM, wren ng thornton w...@freegeek.org wrote:
So I'm working on a project that uses STM to run a lot of things in
Hi all,
The new Synopsis box in the API docs expands beyond the monitor for
functions that have long signatures. An example is the TreeView
documentation [1] in the gtk package.
I have only tested Firefox.
-deech
[1]
Ye gods! A B D [1] language for kids? At least give them a fighting
chance [2] at becoming future developers.
Haskell's immutability is good for mathematics but doing anything else
takes a great deal of up-front patience and perseverance, two very
rare qualities in that demographic if my own
I think that for monads the cleanest way of doing conditional
execution is using 'when' and 'unless' [1] and 'guard' if your type
is a Monoid.
-deech
[1]
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Control-Monad.html#6
On Wed, Jan 26, 2011 at 2:22 PM, Edward Amsden
with a nasty set of nested do statements for case expressions.
On Wed, Jan 26, 2011 at 3:32 PM, aditya siram aditya.si...@gmail.com wrote:
I think that for monads the cleanest way of doing conditional
execution is using 'when' and 'unless' [1] and 'guard' if your type
is a Monoid.
-deech
Hi,
I've taken a look at your code and refactored a bit to use Haskell's
list functions. The functionality should be identical.
One of the advantages of using the list functions is that you don't
have to worry about an out-of-bounds exception - which is what your
limIndex function corrects for.
Guy Steele did the keynote on parallelism [1] at the Strange Loop [2]
conference in which he said that he could do it over Fortress [3]
would have been modeled on Haskell rather than Fortran. The relevant
portions are between 49:36 - 49:50. Thought it might interest readers
of this list.
-deech
Thanks for the great software! I tried to install manatee from Hackage
and got the following error:
Configuring manatee-core-0.0.7...
Warning: This package indirectly depends on multiple versions of the same
package. This is highly likely to cause a compile failure.
package uniplate-1.5.1 requires
(ghc-7.0.1 have bug)
Thanks,
-- Andy
aditya siram aditya.si...@gmail.com writes:
Thanks for the great software! I tried to install manatee from Hackage
and got the following error:
Configuring manatee-core-0.0.7...
Warning: This package indirectly depends on multiple versions of the same
-- untested and won't work on an infinite list
last :: [a] - a
last = head . reverse
-deech
On Fri, Dec 31, 2010 at 2:39 PM, Aaron Gray aaronngray.li...@gmail.com wrote:
Is there an easy Haskell function that gets the last Char of a [Char] or
String ?
Many thanks in advance,
Aaron
I don't think record field disambiguation what you're after. My apologies.
-deech
On Thu, Dec 30, 2010 at 11:20 AM, aditya siram aditya.si...@gmail.com wrote:
Take a look at the record field disambiguation [1] extension to GHC.
It sounds like what you're looking for.
-deech
[1]
http
Take a look at the record field disambiguation [1] extension to GHC.
It sounds like what you're looking for.
-deech
[1]
http://www.haskell.org/ghc/docs/6.12.2/html/users_guide/syntax-extns.html#disambiguate-fields
On Thu, Dec 30, 2010 at 11:01 AM, Aaron Gray aaronngray.li...@gmail.com wrote:
Check out the Time Profiling of the Chapter 25 of Real World Haskell
[1] for a detailed explanation.
-deech
[1] http://book.realworldhaskell.org/read/profiling-and-optimization.html
On Wed, Dec 29, 2010 at 6:48 PM, Aaron Gray aaronngray.li...@gmail.com wrote:
What are these comments for in
Although I don't understand it myself Oleg's deepest functor [1] seems
to be what you're looking for.
-deech
[1] http://okmij.org/ftp/Haskell/deepest-functor.lhs
On Tue, Dec 28, 2010 at 1:23 PM, Edward Amsden eca7...@cs.rit.edu wrote:
Hello all:
I'd like to right a function that could take a
The problem here is that unfortunately the Haskell type system cannot
do coercion.
There is however a toRational method Real typeclass that converts
instances of Num and Ord to Rational data type and a fromRational
method that converts back. So your code could be:
myplus :: (Real a, Real b) = a
If you don't want go the unsafePerformIO route you might use implicit
parameters [1]. You can add an hidden parameter to a function like:
{-# LANGUAGE ImplicitParams #-}
func1 :: (?dbg :: Bool) = String - String
func1 s = if ?dbg then (func2 (func1 : ++ s))
else s
func2 :: (?dbg ::
I don't know the formal definition, but dependent types seem analogous
to checking an invariant at runtime.
-deech
On Tue, Dec 21, 2010 at 5:53 AM, Patrick Browne patrick.bro...@dit.ie wrote:
Hi,
In a previous posting[1] I asked was there a way to achieve a proof of
mirror (mirror x) = x
in
I think it is giving you the error because you the fmap in your code is
operating on the IO monad and not the List monad. In order to get it to
work, you can remove the IO layer with = as below:
f :: [Int] - IO [Int]
f lst = do return lst
main = do let lst = f [1,2,3,4,5]
lst = return
I have the same problem.
-deech
On Fri, Dec 17, 2010 at 8:01 AM, Eugene Kirpichov ekirpic...@gmail.com wrote:
Hello.
For a couple of friends of mine, hackage.haskell.org happens to
resolve to something strange (parked domain), though haskell.org works
ok. This might be something to tell to
the domain name haskell.org.
John
On Fri, Dec 17, 2010 at 12:05 PM, aditya siram aditya.si...@gmail.com wrote:
I have the same problem.
-deech
On Fri, Dec 17, 2010 at 8:01 AM, Eugene Kirpichov ekirpic...@gmail.com
wrote:
Hello.
For a couple of friends of mine, hackage.haskell.org
] and hands it off to the
second fmap
2. The second fmap applies the (+1) function to every element of the list.
3. The second fmap re-wraps the elements back into a [Int]
4. The first fmap re-wraps and returns the transformed [Int] into an IO
[Int].
-deech
On Fri, Dec 17, 2010 at 3:27 PM, aditya
Warning! Incredibly hacky Haskell coming up!
Here's some code that seems to do the near same thing as your Python.
Below it is some sample output. A couple of differences are that the
secret number should be between 1 and 10, and whenever the computer
tries guess it just picks a random number
Hi all,
I am having some issues building Gtk2Hs on Windows 7. It completes
compiling the whole thing and then errors out with this message:
Registering gtk-0.12.0...
setup.exe: WARNING: cache is out of date: c:/Program Files/Haskell
Platform/2010.2.0.0\lib\package.conf.d\package.cache
use 'ghc-pkg
Hi all,
I'd like to load a Haskell program into GHCi A and then connect to
GHCi A from GHCI B. Is there any way to do this? This would be handy
(handier than telnet) for demoing and debugging server applications
that use shared resources.
-deech
___
Hi all,
When I try to cabal install vacuum-cairo, I get the following error message :
Resolving dependencies...
Configuring vacuum-cairo-0.4.1...
Preprocessing library vacuum-cairo-0.4.1...
Building vacuum-cairo-0.4.1...
[1 of 1] Compiling System.Vacuum.Cairo ( System/Vacuum/Cairo.hs,
System/Vacuum/Cairo.hs
A patch file is included.
-deech
On Sat, Dec 11, 2010 at 4:04 PM, aditya siram aditya.si...@gmail.com wrote:
Hi all,
When I try to cabal install vacuum-cairo, I get the following error message :
Resolving dependencies...
Configuring vacuum-cairo-0.4.1...
Preprocessing
HJScript[1] ?
[1] http://hackage.haskell.org/package/HJScript-0.5.0
On Fri, Dec 10, 2010 at 9:52 AM, jean-christophe mincke
jeanchristophe.min...@gmail.com wrote:
Hello,
I have just discovered WebSharp, a .Net product for web development that
allows you to write client code in F# and have it
What the heck does a full torque of the electrical bus riser mean?
Don't get me wrong, it sounds badass.
-deech
On Sat, Dec 4, 2010 at 12:03 PM, Antoine Latter aslat...@gmail.com wrote:
Thanks, Ross.
Here's a Reddit post:
That was a great explanation of phantom types and type-families. I'm
just getting started on understand type families and I was wondering
why you didn't use data families in the truth table structure:
type family Join a b
type instance Join Safe Safe = Safe
type instance Join Safe Unsafe =
Not necessarily, there might be some critical jar that cannot be
accessed because Haskell can't talk to the JVM.
-deech
On Wed, Nov 10, 2010 at 2:47 PM, Christopher Done
chrisd...@googlemail.com wrote:
On 10 November 2010 21:42, Padma pa...@sraoss.com wrote:
We are looking for a entry level
Googling haskell java integration brings up a number of references
to Lambada. Is this project still alive?
-deech
On Wed, Nov 10, 2010 at 4:16 PM, Tom Davies tgdav...@gmail.com wrote:
On 11/11/2010, at 7:42 AM, Padma wrote:
We are looking for a entry level Haskell programmer who has
I'm no compiler writer but as a layperson I'd guess for that you'd at least
need a program that could determine if two constructs are equivalent, the
Haskell and Python list comprehension example from 2 emails ago. The only
way I can think to do that is to parse some source in language X and see
Not a city, but perhaps an island [1]. Sorry, it had to be done.
-deech
[1] http://en.wikipedia.org/wiki/Java
On Thu, Nov 4, 2010 at 11:51 AM, Stephen Tetley stephen.tet...@gmail.comwrote:
ZF Expressions (aka list comprehensions) date to at least David
Turner's KRC (St. Andrews Static
I understand your frustration at not having free tested libs ready-to-go,
Java/any-other-mainstream-language programmers tend to expect this and
usually get it.
If a lack of libs is a dealbreaker for you and you want to use a functional
programming language with some of Haskell's advantages (like
Are there any C libraries that you can use? I did a google search on email
client in c and failed in an epic fashion but I figure parts of sendmail or
mutt could be used.
-deech
On Wed, Oct 27, 2010 at 12:55 PM, Christopher Done chrisd...@googlemail.com
wrote:
On 27 October 2010 19:46, Thomas
Careful. That might draw some unwarranted comparisons :)
-deech
2010/10/27 Richard O'Keefe o...@cs.otago.ac.nz
On 28/10/2010, at 4:38 AM, Günther Schmidt wrote:
As we are 10+ years now still without one of the most essential libraries
any programming language needs I guess it's not that
I was fooled :). Some indication of that on the page would be very helpful.
-deech
On Sun, Oct 24, 2010 at 5:29 AM, Bulat Ziganshin
bulat.zigans...@gmail.comwrote:
Hello aditya,
Sunday, October 24, 2010, 8:05:55 AM, you wrote:
HsLua page is nothing more but my fantasy about future HsLua
I did that, the slash is a typo. I was looking at the Lua reference manual
and it says that lua_loadfile uses lua_load[1] which outputs 0 if
successful.
Appreciate the quick response.
-deech
[1] http://www.lua.org/manual/5.1/manual.html#lua_load
On Sat, Oct 23, 2010 at 2:49 AM, Gracjan Polak
mean that definitions are created through execution.
Attached is a simple example, note that there is no proper error checking -
you probably want to check the results rather than pattern matching against
constants.
Thanks,
Claude
On 23/10/10 03:21, aditya siram wrote:
Hi all,
I'm
Hi all,
The HsLua page [1] says that Int,Double,String,Bool,[a] and [(a,b)] types
can be converted to and from Lua values. However the on hslua API page I
don't see a StackValue instance [2] for [a] or [(a,b)]. Am I missing
something?
-deech
[1]
Hi all,
I'm having some issues calling Lua functions from Haskell. I have the
following in Haskell2Lua.lua:
function hello ()
return hello world
end
And my Haskell file Haskell2Lua.hs looks like this:
import qualified Scripting.Lua as
Lua
main =
do
l -
Lua.newstate
Lua.openlibs
l
An honest list of cons mentioned up-front is a great idea and would attract
me to a language. It shows me that the community is grounded, active ,
pragmatic and helpful.
-deech
On Sun, Oct 17, 2010 at 1:45 PM, cas...@istar.ca wrote:
How about a bullet list of Haskell's features (maybe pros
I imagine that getting Haskell GUI libraries set and playing nice with
the native GTK libs is a pain on Windows.
That said, I know that Haskell has very nice Lua bindings and Lua has
pretty mature GTK bindings. Has anyone tried developing their UI in
Lua with Haskell doing all the heavy lifting?
How do you guys indent long function arguments? I run into this all
the time with the 'maybe' function which takes 3 arguments:
maybe :: b - (a - b) - Maybe a - b
I usually end up doing things like (pretend the arguments are aligned
if you're not using a monospace font to view this):
maybe
I haven't read this thread completely, but if someone else hasn't
beaten me to it, there are *lots* of Haskell idioms spelled out on the
Haskell Wiki [1] cleverly hidden under the category Style.
-deech
[1] http://www.haskell.org/haskellwiki/Category:Style
On Fri, Sep 24, 2010 at 5:24 PM, Vo
Hi folks,
I just did a presentation on monads and how to use the basic ones
(IO,Reader,Writer,State,ReaderT,WriterT,StateT) in practice. I thought
the community might want to look at it. Is there some place I can
upload the slides (it's just PDF)?
-deech
://www.reddit.com/r/haskell/
On Fri, Sep 17, 2010 at 20:31, aditya siram aditya.si...@gmail.com wrote:
Hi folks,
I just did a presentation on monads and how to use the basic ones
(IO,Reader,Writer,State,ReaderT,WriterT,StateT) in practice. I thought
the community might want to look at it. Is there some place
Ok, I feel dumb. I have the slides hosted elsewhere now and I can't
figure out how to change the Reddit link. Any help is appreciated!
-deech
On Fri, Sep 17, 2010 at 1:16 PM, Matthias Kilian k...@outback.escape.de wrote:
On Fri, Sep 17, 2010 at 12:54:29PM -0500, aditya siram wrote:
Slides
/
If the moderators could delete it for me I would appreciate it.
And of course any feedback on the slide is welcome!
-deech
On Fri, Sep 17, 2010 at 2:47 PM, Heinrich Apfelmus
apfel...@quantentunnel.de wrote:
aditya siram wrote:
Ok, I feel dumb. I have the slides hosted elsewhere now and I can't
figure
Hi all,
I was trying to read the documentation on monoids and the Sum type.
When I searched Hayoo for Monoid or Data.Monoid, the Data.Monoid
module in base did not show up - Hoogle found it without a problem.
The same goes for the Sum type, Hayoo does not seem to find it but
Hoogle does.
-deech
I'd like to do it. Any tips?
-deech
On Thu, Sep 9, 2010 at 9:35 AM, Malcolm Wallace malcolm.wall...@me.com wrote:
I miss the Haskell Weekly News.
The most recent issue was published on 8th March 2010. The volunteer who
produces it claimed on 27th April that he would be back in action soon,
It does make a difference in certain cases. For a 2MB binary to be trivial
it assumes that (1) you are in a developed country (2) you are using a
landline internet connection and not going through your cell-phone company,
although this gap is closing fast.
I feel this India whenever I visit
When I tried this it never returned, there was no error.
-deech
On Thu, Aug 12, 2010 at 4:04 PM, Yitzchak Gale g...@sefer.org wrote:
Pierre-Etienne Meunier wrote:
Does it still work with :
writeFile output $! process inp
You're right, that changes things. Then the program prints:
loop
at 4:33 AM, wren ng thornton w...@freegeek.org wrote:
aditya siram wrote:
Thanks all for you suggestions!
Upon further reflection I realized that my audience is more pragmatic than
theoretical. Instead of emphasizing how monads are constructed and the
monad
laws I think I want to dive right
Yes. I find that out of 10 people I train, only about 2 pick it up
and run with it. I'm starting to believe you are either wired for
functional programming, or you're not.
I disagree that only certain brains are wired for FP. I think your
experience can be explained by people's inability
Hi all,
I was experimenting with monad transformers and realized that the stacking
order of the monads can remain unknown until it is used. Take for example
the following code:
import mtl Control.Monad.State
import mtl Control.Monad.Writer
import mtl Control.Monad.Identity
test :: (MonadWriter
a = Leaf a | Node (Tree a) (Tree a) deriving Show
enumTree n (Node a b) =
let (n', a') = enumTree n a in
let (n'', b') = enumTree n' b in
(n'', Node a' b')
enumTree n (Leaf x) = (n+1, Leaf n)
aditya siram schrieb:
Hi all,
I am doing an Intro To Monads talk in September [1]. The audience
I really like the color scheme and the Javadoc looking frames.
One suggestion I can make is to have the index show all the functions with
type signatures without having to pick a letter. A lot of times I'll be
looking for a function of a certain signature as opposed to a name. Indeed
an index of
I think what the OP is asking for is a killer application of Haskell - Ruby,
for example, is great for web programming because of Rails.
The Haskell community is somewhat unique in that it has many killer apps and
that confuses people. It's great for version control (Darcs), window
managers
Hi folks,
I just installed the latest Haskell Platform on a fresh Ubuntu Lucid machine
and I had to install the following packages to satisfy Open GL:
libgmp3-dev,libgl1-mesa-dev, libglu1-mesa-dev, freeglut3-dev
Just thought you might want to document that on the Haskell Platform page.
-deech
This is slightly OT, but is there a way of getting some Emacs keybindings in
Leksah?
-deech
On Wed, Aug 4, 2010 at 1:01 PM, Hamish Mackenzie
hamish.k.macken...@googlemail.com wrote:
I use Leksah and have done since I started contributing to it. The best
way to make it work for you is to use
Hi all,
I am doing an Intro To Monads talk in September [1]. The audience consists
of experienced non-Haskell developers but they will be familiar with basic
functional concepts (closures, first-class functions etc.).
I am looking for suggestions on how to introduce the concept and its
pretty quickly but it was something for me to hold onto while internalizing
the concepts. Is there a danger in telling people this?
-deech
On Tue, Aug 3, 2010 at 5:36 PM, Dan Piponi dpip...@gmail.com wrote:
On Tue, Aug 3, 2010 at 2:51 PM, aditya siram aditya.si...@gmail.com
wrote:
I am doing
Agreed. In fact I have the most trouble imagining what Haskell code looked
like before monads.
-deech
On Mon, Aug 2, 2010 at 6:34 PM, Richard O'Keefe o...@cs.otago.ac.nz wrote:
The thing that I found hardest to understand about monads is that
they are used to obtain very special consequences
Why are the Takusen module links on Hackage dead? I would also like to take
this opportunity to request a Takusen tutorial and to thank you for this
innovative library.
-deech
On Sun, Aug 1, 2010 at 12:59 PM, Jason Dagit da...@codersbase.com wrote:
On Sun, Aug 1, 2010 at 9:10 AM, David
I meant the links to the API docs.
-deech
[1]
http://hackage.haskell.org/packages/archive/Takusen/0.8.6/doc/html/Database-ODBC-Enumerator.html
On Sun, Aug 1, 2010 at 1:46 PM, Don Stewart d...@galois.com wrote:
aditya.siram:
Why are the Takusen module links on Hackage dead?
Hmm. The links
Each monad implementation is different. In the case of the State monad your
'execState' call extracts a non-monadic value.
Of the basic monads I found the State monad the most confusing because of
the complicated way in which it threads state through the computation. In
the end, desugaring the
I didn't realize the State monad wasn't part of the base install. Any
particular reason for this?
-deech
On Tue, Jul 27, 2010 at 10:24 PM, Ivan Miljenovic ivan.miljeno...@gmail.com
wrote:
On 28 July 2010 13:17, michael rice nowg...@yahoo.com wrote:
See below. Lot's of warnings. Is the
That's just cool. I now reverse my original statement - 'flip' does have
it's place in the pantheon of standard Haskell functions.
-deech
On Mon, Jul 26, 2010 at 3:42 PM, Nils m...@n-sch.de wrote:
On 26.07.2010 08:33, David Virebayre wrote:
listeEtagTot = concatMap (`listeEtagArm`
It seems confusing to alias a function without adding any functionality just
to make things slightly easier to read. Instead wouldn't it be better if
this idiom were documented on haskell.org?
-deech
On Mon, Jul 26, 2010 at 4:47 PM, Vo Minh Thu not...@gmail.com wrote:
2010/7/26 Vo Minh Thu
1 - 100 of 172 matches
Mail list logo
