On Sat, Dec 12, 2009 at 8:22 AM, Max Bolingbroke
batterseapo...@hotmail.com wrote:
2009/12/12 Rafael Gustavo da Cunha Pereira Pinto rafaelgcpp.li...@gmail.com:
I know I should probably be asking to the GHC list, but is there any update
on 6.12 since October? Any probable release date?
It
Today we were working on integrating Atom code with some hand-written
C, and one of my colleagues posed the question: Is it possible to use
Atom just for its task scheduler for existing C code? This turns out
to be very simple. It just requires a few combinators built on top of
'action'.
--
On Tue, Dec 8, 2009 at 6:31 PM, Tom Tobin korp...@korpios.com wrote:
Question 2 can be If the answer to 1 is no, is there *any*
circumstance under which the author of Y can distribute the source of
Y under a non-GPL license?
I'd like to get these questions out to the SFLC so we can satisfy our
On Fri, Dec 11, 2009 at 9:21 PM, Brandon S. Allbery KF8NH
allb...@ece.cmu.edu wrote:
Unexpected applications of category theory for $500, Alex
Before you know it, they're going to be modeling mental processes as monads. :p
___
Haskell-Cafe mailing
Non-strictness is not necessary for purity, but it sure gives you some nice
properties... Take for example
const x y = x
It would be really nice for this function to have the property always
results in x no matter what you give it as it's second argument. But for a
language which is strict, all
On Wed, Dec 9, 2009 at 4:59 AM, Ketil Malde ke...@malde.org wrote:
Tom Tobin korp...@korpios.com writes:
If it turns out that Hakyll *is* okay to be BSD3 licensed so
long as neither any binary nor the GPL'd work's source is distributed
under non-GPL terms, well ... I'll say that the meaning
I have to admit, it's just one criterion too much for me. I can manage to
satisfy all of them except for willing to work in Manhattan.
Bob
On Tue, Dec 8, 2009 at 5:54 PM, Tom Tobin korp...@korpios.com wrote:
On Tue, Dec 8, 2009 at 11:09 AM, siki ga...@karamaan.com wrote:
I've posted
On Tue, Dec 8, 2009 at 11:09 AM, siki ga...@karamaan.com wrote:
I've posted this before but did not get a whole lot of responses, so here it
is again:
[...]
You should have at least a bachelor’s degree in computer science from a top
university
Might I humbly suggest that this is going to
On Tue, Dec 8, 2009 at 3:46 PM, Tom Tobin korp...@korpios.com wrote:
If you are forming a derivative work based on the GPL'd
work, and thus you have to release that derivative work under the GPL.
Wow, I mangled the syntax on that last sentence. That should read:
If you are forming
On Tue, Dec 8, 2009 at 4:13 PM, Robert Greayer robgrea...@gmail.com wrote:
On Tue, Dec 8, 2009 at 4:46 PM, Tom Tobin korp...@korpios.com wrote:
On Tue, Dec 8, 2009 at 3:30 PM, Ben Franksen ben.frank...@online.de
wrote:
Ketil Malde wrote:
Your contributions could still be licensed under
On Tue, Dec 8, 2009 at 4:17 PM, Warren Henning warren.henn...@gmail.com wrote:
Am I the only one who finds this stuff confusing as hell?
It *is* confusing as hell, because law is confusing as hell, because
it's an interpreted language of sorts — what matters is how judges
rule on the law, not
On Tue, Dec 8, 2009 at 5:15 PM, Gregory Crosswhite
gcr...@phys.washington.edu wrote:
On Tue, Dec 8, 2009 at 4:46 PM, Tom Tobin korp...@korpios.com wrote:
The crux here is that the source code of hakyll, released on hackage, is not
a derivative of Pandoc (it contains, as far as I understand
On Tue, Dec 8, 2009 at 4:38 PM, Robert Greayer robgrea...@gmail.com wrote:
Not to belabor the point (I hope), but consider the following situation --
if the current version of Pandoc, 1.2.1, were released under BSD3, not GPL,
it would be obvious that the current version of hakyll could be
On Tue, Dec 8, 2009 at 4:56 PM, Ben Franksen ben.frank...@online.de wrote:
On Tue, 8 Dec 2009, Tom Tobin wrote:
Seriously, no, this is *totally* wrong reading of the GPL, probably
fostered by a misunderstanding of the term GPL-compatible license.
GPL-compatible means the compatibly-licensed
On Tue, Dec 8, 2009 at 5:09 PM, Erik de Castro Lopo
mle...@mega-nerd.com wrote:
Tom Tobin wrote:
I can write the SFLC and pose a hypothetical situation that captures
the gist of what we're talking about, and post the response here, if
anyone is interested.
I suggest that you put together
On Tue, Dec 8, 2009 at 6:10 PM, Erik de Castro Lopo
mle...@mega-nerd.com wrote:
Tom Tobin wrote:
The background situation: X is a library distributed under the GPL. Y
is another library that uses that library and requires it in order to
compile and function.
You probably also need to bring
On Tue, Dec 8, 2009 at 6:21 PM, Tom Tobin korp...@korpios.com wrote:
Well I think that's actually what we're wondering here — under what
circumstances is Y's author permitted to choose his license at will?
I think I phrased this poorly; it's more under what circumstances is
Y's author permitted
On Tue, Dec 8, 2009 at 6:25 PM, Matthew Brecknell matt...@brecknell.net wrote:
Based on the discussion so far, I think you need to distinguish between
distributing source and distributing binaries. For example:
Background: X is a library distributed under GPL. Y is another library
which calls
On Tue, Dec 8, 2009 at 6:54 PM, Tom Tobin korp...@korpios.com wrote:
On Tue, Dec 8, 2009 at 11:09 AM, siki ga...@karamaan.com wrote:
You should have at least a bachelor’s degree in computer science from a top
university
Might I humbly suggest that this is going to severely limit your
hiring
On Tue, Dec 8, 2009 at 8:19 PM, Robert Greayer robgrea...@gmail.com wrote:
There's another FAQ on GNU site that, I think, addresses the Pandoc/Hakyll
situation directly:
http://www.gnu.org/licenses/gpl-faq.html#LinkingWithGPL
You have a GPL'ed program that I'd like to link with my code to
On Tue, Dec 8, 2009 at 11:19 PM, Tom Tobin korp...@korpios.com wrote:
In temporary lieu of posing questions explicitly to the SFLC, I dug
up a copy of _Intellectual Property and Open Source_ by Foobar
::facepalm:: I wrote Foobar as a placeholder as I was typing, and
never replaced
On Mon, Dec 7, 2009 at 11:25 AM, Deniz Dogan deniz.a.m.do...@gmail.com wrote:
2009/12/7 Don Stewart d...@galois.com:
The Haskell Web News is a monthly summary of the hottest news about the
Haskell programming language, as found in our online communities. If you
want to catch up with what’s
On Sat, Dec 5, 2009 at 6:35 AM, Jasper van der Jeugt
jasper...@gmail.com wrote:
Hakyll is a simple static site generator library, mostly aimed at blogs. It
supports markdown, tex and html templates.
It is inspired by the ruby Jekyll program. It has a very small codebase
because it makes
On Fri, Nov 27, 2009 at 9:30 PM, John Hughes r...@chalmers.se wrote:
This is a heads up about a workshop on test automation that I just joined
the programme committee of. Automation of Software Test will be co-located
with ICSE in Cape Town in May--the workshop home page is here:
This release of Atom slightly changes the semantics of assertions and
coverage. Assertion and coverage are now checked between the
execution of every rule, instead of only when the rules containing
assertions are fired. They are still subject to parental guard
conditions, but not period or phase
2009/12/3 Matthias Görgens matthias.goerg...@googlemail.com:
Hi Tom,
Did you make any progress on your Dominion quest? I guess you could
start by modeling `Big Money' and add the other cards (and
interaction) from there.
No, I'm still trying to tune a partitionM function I wrote. (I'm
On Thu, Dec 3, 2009 at 1:37 PM, Daniel Fischer daniel.is.fisc...@web.de wrote:
Am Donnerstag 03 Dezember 2009 19:23:24 schrieb Tom Tobin:
No, I'm still trying to tune a partitionM function I wrote.
Maybe we can help?
Sure; should I post it to haskell-beginners
On Thu, Dec 3, 2009 at 2:29 PM, Daniel Fischer daniel.is.fisc...@web.de wrote:
Am Donnerstag 03 Dezember 2009 21:24:11 schrieb Tom Tobin:
On Thu, Dec 3, 2009 at 1:37 PM, Daniel Fischer daniel.is.fisc...@web.de
wrote:
Am Donnerstag 03 Dezember 2009 19:23:24 schrieb Tom Tobin:
No, I'm still
Hello Haskell Cafe,
I was wondering whether there are any universities that teach about
Haskell type families or GADTs?
Thanks,
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: tom.schrijv
On Nov 30, 2009, at 5:06 PM, Ivan Lazar Miljenovic wrote:
The default Hlint keybinding is C-c l:
Doesn't that violate the emacs proscription against taking C-c (letter)
bindings, as they are intended to be reserved for the user?
From the GNU Emacs manual:
Don't define C-c letter as a key in
On Tue, Dec 1, 2009 at 2:24 AM, Lee Pike leep...@gmail.com wrote:
Tom,
I have a (hopefully) easy question about timing and Atom in the use-case
where you're handling all your own scheduling without relying on a RTOS
(where you get preemption). Suppose I want a rule to fire every 2ms
-151109000171-
I'd be happy to forward on any resumes to the hiring manager.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
= int16' readCompass() = (return . value)
something - int16' something
period 1 $ atom navigate $ do
heading - compass
something == heading
br, miaubiz
Tom Hawkins-2 wrote:
The work around is to assign the result to an external variable. The
drawback is the result will not be available
On Fri, Nov 27, 2009 at 12:09 PM, Serge Le Huitouze
serge.lehuito...@gmail.com wrote:
Hi Tom!
Mecha is a little constructive solid modeling language intended for 3D
CAD. This release adds animation capabilities, which use POVRay and
FFmpeg behind the scenes. At work we've used Mecha
Atom is a DSL for designing hard realtime embedded software with
Haskell. This release adds guarded division operations, 'phase', a
new scheduling constraint, and a new rule scheduling algorithm.
Many thanks to Lee Pike for his contributions! (Lee, sorry it took so
long to get this out.)
Mecha is a little constructive solid modeling language intended for 3D
CAD. This release adds animation capabilities, which use POVRay and
FFmpeg behind the scenes. At work we've used Mecha to illustrated the
kinematics of a new hydraulic pump design -- I wish I could post the
animation, it's
-- Forwarded message --
From: Tom Hawkins tomahawk...@gmail.com
Date: Thu, Nov 19, 2009 at 9:31 PM
Subject: Re: [Haskell-cafe] ANNOUNCE: feldspar-language
To: Emil Axelsson e...@chalmers.se
On Thu, Nov 19, 2009 at 5:58 PM, Emil Axelsson e...@chalmers.se wrote:
Hi Tom, thanks
On Fri, Nov 20, 2009 at 4:14 AM, Warren Henning
warren.henn...@gmail.com wrote:
Interesting to see actual generated code.
Is this like code generation systems for database applications where
you stick stuff into string templates (e.g., a generator in Ruby on
Rails), or is it actually
On Mon, Nov 16, 2009 at 2:43 PM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Casey,
Monday, November 16, 2009, 11:30:51 PM, you wrote:
Why not use www.sourceforge.net?
i strongly recommend http://code.google.com or http://codeplex.com
SF is slow and olf-fashioned
If you like
2009/11/16 Günther Schmidt gue.schm...@web.de:
Hi all,
I don't think the *project* is ready for sourceforge or similar yet. I was
thinking more about something bloggish first, where I could state some
thoughts first and where people could then comment or otherwise contribute.
I reckon it
On Fri, Nov 13, 2009 at 1:51 PM, Max Rabkin max.rab...@gmail.com wrote:
I have heard many complaints about the average quality on
documentation. Therefore, I'd like to encourage you all to read Jacob
Kaplan-Moss's series on writing great documentation:
need lunch.
arrayOfInts = FArray (pack [1..10]) Eq
arrayOfAdders = (+) `fmap` arrayOfInts
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Nov 9, 2009 at 10:09 AM, Emil Axelsson e...@chalmers.se wrote:
Nice!
One of our project members has been looking at Atom, not for numerical
computations, but for real-time scheduling (which Feldspar should deal with
eventually).
What kind of code (in terms of efficiency) does the
trying to remember the
unique object identity of the observer (as that disallows anonymous
lambdas).
I don't know how this would work in a Haskell context, but it might be
interesting to think about.
- Tom Lokhorst
[1]:
http://channel9.msdn.com/shows/Going+Deep/Expert-to-Expert-Brian-Beckman
On Sat, Nov 7, 2009 at 8:07 AM, Felipe Lessa felipe.le...@gmail.com wrote:
On Sat, Nov 07, 2009 at 08:46:07AM -0500, Matthias Görgens wrote:
Interesting idea. But I guess you should clarify what kind of card
games you want to support. E.g, a DSL for trick taking games like
Bridge, Skat or
On Wed, Nov 4, 2009 at 7:03 AM, Bernie Pope florbit...@gmail.com wrote:
I'm pleased to announce that version 0.2 of the language-python
package is now available on hackage:
http://hackage.haskell.org/package/language-python
language-python provides lexical analysis and parsing for Python.
Neat! What a cool idea.
data Solid = Solid (Vector - Bool)
With a type like this, how is it possible to make solids without hard edges?
Now the only way is to create a new primitive. In the future I want
to have blended versions of the set operations to apply fillets or
bevels at the
On 10/31/09, Heinrich Apfelmus apfel...@quantentunnel.de wrote:
The only possible monad instance would be
return x = Const mempty
fmap f (Const b) = Const b
join (Const b) = Const b
Your join doesn't seem to have the right type... Unless I'm missing something.
Bob
On 10/31/09, Magicloud Magiclouds magicloud.magiclo...@gmail.com wrote:
After all, I never think OO as an oppsite way to all other things. The
idea is so general that if you say I cannot use it in Haskell at all,
that would make me feel weird. The only difference between languages
is, some are
Mecha is a little solid modeling language intended for machine design.
Mecha has two layers: a pure functional layer for defining solids
(aka. parts), and a monadic layer for arranging parts into assemblies.
Solids (parts) are built using set operations on solid primitives. A
solid primitives
Of note, there is a sensible monad instance for zip lists which I *think*
agrees with the Applicative one, I don't know why they're not monads:
instance Monad (ZipList a) where
return = Ziplist . return
join (ZipList []) = ZipList []
join (ZipList (a:as)) = zlHead a `zlCons` join (map
On Fri, Oct 30, 2009 at 5:59 PM, Luke Palmer lrpal...@gmail.com wrote:
On Fri, Oct 30, 2009 at 10:39 AM, Tom Davie tom.da...@gmail.com wrote:
Of note, there is a sensible monad instance for zip lists which I *think*
agrees with the Applicative one, I don't know why they're not monads
On Mon, Oct 26, 2009 at 9:11 AM, David Leimbach leim...@gmail.com wrote:
or the printf implementation. I tried to figure it out, then the
Cenobites came and got me.
QOTW, if I may say so.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
A few months ago, I started toying with a few alternative pump designs
to power our hydraulic hybrids. After not being able to secure a ProE
license, I searched for a free solid modeler to sketch out a few
ideas. To my surprise, their are practically no open source 3D CAD
packages available. So
On Mon, Oct 19, 2009 at 3:30 AM, Dougal Stanton
dou...@dougalstanton.net wrote:
Has not been responding for at least the last 12 hours.
Is there somewhere to look for status reports on sysadmin details like
this, so we can tell if
Or even better, might it be possible to look into setting up a
On Mon, Oct 19, 2009 at 4:32 PM, Kyle Murphy orc...@gmail.com wrote:
If they have to spend three hours trying to track down some obscure
research paper that's referenced in your documentation a half dozen times
in as many functions, you're not providing enough detail and assuming too
great a
On Mon, Oct 19, 2009 at 5:34 PM, Will Ness will_...@yahoo.com wrote:
This syntax already exists. The '`' symbol is non-collating already, so using
it for symbol chars doesn't change anything (it's not that it can be a part of
some name, right?). To turn an infix op into an infix op is an id
On Fri, Oct 9, 2009 at 2:24 PM, Jose A. Ortega Ruiz j...@gnu.org wrote:
Hi,
When i try to cabal install htzaar i get the following error:
src/Main.hs:11:7:
Could not find module `Play':
Use -v to see a list of the files searched for.
cabal: Error: some packages failed to install:
HTZAAR is a Haskell implementation of TZAAR, a great little two-player
abstract strategy game designed by Kris Burm. TZAAR won Games
Magazine's Game-of-the-Year in 2008.
TZAAR has some interesting game dynamics. At each turn a player must
decide whether to attack or strengthen his own pieces.
On Wed, Sep 30, 2009 at 11:45 AM, namekuseijin namekusei...@gmail.com wrote:
I've not been following Haskell too much and am completely lost when
reading code like that. I understand (+1), : and ! but what the hell
are . and $ for?
Function composition and lowest-precedence function
Atom is a Haskell DSL for designing hard real-time embedded
applications. At Eaton, we use it for automotive control systems. An
Atom description is composed of a set of guarded atomic actions that
operate on a global program state. Atom makes it easy to manage
program concurrency without the
On Mon, Sep 28, 2009 at 9:50 PM, Hong Yang hyang...@gmail.com wrote:
Good libraries are not enough for a language to go beyond mere existence.
There must exist good documents, i.e., good tutorials, good books, and good
explanations and examples in the libraries, etc, that are easy for people to
On Tue, Sep 29, 2009 at 3:16 PM, Don Stewart d...@galois.com wrote:
korpios:
wiki — but I still find the array of libraries confusing (just what
comes with GHC — I'm not even talking about Hackage here), since the
What comes with GHC is the Haskell Platform these days.
Actually, the other
Haskell. In CAL I'd write letter_grade something like (untested):
letter_grade :: Num a = a - Maybe Char;
letter_grade val =
find (\pair - fst pair $ val) [( 90, 'A'), ... )] `bind` (\p -
return $ snd p);
where bind is =
Tom
___
Haskell-Cafe
without getting lost in the (assumed) complexity of GHC. For instance
I'd like to replace the CAL type system with HMF.
Note that while it is 'dead', it isn't broken or bit-rotted --
everything still works, including the Eclipse plugin.
Tom
newtype VMT m a =
VMT {runVMT :: StateT VMState m a}
deriving (Monad, MonadIO, MonadTrans, TransM, MonadState VMState)
works here (ghc-6.10.3)
On Wed, Sep 16, 2009 at 11:42 AM, Miguel Mitrofanov
miguelim...@yandex.ru wrote:
newtype VMT m a =
VMT {runVMT :: StateT VMState m a}
:: Position - Radius - Height - Geometry Three
Circle :: Position - Radius - Geometry Two
Postcard :: Position - Orientation - Geometry Two - Geometry Three
perimeter :: Geometry Two - Double
perimeter (Circle _ r) = 2*pi*r
Tom
On Tue, Sep 15, 2009 at 11:29 AM, Olex P hoknam...@gmail.com
] at
the library, and it's easily accessible by bike and bus [6].
Also, to stay on top of Dutch HUG related news, please subscribe to
the mailing list [2].
See you tomorrow!
- Tom Lokhorst
[1]: http://www.haskell.org/haskellwiki/Dutch_HUG
[2]: http://groups.google.com/group/dutch-hug
[3]: http://www.mail
On Fri, Sep 4, 2009 at 10:38 AM, Christian
Maederchristian.mae...@dfki.de wrote:
Or runghc form /usr/bin?
/usr/bin/runghc is a symlink to the same file as runhaskell.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tue, Sep 1, 2009 at 3:14 AM, Christian
Maederchristian.mae...@dfki.de wrote:
It seems, bootstrapping cabal went wrong. Does
http://hackage.haskell.org/platform/2009.2.0.2/haskell-platform-2009.2.0.2-i386.dmg
work?
Installing the Haskell Platform package, combined with adding the
previously
Friday!
- Tom Lokhorst
[1]: http://www.haskell.org/haskellwiki/Dutch_HUG
[2]: http://groups.google.com/group/dutch-hug
[3]:
http://www.uu.nl/EN/library/contact/university_library/zaalverhuur/Pages/default.aspx#booth
[4]:
http://www.uu.nl/EN/library/contact/university_library/Parkeren/Pages
On Mon, Aug 31, 2009 at 7:18 PM, Dmitri Sosnikdim...@gmail.com wrote:
On 31/08/2009, at 9:02 PM, Christian Maeder wrote:
Dmitri Sosnik wrote:
How I can tell gcc to generate 32 bit code? I've tried to set
CFLAGS=-m32, but it doesn't work.
(Flags do not work -- without Makefile) Pass
On 12/08/2009, at 9:09 PM, Peter Verswyvelen wrote:
Is this really the case? Or is just hard to implement?
I mean, if...then...else is always kind of lazy in it's 2nd and 3rd
argument, but I think DDC handles this correctly even with the
presence of side effects (not sure, but it has a little
There isn't a Chicago-area Haskell group, is there? If not, would
anyone be interested in forming one? I used to run Chicago's Django
(a Python web framework) group, but lost interest (and since I lived
in the suburbs back then, got sick of the commute). Unlike Python,
I'm still very much a
On Wed, Aug 12, 2009 at 4:45 PM, Jeremy Shawjer...@n-heptane.com wrote:
Personally, I would recommend using a facebook page as a means of
communicating within the group.
Okay:
http://www.facebook.com/pages/Chicago-IL/Chicago-Haskell-User-Group/115989593098
I hope that's the correct
On Wed, Aug 12, 2009 at 6:21 PM, Jeremy Shawjer...@n-heptane.com wrote:
Or you can make me an admin, and I'll do it.
I did that; feel free to go ahead and dress up the page. ^_^ A logo
somehow incorporating elements of the skyline into the new Haskell
logo would be cute, if you (or anyone
it does provide
some immutable data structures) and in not being statically typed --
the lack of static typing is the most important difference IMHO.
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
On Wed, Aug 5, 2009 at 10:19 AM, Colin Paul
Adamsco...@colina.demon.co.uk wrote:
Just because a library is blessed, doesn't mean you have to use it.
Then I'm not sure I understand the point of blessing it in a set of
libraries that saves you the task of picking and choosing the best
Haskell
On Wed, Aug 5, 2009 at 10:46 AM, Colin Paul
Adamsco...@colina.demon.co.uk wrote:
Tom == Tom Tobin korp...@korpios.com writes:
This can surely be tackled by cabal, as it already has the
license information.
Tom I don't see this as a real solution; why would a package be
It should
with it.
Don, I'm eagerly awaiting a Galois tech talk. Though Haskell is well
entrenched in my group, it has yet to spread to other programs in the
company despite our best marketing efforts. Sometimes it helps if
words of wisdom come from the outside.
-Tom
On Fri, Jul 31, 2009 at 4:33 PM
into production and hit the road
last month -- literally.
http://hackage.haskell.org/package/atom
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
.
This would certainly make the site seem more alive (as does that
automatic hackage feed, but this would be written by a human).
- Tom Lokhorst
On Fri, Jul 10, 2009 at 9:04 AM, minh thunot...@gmail.com wrote:
2009/7/10 Thomas Davie tom.da...@gmail.com:
On 9 Jul 2009, at 18:32, Thomas ten Cate
, now it will
evaluate to a JavaScript expression.
The code is still very immature (basically only that one example
works), but it demonstrates our intend.
- Tom
[1]: http://github.com/tomlokhorst/AwesomePrelude/tree/master
[2]: http://github.com/tomlokhorst/AwesomePrelude/tarball/master
On Tue, Jun
of the lack of sharing Matthew Brecknell mentioned?
Control.Monad concatMap (\n - replicateM n ['a'..'z']) [1..] !! 500
jxlks
Regards,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
of Fibonacci numbers.
fib = 0:1:[m + n | (m, n) - zip fib (tail fib)]
Regards,
Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
has completed.
results - bool' result -- Global, external variable to capture result.
action (\ [a, b, c] - printf result = function(%s, %s %s) a b c) [a, b, c]
-Tom
On Sat, Jun 13, 2009 at 5:03 AM, Radamés Ajnaradama...@gmail.com wrote:
hi there,
I've been working with haskell and atom dsl
There's a SVG version of the logo on the wiki:
http://haskell.org/haskellwiki/Thompson-Wheeler_logo
On Fri, Jun 12, 2009 at 10:39 AM, Thomas Davietom.da...@gmail.com wrote:
On 12 Jun 2009, at 10:27, Loup Vaillant wrote:
2009/6/11 Thomas Davie tom.da...@gmail.com:
Here's the logo, continuing
Are you looking for something like Streams [1]?
They're infinite sequences, defined like this:
data Stream a = Cons a (Stream a)
They can obviously never be empty (unless you see bottom (undefined) as empty).
- Tom
[1] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Stream
On Thu
A few bug fixes and doc improvements. Thanks to John Van Enk and
Brian Lewis for the patches!
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/atom
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
record project
does not pan out, the code could find its way into other applications.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
results, etc. The main
technical challenges are database distribution and patient security.
Both are fun problems, and our friends at Galios continue to show how
effective Haskell is at building secure systems.
Any thoughts? Ideas?
-Tom
BTW, Anyone looking to rent a house in Eden Prairie, MN
On Tue, May 26, 2009 at 6:49 PM, Conal Elliott co...@conal.net wrote:
Hi Tom,
I've been working on another code-generating graphics compiler, generating
GPU code. As always, I run into the problem of efficient common
subexpression elimination. In Pan, Vertigo Pajama, I used lazy
of the feed2twitter
library. It `tweets' the releases of new Hackage-packages.
In the 3 days it has been running, it has already posted 70+ releases:
http://twitter.com/Hackage
- Tom Lokhorst
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/feed2twitter
http://hackage.haskell.org/cgi-bin/hackage-scripts
on Twitter.
This could be done with something like Apache's mod-rewrite.
- Tom
On Thu, May 21, 2009 at 8:59 PM, John Van Enk vane...@gmail.com wrote:
A bit off topic, but what's the chance we can get the Hackage RSS feed to
include some more information about the package? I'd like to see at least
signature:
isSorted :: [Int] - Bool
Surly, if the sort function works for Ints, it'll work for any Ord a.
- Tom
-- Forwarded message --
From: Ryan Ingram ryani.s...@gmail.com
To: Eugene Kirpichov ekirpic...@gmail.com
Date: Mon, 18 May 2009 13:57:04 -0700
Subject: Re: [Haskell-cafe
further work or discussion about this subject that I
haven't been able to dig up?
- Tom Lokhorst
[1] http://hackage.haskell.org/trac/ghc/wiki/Annotations
[2] http://www.haskell.org/pipermail/haskell-prime/2006-November/001893.html
[3] http://hackage.haskell.org/trac/haskell-prime/ticket/88
[4] http
I pushed out a new version of atom that incorporates some of John's
recommendations (thanks John). And it ships with a slightly better
example.
The release also includes means to extract code coverage to track
which atom rules have fired during testing.
-Tom
http://hackage.haskell.org/cgi-bin
transition rules.
- Rules with execution periods from 1ms to 10s all scheduled at
compile time to a 1 ms main loop.
- 3 minute compilation time from atom source to ECU.
- Atom design clears electronic/sw testing on first pass.
- Currently in vehicle testing with no major issues.
Tom
list?
Tom
--
Tom Schrijvers
Department of Computer Science
K.U. Leuven
Celestijnenlaan 200A
B-3001 Heverlee
Belgium
tel: +32 16 327544
e-mail: tom.schrijv...@cs.kuleuven.be
url: http://www.cs.kuleuven.be/~toms/
___
Haskell-Cafe mailing list
Haskell
I'm not 100% clear on the behaviour of the STM function orElse. The
documentation says:
Compose two alternative STM actions (GHC only). If the first action
completes without retrying then it forms the result of the orElse.
Otherwise, if the first action retries, then the second action is
tried
401 - 500 of 681 matches
Mail list logo
