Thanks for the thorough response.
I've found BarrasBernardo's work (at least, slides) about ICC*, I'll
have a look at it.
Could you provide with names of works by Altenkirch/Morris/Oury/you?
The unordered pair example was especially interesting, since I am
somewhat concerned with which operations
Thanks, at least the title looks like exactly what I've been looking
for, however I cannot quickly appreciate the notation-heavy contents:
I definitely will as soon as possible.
2009/5/20 Masahiro Sakai masahiro.sa...@gmail.com:
From: Eugene Kirpichov ekirpic...@gmail.com
Date: Sun, 17 May 2009
2009/5/15 Maurício briqueabra...@yahoo.com:
Hi,
I have a situation like this: module A imports R (a newtype
declaration) from module B, and lists it in its (module A)
export list.
Documentation for R is included by haddock in documentation
for module A, as I want. However, if my package
On Wed, May 20, 2009 at 09:42:19AM +0200, David Waern wrote:
2009/5/15 Maurício briqueabra...@yahoo.com:
I have a situation like this: module A imports R (a newtype
declaration) from module B, and lists it in its (module A)
export list.
Documentation for R is included by haddock in
(Apologies for my mutilation of ML syntax, I don't completely know the language)
Consider the ML type int list, and this function to build one:
broken_repeat :: int - int list
broken_repeat n = Cons(n, broken_repeat(n))
This function is recursive, and doesn't terminate; it tries to build
an
2009/5/20 Ross Paterson r...@soi.city.ac.uk:
On Wed, May 20, 2009 at 09:42:19AM +0200, David Waern wrote:
2009/5/15 Maurício briqueabra...@yahoo.com:
I have a situation like this: module A imports R (a newtype
declaration) from module B, and lists it in its (module A)
export list.
Hi
On 20 May 2009, at 07:08, Eugene Kirpichov wrote:
Thanks for the thorough response.
I've found BarrasBernardo's work (at least, slides) about ICC*, I'll
have a look at it.
Could you provide with names of works by Altenkirch/Morris/Oury/you?
The unordered pair example was especially
Haha... yes, thanks. It was a mistake, I thought I did it too fast.
--
View this message in context:
http://www.nabble.com/Expression-parsing-problem-tp23610457p23632282.html
Sent from the Haskell - Haskell-Cafe mailing list archive at Nabble.com.
While just writing 33 instead of length [1..33] saves an awful lot of
bother, the function you'd probably want in similar circumstances is
`fromIntegral`
See the Prelude.
Also, you can use Data.ByteString.head instead of unpack and then
Data.List.head
rollDice :: Word8 - IO Word8
rollDice n =
Kindly excuse the German noise, please ...
Liebe Haskell-Freunde!
Das Programm fuer unser Haskell-Treffen steht jetzt so gut wie fest und
man kann sich online anmelden.
-
HaL4 : Haskell - Tutorial + Workshop + Party
am Freitag, dem 12. Juni 2009,
When you say documentation disappears, do you mean that R is still
listed, but its comments are not shown, or is R completely absent from
the documentation?
See http://trac.haskell.org/haddock/ticket/107
He just needs to include B in the other-modules list, so that cabal will
pass it to
Hallo,
On 5/20/09, Diego Souza paravinic...@yahoo.com.br 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
2009/5/20 Maurício briqueabra...@yahoo.com:
I would still like to know the answer to my question though, since I
think we can improve Haddock here.
R is completely absent from documentation.
OK. That's strange. I thought that Haddock would at least show R but
without a link.
I did include a
Actually, I was saying that chain already emulates laziness, just in
a somewhat unsafe way, as demonstrated by weird_take. In Haskell
you'd probably just write
ints :: Int - [Int]
ints n = [n..]
and be done with it.
-- ryan
On Wed, May 20, 2009 at 9:41 AM, michael rice nowg...@yahoo.com
Or in a language without bottoms.
2009/5/20 David Menendez d...@zednenem.com:
On Sun, May 17, 2009 at 11:52 PM, Ryan Ingram ryani.s...@gmail.com wrote:
Free theorem's are theorems about functions that rely only on parametricity.
For example, consider any function f with the type
forall a.
Turns out I was building the trees wrong, ended up getting a structure
that looked like a linked list (each tree only had 1 child) so the
depth of the recursion was way higher than it should've been. Crisis
averted!
Still seemed odd that the garbage collector ran for so much of the
time,
On Sun, May 17, 2009 at 11:52 PM, Ryan Ingram ryani.s...@gmail.com wrote:
Free theorem's are theorems about functions that rely only on parametricity.
For example, consider any function f with the type
forall a. a - a
From its type, I can tell you directly that this theorem holds:
forall
OK, I think I understand. You were explaining how ML could be made to emulate
Haskell laziness using streams, ala Scheme type delayed evaluation, so it's
kind of like you were explaining a question I hadn't quite asked yet, which
maybe explains my puzzlement, I hope.
Also, though my
This is not directly related to Haskell, but it's a thought that occurred
to me after exposure to the Haskell community.
I've spent most of the past 15 years doing scientific programming. The lead
software architect and software managers are using good software
engineering practice, though
On Wed, May 20, 2009 at 3:54 PM, Michael Mossey m...@alumni.caltech.edu wrote:
I want to aspire to positive design. I want to list the goals, and think
of design as making clever choices that meet all the goals.
Design by Thomas the Tank Engine?
___
Thanks for the extra patience.
What does unsafe mean? From my perspective, you had a perfectly good
chain_take function
fun chain_take(0,_) = nil
| chain_take(n,Link(i,f)) = i :: chain_take(n-1,f(i))
- chain_take(5,always1(6));
val it = [1,1,1,1,1] : int list
Putting aside weird_chain_take
The unsafe is that it's possible to write weird_chain_take; nothing
is wrong with chain_take, the unsafeness is that the data structure
admits things that aren't really chains based on passing odd arguments
to f.
That said, my Stream definition wastes time constructing thunks;
building closures
Michael Mossey wrote:
This is not directly related to Haskell, but it's a thought that
occurred to me after exposure to the Haskell community.
I've spent most of the past 15 years doing scientific programming. The
lead software architect and software managers are using good software
23 matches
Mail list logo
