On May 23, 2010, at 2:53 AM, Lennart Augustsson wrote:
BTW, the id function works fine on bottom, both from a semantic and
implementation point of view.
Yes, but only because it doesn't work at all. Consider that calling
id undefined
requires evaluating undefined before you can call id.
IMO: For AAA game programming? Definitely not. For exploring new ways
of doing game programming and having a lot of fun and frustration?
Sure! For making casual games? I don't know.
Why not casual games? I don't see any immediate difficulty. Do you have
any particular bad experience?
Alexander Solla a...@2piix.com writes:
On May 23, 2010, at 1:35 AM, Jon Fairbairn wrote:
It seems to me relevant here, because one of the uses to which
one might put the symmetry rule is to replace an expression “e1
== e2” with “e2 == e1”, which can turn a programme that
terminates into a
One problem with Elerea experimental branch besides the update time control:
the memo function. I can't understand when I have to call it and when I
don't.
Just to know, have you been told of a language dedicated to reactive
programming (even experimental)? I mean, not an embedded language just
Agreed, I think Snap just raised the bar for presentation of Haskell
libraries. It even has a custom Haddock style sheet! I'm glad it is
built up of separate packages. I also look forward to using it.
On 22 May 2010 09:10, Chris Eidhof ch...@eidhof.nl wrote:
Awesome! Congratulations on the first
On Mon, May 24, 2010 at 03:20:41AM +0200, Günther Schmidt wrote:
Hi all,
is there anybody currently using Haskell to construct or implement a
query language?
Do you mean, HaskellDB?
Cheers,
--
Felipe.
___
Haskell-Cafe mailing list
2010/5/24 Patai Gergely patai_gerg...@fastmail.fm
IMO: For AAA game programming? Definitely not. For exploring new ways
of doing game programming and having a lot of fun and frustration?
Sure! For making casual games? I don't know.
Why not casual games? I don't see any immediate
Just to know, have you been told of a language dedicated to reactive
programming (even experimental)? I mean, not an embedded language just like
Yampa is.
Maybe Lucid Synchrone (http://www.lri.fr/~pouzet/lucid-synchrone/) and
Timber (http://www.timber-lang.org)?
That's totally false. You don't evaluate 'undefined' before calling 'id'.
(Or if you, it's because you've made a transformation that is valid
because 'id' is strict.)
On Mon, May 24, 2010 at 9:05 AM, Alexander Solla a...@2piix.com wrote:
Yes, but only because it doesn't work at all. Consider
One problem with Elerea experimental branch besides the update time
control:
the memo function. I can't understand when I have to call it and when I
don't.
Technically, you never have to. However, if you have a signal derived
from others by pure application (i.e. fmap or *), keep in mind that
I am getting following error while trying to load
http://www.cs.nott.ac.uk/~gmh/parser.lhs
Prelude :l parsers2.hs
parsers2.hs:1:7:
Could not find module `Parsing':
Use -v to see a list of the files searched for.
Failed, modules loaded: none.
Am I missing something again ?
Thanks for
Hi - it looks like I pointed you to the wrong file:
You want to download both these two and put them in the same directory -
http://www.cs.nott.ac.uk/~gmh/Parsing.lhs
http://www.cs.nott.ac.uk/~gmh/parser.lhs
Parsing.lhs is the library, parser.lhs is the example module that has
an expression
Hi all,
I'm very happy to announce the release of yesod 0.2.0. Yesod is a Haskell
web framework for type-safe, RESTful web applications.
I won't bore you all with the full release announcement here, please see the
blog[1]. Installing yesod should be as simple as: cabal update cabal
install
That's great, thanks. Looks like FlexibleContexts is redundant (effectively a
subset of UndecidableInstances?).
Ivan, I hadn't realised, but I had FlexibleInstances on before for other
reasons. I guess that's why I ccould get the workaround to compile.
Cheers,
Sam
-Original Message-
Consider that calling
id undefined
requires evaluating undefined before you can call id. The program will
crash before you ever call id. Of course, the identity function should
have produced a value that crashed in exactly the same way. But we never got
there.
In which sense does id need
Hi,
Does there exist any Haskell package/library to parse the syntax of
SVG elements, esp. PATH?
That is, the syntax of the d attribute (e. g. M 100 100 L 300 100 L
200 300 z)?
Hackage doesn't seem to have any, and Google search yields very broad results.
Thanks.
PS It should not be hard to
Hello, All!
I need some help to solve the following task:
=
import Data.Map as M
import Data.List as L
data Pair = Pair { name, value :: String }
type IxPair = (Int, String, String)
type
On Monday 24 May 2010 15:48:14, Jonas Almström Duregård wrote:
Consider that calling
id undefined
requires evaluating undefined before you can call id. The program will
crash before you ever call id. Of course, the identity function
should have produced a value that crashed in
2010/5/23 Günther Schmidt gue.schm...@web.de:
is there anybody currently using Haskell to construct or implement a query
language?
I've a half-baked, type-indexed (in HList style) implementation of
relational algebra lying around somewhere, if that counts as a query
language. I was
On Mon, 24 May 2010, Dimitry Golubovsky wrote:
Does there exist any Haskell package/library to parse the syntax of
SVG elements, esp. PATH?
That is, the syntax of the d attribute (e. g. M 100 100 L 300 100 L
200 300 z)?
Hackage doesn't seem to have any, and Google search yields very broad
Henning,
Thanks, I'll try to use your code.
BTW does it handle the syntax where repeated operation is omitted, per
SVG spec 8.3.1?
--
The command letter can be eliminated on subsequent commands if
I'm trying use subRegex to replace using back references just like the docs
says:
http://hackage.haskell.org/packages/archive/regex-compat/0.92/doc/html/Text-Regex.html#v%3AsubRegex
But when i try to replace with \1 i got \SOH and not e. Can anyone help?
subRegex (mkRegex e) hello \1
= h\SOHllo
Hi everyone,
as I'm trying to design a query language the one thing that causes the
most grieve is the apparent requirement for extensible records.
There are by now a number of solutions in Haskell for this, most
prominently HList.
But at the end of the day even for HList to work one needs
On Monday 24 May 2010 17:08:50, Juan Maiz wrote:
I'm trying use subRegex to replace using back references just like the
docs says:
http://hackage.haskell.org/packages/archive/regex-compat/0.92/doc/html/T
ext-Regex.html#v%3AsubRegex
But when i try to replace with \1 i got \SOH and not e. Can
On Mon, 24 May 2010, Dimitry Golubovsky wrote:
Henning,
Thanks, I'll try to use your code.
BTW does it handle the syntax where repeated operation is omitted, per
SVG spec 8.3.1?
Don't know, I just wrote the little parser in a way that it could handle
my example SVG file. :-)
But you have to be aware that Elerea, Yampa, Lucid Synchrone and Lustre
are all very similar in their foundations.
Okay. I just thought that reactive programming was a quite new field of
research, but I saw that Lustre and Esterel date back to 1980...
I assumed also that it was a field which
Am 24.05.2010 14:21, schrieb Dimitry Golubovsky:
Hi,
Does there exist any Haskell package/library to parse the syntax of
SVG elements, esp. PATH?
Hi Dimitry,
If you search on hackage for svg, you find my library SVGFonts. I first
thought SVGFont is a special syntax similar to SVG, but it
Tillmann,
OK, I see: your code parses the glyph element which contains the
same kind of path definition that the path element does.
I think your code would be helpful for me as well.
And I think I'll use the same xml package to read in the SVG file (I
was thinking about this package earlier,
Thanks for the compliment -- and reading assignment. I was not aware
of Gem Cutter; it looks quite impressive!
These are the features I'm hoping to add to Sifflet;
if you'd like to urge any particular priorities,
please let me know:
- additional data types, possibly including trees
and
:set -fglasgow-exts
:set prompt
Thats all i have in my .ghci file
On Fri, May 21, 2010 at 12:14 PM, Daniel Fischer
daniel.is.fisc...@web.de wrote:
On Friday 21 May 2010 20:50:39, Anatoly Yakovenko wrote:
anyone else seeing this behavior?
anato...@anatolyy-linux ~ $ ghci
GHCi, version
Yeah. Funny that we're still writing games in C++, while mission
critical and hard real time systems are written in much nicer
languages :)
I made something similar to Lucid Synchrone for a game company I used
to work, but with the purpose of making reactive programming
accessible to computer
On Fri, May 21, 2010 at 11:50 AM, Anatoly Yakovenko
aeyakove...@gmail.com wrote:
anato...@anatolyy-linux ~ $ ghci
GHCi, version 6.12.1: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ... done.
Loading package integer-gmp ... linking ... done.
Loading package
On Monday 24 May 2010 21:35:10, Anatoly Yakovenko wrote:
:set -fglasgow-exts
Can't you be more discriminating and turn on only those extensions you
regularly use?
:set prompt
Thats all i have in my .ghci file
Shouldn't cause a cd.
Maybe
$ ghci -v4
would give a hint?
2010/05/17 Tim Chevalier catamorph...@gmail.com:
The first three names on that list of faculty members are members of
the HASP group (High Assurance Systems Programming), which is an
active research group focused on developing a call-by-value Haskell
variant for systems programming. More info
Hi,
I have a file including some operation logs, in the format of the
following. And I have some code to analyze it. Well, it ate all my
memories.
---
log:
Log for item A
===
09:10 read accountA
09:20 read accountB
Log for item B
---
code:
file - U.readFile filename
mapM_
On 25 May 2010 11:41, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Hi,
I have a file including some operation logs, in the format of the
following. And I have some code to analyze it. Well, it ate all my
memories.
---
log:
Log for item A
===
09:10 read accountA
U is for UTF8 module. And I will try the modules you mentioned.
Although I thought Haskell IO is lazy enough
On Tue, May 25, 2010 at 9:46 AM, Ivan Miljenovic
ivan.miljeno...@gmail.com wrote:
On 25 May 2010 11:41, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Hi,
I have a
On 25 May 2010 12:02, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
U is for UTF8 module. And I will try the modules you mentioned.
Although I thought Haskell IO is lazy enough
If you're only streaming data, it probably would be. However, you
seem to keep some of it in memory,
This is the function. The problem sure seems like something was
preserved unexpected. But I cannot find out where is the problem.
seperateOutput file =
let content = lines file
indexOfEachOutput_ = fst $ unzip $ filter (\(i, l) -
Log for
On 25 May 2010 12:20, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
This is the function. The problem sure seems like something was
preserved unexpected. But I cannot find out where is the problem.
seperateOutput file =
let content = lines file
indexOfEachOutput_ = fst $
On Tuesday 25 May 2010 04:26:07, Ivan Miljenovic wrote:
On 25 May 2010 12:20, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
This is the function. The problem sure seems like something was
preserved unexpected. But I cannot find out where is the problem.
seperateOutput file
I'm pretty sure this is a bug. My code works if I put a type
signature on your second example.
*TFInjectivity :t testX'
testX' :: (P a ~ B (L a), X' a) = a - B (L a)
*TFInjectivity :t testX' (\(A _) - B __) :: B (HCons a HNil)
testX' (\(A _) - B __) :: B (HCons a HNil) :: B (HCons a HNil)
On Mon, May 24, 2010 at 2:34 AM, Graham Klyne gk-li...@ninebynine.org wrote:
I think this looks like an interesting idea... can you provide a pointer to
a description of the DSL/API itself?
Unfortunately, there's not much aside from the Haddock documentation
[1] [2] and some misc links on my
43 matches
Mail list logo
