lly appreciate it if anyone who knows about the Haskell LLVM
bindings or about the GHC LLVM backend could give any advice regarding what
sort of work needs to be done with the LLVM bindings to make them more
appropriate for use within GHC, or how to approach modifying the existing
LLVM backend
rce -> Int -> IO [AL.Buffer]
unqueueBuffers source nbuffers =
allocaArray nbuffers $ \ptr -> do
alSourceUnqueueBuffers source (fromIntegral nbuffers) ptr
peekArray nbuffers ptr
I just started using OpenAL, so I might be misunderstanding how this is
sup
7;s off to you, sir. This is kind of interesting -- I would
normally consider this indexing transformation as an approach for
defeating memoization, yet in this case it serves as the key that
makes the broader memoization possible, lifting it up a level.
Thanks!
Alex
P.S. A side benefit of this ap
On Tue, Nov 13, 2012 at 08:06:59AM -, o...@okmij.org wrote:
> Alex Stangl posed a problem of trying to efficiently memoize a
> function without causing divergence:
> ...
> But the problem can be fixed: after all, f k is a list of integers. A
> list is an indexable collection. L
On Mon, Nov 12, 2012 at 02:52:28PM +0100, Daniel Fischer wrote:
> The problem, Alex, is that
>
> f k = if k > 0
> then f (a!0)
> else 0 : f 1
>
> is strict, it needs to know the value of (a!0) to decide which branch to
> take.
> But the constructio
On Mon, Nov 12, 2012 at 08:36:49AM +0100, Bas van Dijk wrote:
> On 12 November 2012 04:50, Alex Stangl wrote:
> > I'm stymied trying to figure out why the program below blows up with
> > <<>> when I use "f 0"
> If you replace the a!0 in f by its valu
I'm stymied trying to figure out why the program below blows up with
<<>> when I use "f 0" for building the array, but if I substitute
g or h in place of f, they work fine. Is this a bug or am I overlooking
something? I am using GHC 7.4.2.
Thanks,
Alex
P.S. Forg
On Thu, Oct 25, 2012 at 06:34:53PM -0400, Jake McArthur wrote:
> I golfed a bit. :)
>
> sequence <=< filterM (const [False ..])
I was thinking of golfing this myself tonight, but probably
wouldn't have come up with this. Thanks for sparing me the e
n is taken from one of the N
> lists.
combos [] = [[]]
combos ([]:ls) = combos ls
combos ((h:t):ls) = map (h:) (combos ls) ++ combos (t:ls)
Drop last element if you don't want to include the empty set. It
wouldn't be as elegant, but you can t
[a] -> [a] -> [a])) (typeOf
([1,2,3] :: (Typeable a, Num a) => [a]))
I guess funResultTy doesn't work when polymorphism is involved..
Perhaps I could just use the ghc-as-a-library stuff to parse and
typecheck code - would that be the way forward?
Any p
n is cheap so one doesn't necessarily
need to use thread pools like in some other languages. Now I can play with
those variations without distraction from long pauses. And I'll grab your
latest from github and try that out.
Thanks!
Alex
On Mon, Oct 8, 2012 at 6:41 PM, Jamie Turner wr
idea what might be causing the idle time? The long pauses are
consistently 38-40ms, maybe that points to some aspect of CPU
scheduling, leaving the program idle for some time?
I can put the code on github if it would help.
Many thanks!
Alex
[1] http://hackage.haskell.org/package/scalable-server-
nd benchmark (using
Criterion) and put it all on github, along with the latest version of
the list index code.
http://github.com/astangl/list-index
Regards,
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ion.
> Now, besides the code and the description of the code, I know we're not
> English majors, but what do you think of the overall tone, pacing, etc.? Is
> it entertaining? Is it humorous? Is it boring? Is it offensive? Is it too
> brief or too labo
> superweapons. What do you guys think of my tutorial, Haskell for the Evil
> Genius <http://www.yellosoft.us/evilgenius/>?
Hopefully you'll get more feedback here, although my recent post here
soliciting feedback netted me nothing.
FWIW, my feedback is below.
Alex
Under Dec
index too much.) I'll publish it on
hackage (or at least github) if people think it's useful. It sped up
the program I initally wrote it for enormously.
Thanks,
Alex
{- |
Module : ListIndex
Description : list indexer, providing fast random list lookup
Copyright : (c) Alex Stangl 2
Var Ident | Lam Ident Expr | App Expr Expr | Plus Expr Expr
> eval e =
> case e of
> ...
> Plus e1 e2 ->
> case (eval e1, eval e2) of
> (VInt x1, VInt x2) -> VInt $ x1 + x2
> _ -> error "illegal addition"
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
along, the more awesome it will be.
We hope to see you there!
Cheers,
Alex Mason and Ivan Miljenovic
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
lement the DTalaC style:
syntactic and compdata. Alternatively, I can write the common code
myself.
Does anyone have recommendations for which one to use, and any
materials for learning to use them?
--
Alex R
___
Haskell-Cafe mailing list
Ha
isn't called unless all threads have released it, I think).
Cheers,
Alex
On 8 February 2012 15:02, Clark Gaebel wrote:
> Sounds hairy. Is there any way to get reference counting garbage
> collection in Haskell?
>
> On Tue, Feb 7, 2012 at 9:26 AM, L Corbijn wrote:
>
>>
Short answer: no, and what it gives is quite different.
Long answer:
Erlang gives me two things that are hard to replicate:
1. firm-realtime performance, even at high load: the distributed GC is very
nice
2. a very well defined model for handling, and recovering from failure
Hot code reload is
teric, but it's nice for static source analysis - and
when someone decides they want to compile a new language to the ERTS, the
package is ready...
Regards,
Alex Kropivny
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.o
ince first uploaded.
I would like to take over maintenance of the package, and upload the fix
ASAP.
Regards,
Alex Kropivny
[1] https://github.com/amtal/CoreErlang/tree/0.0.2
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailma
> That's interesting, have you ever worked on interfacing Erlang with
> Haskell?
>
> BTW, Twitter switched to Scala, so obviously their initial choice of Ruby
> end up invalidated.
>
>
> 2011/10/21 Alex Kropivny
>
>> Let's look at this from a high, project mana
Let's look at this from a high, project management level. Twitter ran on...
Ruby initially? Facebook ran on PHP.
Immediately this tells me that programming language choice wasn't a factor
in their success. One succeeded in building a large throughput system with a
"slow" language, the other succee
I couldn't find one on hackage that isn't better described as a RegEx
library.
I'm looking for things like minimization, completion, etc. kinda like
http://www.cis.upenn.edu/~cis639/docs/xfst.html
However, I may have just missed it.
--
Latter wrote:
> On Mon, Aug 1, 2011 at 10:51 AM, Alex Clemmer
> wrote:
> > Hi Haskell people,
> >
> > I've been snooping through various mailing lists and the current Haskell
> > implementation of regular expressions and I was wondering if there has
> b
d this inquiry. I considered dropping it in the main
haskell list, but wasn't sure how people would respond.
--
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
not and then behaves differently. While amusing,
I'd rather not.
On Wed, Jun 22, 2011 at 3:42 AM, Rogan Creswick wrote:
> On Tue, Jun 21, 2011 at 11:59 PM, Alex Rozenshteyn
> wrote:
> > From looking at Yi's code, there seems to be a hard-coded list of
> arguments
> > t
>From looking at Yi's code, there seems to be a hard-coded list of arguments
to pass to ghc. A hack would be to recompile Yi with the arguments to use a
different package database...
On Wed, Jun 22, 2011 at 2:32 AM, Rogan Creswick wrote:
> On Tue, Jun 21, 2011 at 6:55 PM, Alex
Funny, I didn't hear anyone say "Candlejack". What abou
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
anyone gotten a similar setup to work, or does anyone have any
suggestions?
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
than last year.
-- Alex Mason
--
Attention all Australasian Haskellers!
After last year’s fantastic turnout for the first Australian Haskell Hackathon
- AusHac 2010 - we’ve decided to organise another. As it’s r
t, May 28, 2011 at 6:17 AM, Brandon Allbery wrote:
> On Sat, May 28, 2011 at 05:12, Alex Kropivny
> wrote:
> > Regardless of how crazy it sounds, an idea from Joe Armstrong is worth
> > seriously thinking over.
>
> Possibly, but this is just another manifestation of
Regardless of how crazy it sounds, an idea from Joe Armstrong is worth
seriously thinking over.
This has bugged me before: think about how we design and write code as
project size, or programmer skill grows. You start with composing statements
inside a single function; later, you start to compose
takes an approach closer to what
Control.Parallel does, but it's not a graceful, and IMO not as easy to use.
Hope that helps. I've been having a lot of fun over the last few weeks playing
with OpenMP for a university assignment, and I've got to say I greatly prefer
th
settled on the
Producer/Transformer/Consumer trilogy.
I'd love to hear thoughts on the issue, especially from David.
Cheers,
Alex Mason
On 06/05/2011, at 20:17, Maciej Marcin Piechotka wrote:
> On Thu, 2011-05-05 at 21:15 -0700, David Mazieres wrote:
>> Hi, everyone. I'm pl
enjoy yourself, registration
comes with a money-back guarantee!
Hope to see you there,
-- Alex Mason and Ivan Miljenovic, AusHac organisers
P.S: If you have received this email directly, it is because you have shown
previous interest in AusHac by signing up via the previous signup. If you
Thank you, everyone, for the suggestions.
On Mon, Mar 21, 2011 at 12:28 PM, Johannes Waldmann <
waldm...@imn.htwk-leipzig.de> wrote:
> Alex Rozenshteyn gmail.com> writes:
>
> > as part of a larger project of porting
> > http://www.cs.jhu.edu/~scott/pl/book/dist/ from
a reference.
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Does anyone know the current maintenance status of the X11 package? I emailed
Spencer Janssen a number of months ago and never heard back. So, I'll put
this here in case any one else runs into it or can get it to the right place.
This is a proposed bug fix for a problem I ran into using xmonad c
I've copied this from
http://stackoverflow.com/questions/5010267/haskell-abstracting-a-genetic-algorithm
as someone suggested that it might spark an interesting discussion
I'm new to the world of Haskell programming and I'm cutting my teeth
on a simple genetic algorithm for finding good solution
parsing library. Do you have an idea what I could use? Or how
> to solve it from scratch in a few lines?
>
> Sebastian
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
livered to
mailing list with error that google mail server couldn't connect to
haskell.org's mail server.
If somebody could help me with this problem, please contact me - I'll
provide more details on this issue
--
With best wishes, Alex Ott, MBA
http://alexott.blogspot.com/
ing list archive at Nabble.com.
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
o git/gist or
whatever) but would be amazing for learning "good" Haskell if it got off the
ground!
On Mon, Jan 3, 2011 at 8:19 AM, Ertugrul Soeylemez wrote:
> Alex Kropivny wrote:
>
> > Could something like code abstraction be done instead?
> >
> > Haskel
Could something like code abstraction be done instead?
Haskell lends itself to solving problems in really generic, high level ways
that reveal a LOT about the underlying problem structure. Through some
combination of descriptive data types, generic type classes, and generic
helper functions... You
es another compilation error.
I am using ubuntu maverick 32-bit, with ghc-6.12.1 and cabal-install 0.8.2.
The ghc was installed from the package repository. Cabal was installed
using:
cabal-install cabal
Alex.
___
Haskell-Cafe mailing list
Haskell-Cafe
ub9fad.xml"
> writeFile "test" $ renderTagsOptions renderOptions{optMinimize = const
> True}
> $ modif soup
>
> modif [] = []
> modif (x@(TagOpen "Content" []):TagText _m : xs) = x : TagText "modified"
> : modif xs
> modif (x:
hat's the proper way to do this?
Also, I'd like to print out my Day in this format: 12/4/1999 what's the
Haskell way to?
Thanks for the help.
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
so that's what I
> think you should look into.
>
> - Jake
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
--
Alex R
code provided I used that. I'm planning to
port the code *after* I have the assignment finished.
On Fri, Oct 8, 2010 at 11:18 PM, wren ng thornton wrote:
> On 10/8/10 5:46 PM, Thomas DuBuisson wrote:
>
>> Alex,
>>
>> The containers library can do this already - the
Does there exist a library which allows me to have maps whose elements are
maps whose elements ... with a convenient syntax.
Alternatively, does there exist a library like Data.Tree where forests are
sets rather than lists?
--
Alex R
r my VPS's resources), but the
docs are always available:
Documentation: http://atomo-lang.org/docs/ (work-in-progress)
Repository: http://darcsden.com/alex/atomo
Examples: http://darcsden.com/alex/atomo/browse/examples
I recommend the generators example if you want some mind-bending, or h
as "lazy evaluation
with memoization"
I understand that
> fib50 = slowFib 50
will take a while to run the first time but be instant each subsequent call;
does this count as memoization?
(I'm trying to understand "Purely Functional Data Structures", hence
The previous AI challenge (tron) was a lot of fun. I suspect the
experience they gained from running the last one, will make this an
exciting contest.
Haskell fared well in the last contest, despite it favouring fast
C/C++ implementations due to a focus on classic minimax/pruning. The
current chal
fer to use the
> "sample" function for this purpose, as well as the "sampleFrom" function in
> place of runRVar/runRVarT. GHCi does not display the "sample" functions'
> types properly - they are defined for RVarT as well as for all Distribution
> ins
rying to fill in the final place of runRVar
> :t runRVar (replicateM 20 flipCoin)
runRVar (replicateM 20 flipCoin)
:: (RandomSource m s) => s -> m [Bool]
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://w
erent about using this approach with
implicit parameters, or am I probably just doing something wrong?
P.S. I decided to ask this here instead of in the xmonad mailing list
because I feel like this is a question about haskell that was only slightly
inspired by my use of xmonad.
--
A
is just a
> point in case, but it applies generally.
>
> any comments?
>
> andrew
>
>
> On Fri, 2010-07-16 at 17:44 -0400, Alex Rozenshteyn wrote:
> > More like buttonActivated [1].
> >
> >
> > Has it been decided that button-specific events are going t
3
x4 = e4
in do s5
s6
HTH,
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
n they are executed in that order. I think other
> languages don't make this easy.
I first encountered monads in OCaml. And the concept exists in other languages,
although maybe not always explicitly by that name.
Good luck, should be a good talk,
Alex
_
fe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
? Would you try to include b / a, too, even
though some values of a may be zero?
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
d 0 or 1 to 0 or 2, your possible answers are [0,2,1,3].
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
[1]
> http://www.haskell.org/gtk2hs/docs/current/Graphics-UI-Gtk-Abstract-Widget.html#v%3AexposeEvent
>
>
> On Fri, Jul 16, 2010 at 11:36 AM, Alex Rozenshteyn
> wrote:
> > I recently started playing around with gtk2hs.
> > I noticed that `onClicked`, `afterClicked`, etc.
ality.
Am I simply being blind?
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
n't rendered
> >correctly.
>
> I can't see that - perhaps it has been fixed already.
Check the failure codes for hSeek. It was still there in the HTML
version, at least, when I checked this morning.
Thanks,
Alex
___
Haskell-Cafe mai
, but that it
is a reasonable policy, since, as you point out, it's a matter
of ongoing debate. What I don't understand is why for y /= 0,
0**y would be undefined. Maybe the discontinuity at zero is
undesirable.
Alex
___
Haskell-Cafe mai
act terminates abnormally, and then a secondary exception occurs during
the closing of the handle. Oftentimes systems lose the primary exception
and propagate out the secondary exception, whereas in reality we may be
more interested in the original primary exception.
25. In section 41.4.4, bullet before isPermissionError isn't rendered
correctly.
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
using the previous form, you we still need you to
fill out this new 2.0 version of the sign up form
If you have questions, please feel free to email me or Ivan (our addresses are
the reply-to addresses for this email... I hope), or talk to us (Axman6, ivanm)
on #haskell.
Cheers,
Alex Mason
ng the building phase. The exception was:
ExitFailure 1
On Mon, Apr 5, 2010 at 11:25 AM, Daniel Fischer wrote:
> Am Montag 05 April 2010 17:19:35 schrieb Alex Rozenshteyn:
> > Anyone?
>
> "base" isn't listed among the build-depends of the executable, so the
> obvious t
Anyone?
On Wed, Mar 31, 2010 at 9:18 PM, Alex Rozenshteyn wrote:
> $ ghc-pkg check
>
> outputs nothing
>
> $ ghc-pkg list unix
> /var/lib/ghc-6.12.1/package.conf.d
>unix-2.4.0.0
> /home/alex/.ghc/x86_64-linux-6.12.1/package.conf.d
>
> "unix" appears to
Looking over the random-fu package, I think it might have what I'm looking
for (and a lot that I'm not).
On Sat, Apr 3, 2010 at 6:27 PM, Gökhan San wrote:
> Alex Rozenshteyn writes:
>
> > The Rand monad you linked seems to be a step in the right direction
> >
e >>= sex)
> http://blog.ertes.de/
>
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Does haskell have a way of using /dev/random to generate random *things*?
Currently I'm just reading the data into a byte string, converting it into
bits, and keeping track of it in the state monad.
--
Alex R
___
Haskell-Cafe mailing
$ ghc-pkg check
outputs nothing
$ ghc-pkg list unix
/var/lib/ghc-6.12.1/package.conf.d
unix-2.4.0.0
/home/alex/.ghc/x86_64-linux-6.12.1/package.conf.d
"unix" appears to be in the build-depends of the "Library", but not in the
build-depends of "Executable lambda
oes anyone have any advice for fixing this issue other than just adding
"unix" to the lambdabot.cabal file?
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
> (==) = (==) `on` show
> >
> >
> > Regards,
> >
> > --
> > Ozgur Akgun
> >
> > ___
> > Haskell-Cafe mailing list
> > Haskell-Cafe@haskell.org
> > http://www.haskell.org/mailman/listinfo/haskell-cafe
> >
> >
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
--
Alex R
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ome along, play with some cool code, help out the community,
and just meet an awesome bunch of like minded people, then we want to hear from
you!
Cheers,
Alex Mason___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
s library (for
>> people who can't or won't install Gtk2Hs to get Chart working; Alex
>> Mason is interested in this)
>> * Various graph-related project (graphviz, generic graph class, etc.;
>> this assumes someone else apart from me cares about this stuff)
>&g
>
>> * A plotting library using Ben's newly released Gloss library (for
>> people who can't or won't install Gtk2Hs to get Chart working; Alex
>> Mason is interested in this)
>> * Various graph-related project (graphviz, generic graph class, etc.;
>&g
en an undefined exception is raised.
The options are :set -fbreak-on-exception or -fbreak-on-error. More info in
the documentation at
http://www.haskell.org/ghc/docs/latest/html/users_guide/ghci-debugger.html#ghci-debugger-exceptions
Hope that helps,
Alex MDC
_
s uses unsafePerformIO, which as you know, is not kosher...
>
This is different because counter is global.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ead car)
>
> car :: [a] -> a
> car x = head x
>
> The reason for doing this is to more closely mirror legacy code.
>
Just do:
car = head
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell
r about the use of Haskell to substitute C or Fortran
> in a lot of tasks, and how it can be used in some problems instead of
> Matlab, Mathematica, etc.)
>
"Haskell for physicists" ?
--
-alex
http://www.ventonegro.org/
___
H
Hi Don,
I was wondering if perhaps this might be a slightly better instance
for Binary [a], that might solve a) the problem of having to traverse
the entire list first, and b) the list length limitation of using
length and Ints. My version is hopefully a little more lazy (taking
maxBound
if we can let them know what we need, hopefully they can help make
life easier for us.
Thanks,
Alex Mason
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
et, called tdict.
Please give it a try and let me know what you think, it's my first
(hopefully) useful hackage package, and I'd love some feedback. There
is also a darcs repo [http://random.axman6.com/darcs/TernaryTrees/],
and any patches are welcome.
m macports
--
With best wishes, Alex Ott, MBA
http://alexott.blogspot.com/http://xtalk.msk.su/~ott/
http://alexott-ru.blogspot.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
On 5/20/09, Diego Souza wrote:
> Not exactly São Carlos: São Paulo - SP.
>
Me too, Sao Paulo - SP.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/li
return ()
listFilms (film:films)
= do putStrLn (show film)
listFilms films
Hope that helps,
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
On 4/24/09, Donn Cave wrote:
> Quoth Alex Queiroz ,
>
>
> > Actually some Scheme compilers have a "c-declare" form that lets
> > you create C functions, which can be called from C, Haskell, Java,
> > Ruby etc.
>
>
> That would
m just refuting your
assertion that one cannot compile "whatever" code to C and
"incorporate it into your function".
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
e too different computing model
>
Actually some Scheme compilers have a "c-declare" form that lets
you create C functions, which can be called from C, Haskell, Java,
Ruby etc.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Ca
to interact with the "outside",
i. e., reading, displaying etc.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
allow to view
collected information in kcachegrind, and get interactive zooming, etc.
--
With best wishes, Alex Ott, MBA
http://alexott.blogspot.com/http://xtalk.msk.su/~ott/
http://alexott-ru.blogspot.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
>>And experience without abstraction,
>>Are practiced by very few.
>
> Nice poem. Did you write it yourself, or can you document the source?
>
If I remember correctly, this is from the Daodejing.
Cheers,
--
-alex
http://www.ventonegro.org/
_
Hello
On Wed, Jan 28, 2009 at 12:30 PM, Colin Paul Adams
wrote:
>>>>>> "Alex" == Alex Ott writes:
>
>Alex> Hello For Emacs users it could be interesting - I wrote
>Alex> small module for more comfortable work with HLint from
>Alex>
k.su/~ott/common/emacs/rc/emacs-rc-pretty-lambda.el.html
you can find slightly modified version of version of pretty lambda code
from haskell wiki - i added several symbols, and fix regex to work properly
with symbols like ===, etc.
--
With best wishes, Alex Ott, MBA
http://alexott.bl
1 - 100 of 242 matches
Mail list logo
