Hi,
I started with the implementation of a VNC server library intended to
be used as a library for rendering graphics and interacting with the
user(mouse/keyboard). I'd appreciate it very much if I could get some
feedback on my approach to binary parsing and Haskellism.
Also, any
Anton Kholomiov wrote:
I'm glad to announce csound combinator library.
It features liberation from id-style csound code, haskore-like composition
structures, type-safe composable opcodes and simple instrument interface (no
interface at all, instrument is just a function from some note
Nice.
It is true that Python picked up some elements of Haskell, but now both
languages are mature enough so that features can go both ways.
It's called The *Ultimate* Computer Language Guide, and it's on the
internets, so it must be correct, right?
Wooow, it's barely 9 a.m. in France, it's
My familiarity with Python is a bit rusty, but the influence of
Haskell might be over-stated.
Type classes have gone from Haskell to Clean, Mercury (others?), and
monads have gone to F# but otherwise the functional features of the
current crop Python, Ruby etc. are not much different to what has
| The exact syntax is a problem (as usual). We have the technology now. The
| question is how important it is.
|
| I think extending the syntax for contexts would be sufficient:
| Write a ~~ b for a can be converted to b by wrapping / unwrapping
| newtypes, which is a conservative
Hi Erik,
This looks very interesting and seems to have quite comprehensive
reference documentation. Unfortunately there doesn't seem to be
any examples.
Would it be possible to add some examples? Even trivial ones would
be useful to get people started.
Erik
The examples at the bottom of
On Nov 4, 2010, at 2:07 PM, wren ng thornton wrote:
Besides, it's simple enough to just use the MonadLogic class and
switch between concrete types, if you need to test performance.
You may even try to use only `MonadPlus` to get more instances. The
only instances of `MonadLogic` are
Many of us are interested, and Ohloh is interested, in getting
ohloh.net to support darcs repositories directly. It doesn't look hard
to get good-enough support working; it just requires hacking 10 or so
simple, well-organised ruby files. I've made a start on github[1], and
set up a
PS I forgot to describe: Ohloh (http://ohloh.net) provides useful metadata, stats, rankings etc. for free/open-source
software projects, quite good for marketing and project management. Haskell projects and developers would benefit from
this, but have long been excluded because it does not yet
The bottom line is that
- in logic programming languages, building a list by working on
a pair of arguments representing a segment of the list is the
NORMAL way to build a list; it's as fast as it gets, and the
list is inspectable during construction.
modulo usage patterns: e.g., mostly
Did Haskell get significant whitespace from Python - doubtful as
Python possibly wasn't visible enough at the time, but you never know.
Whitespace is significant in almost every language: foo bar /= foobar.
Using indentation for program structuring was introduced by Peter
Landin in his
Stephen Tetley wrote:
Did Haskell get significant whitespace from Python - doubtful as
Python possibly wasn't visible enough at the time, but you never know.
Doesn't COBOL have significant layout anyway as an inspiration to
both?
As far as I am informed, Python got the significant whitespace
ehm. I missed something and ghc api is well documented and stable ?
There are other ways of adding Haskell as a scripting language -
bundling ghc is not necessary.
It is inacceptable for scripting language, faced to no-programmers.
Such
languages must be as plain and regular, as
Python is approximately as old as Python and most likely got
indentation from ABC.
Checking on Wikipedia, one of the ABC's creators was Lambert Meertens
(famous for *-morphisms amongst other things) so there is a lineage
going back to Algol and Peter Landin / ISWIM.
PS. my fact-checking is a bit
On 4 November 2010 12:03, Stephen Tetley stephen.tet...@gmail.com wrote:
Python is approximately as old as Python and most likely got
indentation from ABC.
Apologies that should read - as old as Haskell
Obviously IDSWIM - (I _don't_ say what I mean).
Type-directed name resolution was proposed by SPJ for Haskell', but not for GHC. Is there any particular process for
importing tickets from Haskell' to GHC?
http://hackage.haskell.org/trac/haskell-prime/ticket/129
___
Haskell-Cafe mailing list
Regardless of which languages got which features for which other
languages, Haskell is surely NOT a scripting language inspired by
python...
Also, it was my understanding that Python got list comprehensions
straight from Haskell. Unless, of course, some of the pre-Haskells
also had this feature.
On 02/11/2010 8:16 PM, Conal Elliott wrote:
Vector (Complex a) is a vector with respect to both 'a' and 'Complex a'.
Even worse, () is a vector w.r.t. *every* scalar type.
Why is this bad? () is the canonical 0-dimensional vector space.
0-dimensional vector spaces are very useful because
remote-repo: myhackage:http://myhackage/packages
However, when I try to unpack my package with cabal:
$ cabal unpack MyPackage
Downloading MyPackage-0.0.1...
cabal: Failed to download
http://myhackage/packages/package/MyPackage-0.0.1.tar.gz : ErrorMisc
Unsucessful HTTP code: 404
Why is cabal
Hello,
reading this thread a question came to me:
Is there a way of automatically deriving programming languages ascendancy?
Like biologist can determine the distance between two genotypes, and
determine a hierarchy between species from that.
Are you aware of researchs made in the field?
On the
On Thursday 04 November 2010 15:33:09, Jacques Carette wrote:
On 02/11/2010 8:16 PM, Conal Elliott wrote:
Vector (Complex a) is a vector with respect to both 'a' and 'Complex
a'.
Even worse, () is a vector w.r.t. *every* scalar type.
Why is this bad?
It's bad for making a type class
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
On Nov 3, 2010, at 7:00 PM, Jonathan Geddes wrote:
http://www.datarecoverylabs.com/ultimate-computer-language-guide.html
It's called The *Ultimate* Computer Language Guide, and it's on the
internets, so it must be correct, right?
Wow! Did you read the rest of that page? It is so full of
On 4 November 2010 15:30, Mark Lentczner ma...@glyphic.com wrote:
On Nov 3, 2010, at 7:00 PM, Jonathan Geddes wrote:
http://www.datarecoverylabs.com/ultimate-computer-language-guide.html
It's called The *Ultimate* Computer Language Guide, and it's on the
internets, so it must be
On Thursday 04 November 2010 12:12:51 pm Jeremy O'Donoghue wrote:
Best laugh I've had in ages. Personal favourites are:
The Forth one got me. I also like:
OCaml: OCaml is an attempt to implement object-oriented syntax in Caml. It is
related to SML.
No mention of what Caml is, by the way.
ZF Expressions (aka list comprehensions) date to at least David
Turner's KRC (St. Andrews Static Language) and Rod Burstall and John
Darlington's Hope c.1980. Maybe they were present in NPL, the
predecessor of Hope before that. The Hope paper nods to SETL as an
influence.
Without interviewing the
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
Hi guys,
a while ago, I created an account on Trac. Now, it seems that I've forgotten
both the password and the e-mail address that I used at the time. I cannot
log in, and I cannot make Trac send me the password either. Clearly, I need
the help of a human being with administrator privileges to
Hi Cafe
A while back there was a
threadhttp://www.mail-archive.com/haskell-cafe@haskell.org/msg79633.html
about a good implementation of a (pseudo) random number generator with a good
split operation. There's lots of material on generators that generate a
linear sequence of random numbers,
Hello,
I'm wondering how can I use Happstack's MACID in my application without
breaking everything.
I have a monad like that:
type Comm = StateT Communication IO
type GameState a = StateT Game Comm a
and many functions like:
foo :: GameState ()
foo = do
lift $ putComm some message to
Hi,
I've been looking at a flagstone problem, where no two adjacent
n-tuples can be identical. I solved the problem with Icon using
an array of stacks and was going to explore how to do it in Haskell
when I saw another way to do it explained in the same text. Just
count the ones between the zeros
Nobody had the compilation messages I had?
-- Forwarded message --
From: Dupont Corentin corentin.dup...@gmail.com
Date: Tue, Nov 2, 2010 at 2:30 PM
Subject: [Haskell-cafe] DSL libraries (Was: Map constructor in a DSL)
To: steffen steffen.sier...@googlemail.com,
On Thu, Nov 4, 2010 at 5:30 AM, Malcolm Wallace malcolm.wall...@me.com wrote:
ehm. I missed something and ghc api is well documented and stable ?
There are other ways of adding Haskell as a scripting language - bundling
ghc is not necessary.
Do tell.
It is inacceptable for scripting
Dupont,
The `AwesomePrelude' (we apologize for this name) is a very experimental
project that is not a workable library or executable at all. You can better
consider it to be a `bunch of code' with some interesting ideas and some
interesting potential.
At least my branch[1] runs on my machine
On Nov 4, 2010, at 10:48 AM, Dupont Corentin wrote:
Hello,
I'm wondering how can I use Happstack's MACID in my application
without breaking everything.
I have a monad like that:
type Comm = StateT Communication IO
...
Whereas MACID asks to use:
type Update state = Ev (StateT state STM)
On Thu, Nov 04, 2010 at 05:38:12PM +, Simon Peyton-Jones wrote:
The generator uses crypto functions,
Does that mean it couldn't be used in some countries?
so it's probably more computationally expensive than common linear-sequence
generators, but in exchange you get robust splitting.
I might have a use for this, so I could give it a go.
I'll have a look through this post in detail tomorrow morning.
RS
On 04/11/10 17:38, Simon Peyton-Jones wrote:
Hi Cafe
A while back there was a thread
http://www.mail-archive.com/haskell-cafe@haskell.org/msg79633.html
about a good
There are other ways of adding Haskell as a scripting language - bundling
ghc is not necessary.
Even the program which is to run the scripts is compiled with GHC?
I am interested to know how you do that.
2010/11/4 Malcolm Wallace malcolm.wall...@me.com
ehm. I missed something and ghc api is
Hello,
With your version it compiles. Thanks.
Corentin
On Thu, Nov 4, 2010 at 7:03 PM, Sebastiaan Visser s...@fvisser.nl wrote:
Dupont,
The `AwesomePrelude' (we apologize for this name) is a very experimental
project that is not a workable library or executable at all. You can better
On November 4, 2010 13:38:12 Simon Peyton-Jones wrote:
From: Gideon Yuval (Gideon Yuval)
Sent: Wednesday, November 03, 2010 7:15 AM
To: Simon Peyton-Jones; Burton Smith
Cc: Tolga Acar
Subject: RE: Random number generation
As long as the key, and the non-counting part of the counter, are
On Thu, Nov 4, 2010 at 11:39 AM, Thomas DuBuisson
thomas.dubuis...@gmail.com wrote:
Before we bother to do that I think it would be worth deciding what
level of performance we are trying to achieve. On my laptop (Core2
2.5Ghz) I generate 4MB of random values in less than 900ms (HashDRBG).
On 4 Nov 2010, at 17:52, Luke Palmer wrote:
On Thu, Nov 4, 2010 at 5:30 AM, Malcolm Wallace malcolm.wall...@me.com
wrote:
ehm. I missed something and ghc api is well documented and stable ?
There are other ways of adding Haskell as a scripting language -
bundling
ghc is not necessary.
Hello,
I want to write a timing method to test sub steps in my program. I tested
my timing method as follows:
=
time.hs
=
import Data.Time
time :: String - IO a - IO a
time str a = do
start - getCurrentTime
v - a
end - getCurrentTime
let diff = diffUTCTime end start
On Thu, Nov 4, 2010 at 8:09 PM, Jiansen He jianse...@googlemail.com wrote:
Hello,
I want to write a timing method to test sub steps in my program.
Benchmarking is really tricky. I suggest you use the excellent
Criterion benchmarking package:
http://hackage.haskell.org/package/criterion
ehm. I missed something and ghc api is well documented and stable ?
There are other ways of adding Haskell as a scripting language -
bundling ghc is not necessary.
I still have not found haskell interpreter, that is written in pure
haskell and has good quality (i.e. stable, written in stable
On 11/04/2010 01:39 PM, Neil Davies wrote:
Hi
I've been trying to get the hello world example below to work:
main = do
db- connectODBC connect'string
get Tables db= print
I wonder if you might try something other than getTables, which requires
some metadata
On 04/11/2010 02:16 PM, Jonathan Geddes wrote:
Regardless of which languages got which features for which other
languages, Haskell is surely NOT a scripting language inspired by
python...
Affirmative.
It's a full-scale programming language (although I gather folks do use
it for scripting
On Nov 4, 2010, at 9:51 AM, Stephen Tetley wrote:
Without interviewing the people concerned its probably impossible to
actually find out what influenced what - even though list
comprehensions have a long history the designers of Python might have
only seen them in Haskell so Python could well
On Thu, 4 Nov 2010, Andrew Coppin wrote:
It's a full-scale programming language (although I gather folks do use it for
scripting too), and while it may or may not contain features that are also in
Python, it is manifestly /not/ inspired by Python. Clearly it was inspired
my Miranda and the
Sönke Hahn schrieb:
I have been thinking for a while that it might be worth defining a
Prelude2, which corrects the known problems with the Prelude. Over time,
people could migrate to using Prelude2. It would probably take years to be
widely adopted, but at least there would be light at the
Andrew Coppin andrewcop...@btinternet.com writes:
On a somewhat tangental note: It seems increadible to me that Haskell
was invented in 1990, and Miranda way back in 1985. At the same time,
Commodore Business Machines released the iconic Commodore 64 in 1982,
It is amazing - although as you
Hi,
On experimenting with concurrency, I got somewhat surprising result. I
have a program ('flower') that reads an input file and generates one or
more output files. As the different output files are independent, I
construct one IO action for each output requested on the command line,
and just
On 04/11/2010 08:17 PM, Henning Thielemann wrote:
On Thu, 4 Nov 2010, Andrew Coppin wrote:
On a somewhat tangental note: It seems increadible to me that Haskell
was invented in 1990, and Miranda way back in 1985. At the same time,
Commodore Business Machines released the iconic Commodore 64
On 04/11/2010 08:47 PM, Ketil Malde wrote:
Andrew Coppinandrewcop...@btinternet.com writes:
On a somewhat tangental note: It seems increadible to me that Haskell
was invented in 1990, and Miranda way back in 1985. At the same time,
Commodore Business Machines released the iconic Commodore 64
On 11/04/2010 04:03 PM, Neil Davies wrote:
John
simple queries seem to work fine.
main = do
db- connectODBC connect'string
quickQuery db select serial from CPE_DEVICE []= print . take 3
describeTable db CPE_DEVICE
I'm going to guess that the MySQL ODBC driver isn't implementing the
On 11/02/2010 08:37 PM, wren ng thornton wrote:
Indeed. If your program requires unification or constraint solving
then logic programming or constraint programming[1] is the way to go.
Would you be kind enough to give me or point me towards a good example
of such a case? I've been trying to
Dean,
Thanks very much, that indeed worked.
-- Peter
On Wed, Nov 3, 2010 at 9:16 PM, Dean Herington
heringtonla...@mindspring.com wrote:
At 8:45 PM -0700 11/3/10, Peter Schmitz wrote:
I have a program (test.hs):
module Main (main) where
import System.Exit
main :: IO ExitCode
main =
Hello everyone,
I know the last meetup was a bit light on content so we've been
working hard to make this month different. We've got, not one, but two
talks for you:
First up: Paul Richards will be talking about functional data
structures. In particular, finger trees, which were only discovered
On 10-11-03 10:00 PM, Jonathan Geddes wrote:
It's called The *Ultimate* Computer Language Guide, and it's on the
internets, so it must be correct, right?
The correct conclusion: it's on the internets, so it must be LOL.
I also invite you to play with my:
Max Bolingbroke schrieb:
2010/11/2 Günther Schmidt gue.schm...@web.de:
I've been given a few hints over time when I asked question concerning DSLs
but regretfully didn't follow them up.
I think this is probably to do with observable sharing. The problem in
DSLs is if you have:
fact ::
On 4/11/2010, at 9:08 PM, Stephen Tetley wrote:
Did Haskell get significant whitespace from Python - doubtful as
Python possibly wasn't visible enough at the time, but you never know.
Python did not originate indentation-based syntax.
Occam has it too.
I first came across the idea in a
When you use arrows for your DSL, how do you avoid getting trapped by
arr? It seems like it's hard to avoid people working arbitrary
functions into your computation using it.
-- ryan
On Thu, Nov 4, 2010 at 2:46 PM, Henning Thielemann
schlepp...@henning-thielemann.de wrote:
Max Bolingbroke
On Thu, Nov 4, 2010 at 2:41 PM, Albert Y. C. Lai tre...@vex.net wrote:
On 10-11-03 10:00 PM, Jonathan Geddes wrote:
It's called The *Ultimate* Computer Language Guide, and it's on the
internets, so it must be correct, right?
The correct conclusion: it's on the internets, so it must be LOL.
On Thursday 04 November 2010 5:13:23 pm Gregory Crosswhite wrote:
On 11/02/2010 08:37 PM, wren ng thornton wrote:
Indeed. If your program requires unification or constraint solving
then logic programming or constraint programming[1] is the way to go.
Would you be kind enough to give me
On Thu, 4 Nov 2010, Ryan Ingram wrote:
When you use arrows for your DSL, how do you avoid getting trapped by
arr? It seems like it's hard to avoid people working arbitrary
functions into your computation using it.
I use this for instance in synthesizer-llvm. Actually people can lift
KRC, Miranda, and LML all predate Haskell and have list comprehensions.
On Thu, Nov 4, 2010 at 3:16 PM, Jonathan Geddes
geddes.jonat...@gmail.com wrote:
Regardless of which languages got which features for which other
languages, Haskell is surely NOT a scripting language inspired by
python...
It happened at various universities around the world. Look at the
original Haskell committee and you'll get a good idea where.
The smallest Haskell I know of is Gofer/Hugs; it originally ran on a 640k PCs.
Before that languages like SASL and KRC ran on PDP-11 with 64k memory.
None of these had a
On 11/04/2010 03:30 PM, Lennart Augustsson wrote:
KRC, Miranda, and LML all predate Haskell and have list comprehensions.
Just because those languages predate Haskell and have list
comprehensions doesn't mean that they still couldn't have gotten the
idea from Haskel!. After all, I fully
On 4 Nov 2010, at 22:38, Lennart Augustsson wrote:
The smallest bootstrapped Haskell compiler is NHC which (I think) runs
in a few MB.
Originally, it needed to be able to compile itself in the 2Mb
available on Niklas's Amiga. Then he got an upgrade to 4Mb, so he
started to become less
On 5/11/2010, at 8:54 AM, Andrew Coppin wrote:
Can you actually run something like Haskell with mere kilobytes of RAM?
There was a Lisp for PDP-11s (64k).
Henderson's LispKit ran on the Apple II, which was pretty small,
and LispKit was basically a lazy Lisp.
To that degree, yes you *can* run
On 11/04/2010 03:06 PM, Dan Doel wrote:
Implementing type inference can be very easy in a logic language, because most
of the work in a non-logic language is implementing unification:
http://muaddibspace.blogspot.com/2008/01/type-inference-for-simply-typed-
lambda.html
3 lines of Prolog to
Ketil Malde ke...@malde.org writes:
I guess I should try this with GHC7, but is there reason to believe it
will perform better?
Yes -- there are huge GC and inlining improvements. In our (unreleased)
new benchmarks, the Snap webserver is seeing 20-30% improvements out of
the box.
One thing
Quoth Andrew Coppin andrewcop...@btinternet.com,
...
I didn't get to see the Amiga 600 until at least five or six years later
than that. (It's actually news to me that the Amiga line is that old.)
And I spent most of my time programming it in Pascal (or AMOS BASIC -
but that's not really
On Fri, Oct 22, 2010 at 17:09:52 EDT, Ari Rahikkala wrote:
On Fri, Oct 22, 2010 at 11:18 PM, Anonymous Void byteasphyxia at gmail.com
wrote:
But since I've never seen how the HSCurses functions really integrate
together, or any tutorials/examples (besides hsFishEx),
I fear toying with it
Packages monad-coroutine and SCC have been upgraded to version 0.6 on
Hackage.
The monad-coroutine package exports a generic monad transformer
Coroutine: Functor s = MonadTrans (Coroutine s). A
Coroutine-transformed monad can suspend at any point, returning its
resumption wrapped in the
Hello,
I added a brief section to the happstack crash course on using MACID:
http://www.happstack.com/docs/crashcourse/HappstackState.html
That should hopefully get you started.
The example uses happstack state with happstack server. But there is
really no connection between the two.
Hope
The status/how-to page has moved to a nicer url:
http://etherpad.osuosl.org/ohloh-darcs-support
5 of the 10 ohloh darcs adapter test files are now passing. Come and
help put us over the top.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
The newly released coroutine-enumerator package can be used as a bridge
between the enumerator and monad-coroutine packages. It provides two-way
conversion functions between an Iteratee and an Await-suspending coroutine,
and also between an Enumerator and a Yield-suspending coroutine.
As a little
On 5/11/2010, at 1:00 PM, Donn Cave wrote:
I don't care about whether Python had any influence, but I'd sure
like to stamp out the scripting language rumor.
In this case it may be the Haskell community to blame.
Google for Haskell script
and you will find, for example, Learn you a Haskell for
On Thu, Nov 4, 2010 at 6:00 PM, Donn Cave d...@avvanta.com wrote:
I don't care about whether Python had any influence, but I'd sure
like to stamp out the scripting language rumor.
You all are talking about calling Haskell a scripting language like
it's a bad thing.
Coming from a Perl
On Thu, Nov 4, 2010 at 10:16 PM, Michael Forster m...@sharedlogic.ca wrote:
On Fri, Oct 22, 2010 at 17:09:52 EDT, Ari Rahikkala wrote:
On Fri, Oct 22, 2010 at 11:18 PM, Anonymous Void byteasphyxia at gmail.com
wrote:
But since I've never seen how the HSCurses functions really integrate
On 5/11/2010, at 4:03 AM, Dupont Corentin wrote:
Hello,
reading this thread a question came to me:
Is there a way of automatically deriving programming languages ascendancy?
According to www.oed.com, ascendancy means
The state or quality of being in the ascendant; [having] paramount
82 matches
Mail list logo
