This can be very helpful: Implementation of FP languages by Simon Peyton
Jones
http://research.microsoft.com/en-us/um/people/simonpj/papers/slpj-book-1987/index.htm
2011/11/16 Shogo Sugamoto eseh...@gmail.com
Hi,Cafe.
I want to create my own Programming Language with Haskell, and I learn
People tend to concentrate on the lambda which cooresponds to the
functional aspect of haskell when designing logos. Not nearly enough
attention is paid to the other striking feature, the laziness. The
'bottom' symbol _|_ should feature prominently. The two most defining
features of haskell
John Meacham j...@repetae.net wrote:
People tend to concentrate on the lambda which cooresponds to the
functional aspect of haskell when designing logos. Not nearly enough
attention is paid to the other striking feature, the laziness. The
'bottom' symbol _|_ should feature prominently. The
wren ng thornton wrote:
I don't know whether it's being maintained either, but I'm willing to
help with the janitorial work since I use smallcheck and lazy-smallcheck
quite a lot and think they should be better advertised/used.
Hi Wren,
Sounds like a job for the haskell-pkg-janitors group:
On 16 Nov 2011, at 05:18, John Meacham wrote:
People tend to concentrate on the lambda which cooresponds to the
functional aspect of haskell when designing logos. Not nearly enough
attention is paid to the other striking feature, the laziness. The
'bottom' symbol _|_ should feature
On 16 Nov 2011, at 08:46, Ertugrul Soeylemez wrote:
But I think, despite the well-founded denotational semantics of Haskell,
bottom does not play that much of a role.
There is one? Where? Last time I looked (a while ago, admittedly)
there was no denotational (or any formal) semantics for
The fact that nobody bothered to write one down doesn't mean there isn't one.
Отправлено с iPhone
Nov 16, 2011, в 13:07, Andrew Butterfield andrew.butterfi...@cs.tcd.ie
написал(а):
On 16 Nov 2011, at 08:46, Ertugrul Soeylemez wrote:
But I think, despite the well-founded denotational
On 16 November 2011 05:18, John Meacham j...@repetae.net wrote:
Not nearly enough
attention is paid to the other striking feature, the laziness. The
'bottom' symbol _|_ should feature prominently. The two most defining
features of haskell are that it is purely functional and _|_ inhabits
Maybe it's just me, but I've thought that being non-strict just means that it's
possible for a function to produce some value even if it's argument doesn't; in
other words, that it's possible to have f (_|_) ≠ (_|_). If there was no such
thing as (_|_), what would non-strictness mean?
On 16
Am 16.11.2011 10:07, schrieb Andrew Butterfield:
On 16 Nov 2011, at 08:46, Ertugrul Soeylemez wrote:
But I think, despite the well-founded denotational semantics of Haskell,
bottom does not play that much of a role.
There is one? Where? Last time I looked (a while ago, admittedly)
there was
On 11/16/2011 01:01 AM, heathmatlock wrote:
I liked Go's mascot, and I figure it couldn't hurt to have our own. I spent
the past hour making this:
http://i.imgur.com/Mib6Q.png
awesome. It's really nice,
--
Vincent
___
Haskell-Cafe mailing list
On 16 November 2011 11:05, MigMit miguelim...@yandex.ru wrote:
Maybe it's just me, but I've thought that being non-strict just means that
it's possible for a function to produce some value even if it's argument
doesn't; in other words, that it's possible to have f (_|_) ≠ (_|_). If
there
I like the idea of a mascot. I like the idea of a lamb called Da, as most
of Haskell's strength comes from it's closeness to pure lambda calculus.
A few things I'd like to see in a mascot:
- Simple. You should be able to draw it in a few seconds.
- Look good in black and white.
- Have obvious
Don't think this is what Shogo is looking for since the book is not
about implementing a language WITH Haskell, but how to implement Haskell
like languages with a more low level language (like C).
2011년 11월 16일 00:13, Anton Kholomiov 쓴 글:
This can be very helpful: Implementation of FP
Do you mind some ... how to say ... offside comments?
1. The Curry Da mascot looks like a penguin disguised as a lamb. I have
nothing against penguins !
2. Da, da, konech'no, mais, Signori und Demoiselles, do you realize that
lamb is an English word, and we should think about our
You're probably missing the fact that it's much harder to understand how the
Haskell program works without (_|_). I've seen lots of questions like why
doesn't my recursion work that could be answered simply as because your
function is strict, so (_|_) is it's minimal fixpoint.
Отправлено с
Do you know of any tutorial or slides from a talk on one of the
pretty-printing libraries? It could be on Text.PrettyPrint.HughesPJ or
uulib or any other, similar library.
I'm thinking of developing slides for a course, and I'm looking for sources
of inspiration.
Regards,
Sean
Sean Leather:
Do you know of any tutorial or slides from a talk on one of the
pretty-printing libraries?
Sean, if you need info just on Haskell solutions, other people will help
you. There is a paper:
Linear, bounded, functional pretty-printing by Doaitse Swierstra and
Olaf Chitil (and
(Sent on behalf of Doaitse Swierstra)
Despite some last minute changes to the planning we are happy to announce
that the next Dutch functional programming day will take place on January
6, 2012, at the university campus De Uithof of Utrecht University.
In case you want to give a presentation
On Wed, 16 Nov 2011, Sean Leather wrote:
(Sent on behalf of Doaitse Swierstra)
Despite some last minute changes to the planning we are happy to announce that
the next
Dutch functional programming day will take place on January 6, 2012, at the
university
campus De Uithof of Utrecht
On Wed, Nov 16, 2011 at 16:19, Henning Thielemann
lemm...@henning-thielemann.de wrote:
On Wed, 16 Nov 2011, Sean Leather wrote:
(Sent on behalf of Doaitse Swierstra)
Despite some last minute changes to the planning we are happy to announce
that the next
Dutch functional programming day
What is the language of the talks and the participants? English or Dutch?
In past years the language of the talks has always been English. Also,
most Dutch people speak English pretty well, I think.
Yes, what Erik said. Also, even though previous years' websites (below)
have been in Dutch,
We use AWS extensively. We use the aws package and have contributed to it,
specifically SQS functionality. I will give you the rundown of what we do.
We moved off of SimpleDb and now use mondodb. The reason is that simple db
seemed to have problems with write pressure and there are not good tools
2011/11/15 Roman Cheplyaka r...@ro-che.info:
* Jason Dusek jason.du...@gmail.com [2011-11-15 20:08:48+]
I'm having some trouble with memory usage in rebuilding a
ByteString with some sequences escaped. I thought I'd try
vectors. However, it seems that even a relatively simple
function,
2011/11/15 Johan Tibell johan.tib...@gmail.com:
On Tue, Nov 15, 2011 at 12:08 PM, Jason Dusek jason.du...@gmail.com wrote:
Should I be annotating my functions with strictness, for the
vector reference, for example? Should I be using STUArrays,
instead?
From
On Wed, Nov 16, 2011 at 11:58 AM, Jason Dusek jason.du...@gmail.com wrote:
diff --git a/Rebuild.hs b/Rebuild.hs
@@ -15,6 +15,7 @@ import Data.STRef
import Data.String
import Data.Word
+import Control.DeepSeq
import Data.Vector.Unboxed (Vector)
import qualified Data.Vector.Unboxed as
On Wed, Nov 16, 2011 at 07:58:51PM +, Jason Dusek wrote:
2011/11/15 Johan Tibell johan.tib...@gmail.com:
On Tue, Nov 15, 2011 at 12:08 PM, Jason Dusek jason.du...@gmail.com wrote:
Should I be annotating my functions with strictness, for the
vector reference, for example? Should I be
On Wed, Nov 16, 2011 at 12:07 PM, Johan Tibell johan.tib...@gmail.comwrote:
On Wed, Nov 16, 2011 at 11:58 AM, Jason Dusek jason.du...@gmail.comwrote:
diff --git a/Rebuild.hs b/Rebuild.hs
@@ -15,6 +15,7 @@ import Data.STRef
import Data.String
import Data.Word
+import Control.DeepSeq
On Wed, Nov 16, 2011 at 12:16:34PM -0800, Johan Tibell wrote:
Just double checked. modifySTRef is too lazy:
-- |Mutate the contents of an 'STRef'
modifySTRef :: STRef s a - (a - a) - ST s ()
modifySTRef ref f = writeSTRef ref . f = readSTRef ref
We need Data.STRef.Strict
That would be
I like it!
On Wed, Nov 16, 2011 at 1:01 AM, heathmatlock heathmatl...@gmail.comwrote:
I liked Go's mascot, and I figure it couldn't hurt to have our own. I
spent the past hour making this:
http://i.imgur.com/Mib6Q.png
What do you think?
--
Heath Matlock
+1 256 274 4225
On Wed, Nov 16, 2011 at 2:16 PM, Johan Tibell johan.tib...@gmail.com wrote:
On Wed, Nov 16, 2011 at 12:07 PM, Johan Tibell johan.tib...@gmail.com
wrote:
On Wed, Nov 16, 2011 at 11:58 AM, Jason Dusek jason.du...@gmail.com
wrote:
diff --git a/Rebuild.hs b/Rebuild.hs
@@ -15,6 +15,7 @@ import
Hi Sean
Doaiste Swierstra has fairly extensive notes on the development of the
attribute grammar versions of uulib's pretty printers.
The notes are called Designing and Implementing Combinator
Languages. As they were a showcase for UUAG there is quite a lot on
attribute grammars in the notes,
On Wed, Nov 16, 2011 at 5:54 AM, Jerzy Karczmarczuk
jerzy.karczmarc...@unicaen.fr wrote:
Do you mind some ... how to say ... offside comments?
1. The Curry Da mascot looks like a penguin disguised as a lamb. I have
nothing against penguins !
Hi Jerry, thanks for your input. The reason to
On Wed, Nov 16, 2011 at 7:06 PM, heathmatlock heathmatl...@gmail.comwrote:
Some might picture a symphony or what looks like newspaper origami when
they hear Da, and some might picture food when they hear Curry. I like Da
because its simple and Da the lamb rolls smoothly off the tongue.
Steve, thanks for sharing your experience with AWS!
At the moment I have evaluated several NoSQL storage solutions including
SimpleDB, Riak, MongoDB and Cassandra. Lessons learned:
1) Storage that SimpleDB provides is too low-level and not very convenient
to store dictionaries and other b-tree
I ran into a similar problem with modifySTRef causing allocation and
GC. Creating my own strict version of modifySTRef got rid of all that
and my program ran without any allocation at all.
On Nov 16, 3:16 pm, Johan Tibell johan.tib...@gmail.com wrote:
On Wed, Nov 16, 2011 at 12:07 PM, Johan
On Wed, Nov 16, 2011 at 12:33 PM, Antoine Latter aslat...@gmail.com wrote:
We already have one in base - it re-exports Data.STRef in whole :-)
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-STRef-Strict.html
Then it's wrong. :( In what sense is it strict? I think it should
On Wednesday 16 November 2011, 22:45:16, Johan Tibell wrote:
On Wed, Nov 16, 2011 at 12:33 PM, Antoine Latter aslat...@gmail.com
wrote:
We already have one in base - it re-exports Data.STRef in whole :-)
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-STRef-
2011/11/16 Johan Tibell johan.tib...@gmail.com:
On Wed, Nov 16, 2011 at 12:07 PM, Johan Tibell johan.tib...@gmail.com wrote:
+! doesn't work unless modifySTRef is already strict in the result of the
function application. You need to write modifySTRef' that seq:s the result
of the function
On Wed, Nov 16, 2011 at 2:23 PM, Jason Dusek jason.du...@gmail.com wrote:
Just double checked. modifySTRef is too lazy:
-- |Mutate the contents of an 'STRef'
modifySTRef :: STRef s a - (a - a) - ST s ()
modifySTRef ref f = writeSTRef ref . f = readSTRef ref
We need Data.STRef.Strict
On Wed, Nov 16, 2011 at 3:15 PM, Giovanni Tirloni gtirl...@sysdroid.comwrote:
On Wed, Nov 16, 2011 at 7:06 PM, heathmatlock heathmatl...@gmail.comwrote:
Some might picture a symphony or what looks like newspaper origami when
they hear Da, and some might picture food when they hear Curry. I
On Wed, Nov 16, 2011 at 4:49 PM, heathmatlock heathmatl...@gmail.comwrote:
You're probably right, I guess someone can create a new poll like the
previous one:
http://www.cs.cornell.edu/w8/~andru/cgi-perl/civs/results.pl?num_winners=1id=E_d21b0256a4fd5ed7algorithm=beatpath
I would create
On 17/11/2011, at 12:31 AM, Jerzy Karczmarczuk wrote:
Sean Leather:
Do you know of any tutorial or slides from a talk on one of the
pretty-printing libraries?
Sean, if you need info just on Haskell solutions, other people will help you.
There is a paper:
Linear, bounded, functional
On 16 Nov 2011, at 23:49, heathmatlock wrote:
I took Jerzy's suggestions into consideration and made the lamb skinnier,
maybe it looks less like a penguin now.
http://imgur.com/4oeJz
A formula that is Haskell specific is
\x - ⊥ ≠ ⊥
It is mentioned in the Haskell 98 Report, sec. 6.2,
Hi Chris,
i have upgraded to doctest version 0.4.1.
Now when i try to run the example from the webpage, i get:
doctest: Interpreter exited with an error: ExitFailure 127
What's wrong here and how can i fix it?
Can you still reproduce this on your system? If yes, I'd like to see if
we
I'm used to (on the east coast US) hearing lambda pronounced LAM-duh.
Duh is an expression of something being stupid, so I don't know about
Haskell having a mascot called Duh the Lamb!
amindfv / Tom
On Nov 16, 2011 4:06 PM, heathmatlock heathmatl...@gmail.com wrote:
On Wed, Nov 16, 2011 at
You're quite the artist. I wish I could make stuff like this.
Here are some more ideas (based on titles of papers about Haskell):
What about making the lamb wear a hair shirt?
http://research.microsoft.com/en-us/um/people/simonpj/papers/haskell-retrospective/
Or maybe it could be lazy with
Welcome to issue 208 of the HWN, a newsletter covering developments in
the Haskell community. This release covers the week of November 6 to
12, 2011.
You can find the HTML version at:
http://contemplatecode.blogspot.com/2011/11/haskell-weekly-news-issue-208.html
New and Updated Projects
*
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
Hi,
Consider I have declarations like this:
class (ClassA a) = ClassC a where
from :: (ClassB b) = a - [b]
to :: (ClassB c) = a - [c]
data H = ...
instance ClassB H where
...
data Test = Test { m :: H }
instance ClassA Test where
...
instance ClassC Test where
from = m
to = m
On Thu, Nov 17, 2011 at 11:48 AM, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Hi,
Consider I have declarations like this:
class (ClassA a) = ClassC a where
from :: (ClassB b) = a - [b]
to :: (ClassB c) = a - [c]
data H = ...
instance ClassB H where
...
data Test =
I've uploaded version 2999.12.0.4.
This release fixes the problem described by Max Rabkin below (who also
determined how to fix: I *always* get tripped up by asTypeOf :s). It
also has improved documentation to help people that are wanting to
construct Dot graphs explicitly, and cleans up error
You've declared from as forall b. Test - [b], but you're trying to implement
it as Test - H.
On 17 Nov 2011, at 07:48, Magicloud Magiclouds wrote:
Hi,
Consider I have declarations like this:
class (ClassA a) = ClassC a where
from :: (ClassB b) = a - [b]
to :: (ClassB c) = a - [c]
I think this is where I did not understand from the very beginning.
If the the declaration was correct, then why cannot b be H?
Referring to Data.List.genericLength, I was confused.
On Thu, Nov 17, 2011 at 12:34 PM, MigMit miguelim...@yandex.ru wrote:
You've declared from as forall b. Test -
Of course, b can be H. The important question is: why can't it be something
else? ClassC signature implies that b can be anything (of class ClassB) — not
just H.
Another error is that you declare from as returning a list, but you try to
implement it as returning a single value.
On 17 Nov
On Wed, Nov 16, 2011 at 23:54, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
I think this is where I did not understand from the very beginning.
If the the declaration was correct, then why cannot b be H?
Referring to Data.List.genericLength, I was confused.
Because it doesn't
On Thu, Nov 17, 2011 at 1:17 PM, Brandon Allbery allber...@gmail.com wrote:
On Wed, Nov 16, 2011 at 23:54, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
I think this is where I did not understand from the very beginning.
If the the declaration was correct, then why cannot b be H?
57 matches
Mail list logo
