On 8/24/12 3:44 AM, Sebastien Zany wrote:
More specifically (assuming I understood the statement correctly):
Suppose I have two base functors F1 and F2 and folds for each: fold1 :: (F1
a -> a) -> (μF1 -> a) and fold2 :: (F2 a -> a) -> (μF2 -> a).
Now suppose I have two algebras f :: F1 μF2 -> μ
*It’s not dead, it’s resting!*
I am pleased to announce that Issue 20 of the Monad Reader is now available.
http://themonadreader.files.wordpress.com/2012/08/issue20.pdf
Issue 20 consists of the following three articles:
- "Enumeration of Tuples with Hyperplanes" by Tillmann Vogt
-
On Sat, 25 Aug 2012, Kristopher Micinski wrote:
On Sat, Aug 25, 2012 at 3:38 PM, Jay Sulzberger wrote:
This is good. I will look at the references given in this
thread. The account at
http://web.archive.org/web/20060206074101/http://www.cse.ogi.edu/~mpj/thih/TypingHaskellInHaskell.html
On Sat, Aug 25, 2012 at 3:38 PM, Jay Sulzberger wrote:
> This is good. I will look at the references given in this
> thread. The account at
>
>
> http://web.archive.org/web/20060206074101/http://www.cse.ogi.edu/~mpj/thih/TypingHaskellInHaskell.html
>
> is, I think, one part of what I was looking
On Sat, 25 Aug 2012, Kristopher Micinski wrote:
I do not know Haskell. It looks to me as though there are
several pieces of the mechanism:
1. There is, once the extensions are specified, a particular Type
System, that is, a formal system with, on the syntactic side, at
least, assumptions,
On Sat, Aug 25, 2012 at 8:17 PM, Kristopher Micinski wrote:
> Still unsure if the translation from
> Haskell to Core has been verified, I would suspect not, as I haven't
> heard of any such thing.
>
If it is only Core that has semantics, then it wouldn't make sense to
verify the translation from
Thanks much Kristopher, Gershom, and Aaron, for the excellent pointers.
(Keep them coming, anyone else - maybe we can update the wiki..)
I will look into them in more detail soon.
On Sat, Aug 25, 2012 at 5:12 PM, Aaron Tomb wrote:
> Hi,
>
> Last summer, as part of the Summer of Code, David Lazar
>
> I do not know Haskell. It looks to me as though there are
> several pieces of the mechanism:
>
> 1. There is, once the extensions are specified, a particular Type
> System, that is, a formal system with, on the syntactic side, at
> least, assumptions, judgements, rules of inference, terms lyin
On Sat, 25 Aug 2012, Kristopher Micinski wrote:
On Thu, Aug 23, 2012 at 12:23 PM, Ramana Kumar
wrote:
Dear Haskell Cafe
I'm looking for information on past and current attempts to write semantics
for Haskell.
Features I'm particularly interested in are:
formal
mechanised
maintainable
up t
Hi,
Last summer, as part of the Summer of Code, David Lazar formalized a
significant portion of Haskell 98 in the K framework. You can find the
code here:
https://github.com/davidlazar/haskell-semantics
And there's a talk about it here:
http://corp.galois.com/blog/2012/1/12/new-tech-ta
On Sat, Aug 25, 2012 at 9:33 AM, Gershom Bazerman wrote:
> On 8/25/12 6:48 AM, Kristopher Micinski wrote:
>>
>> Thus, you typically want to think about the semantics of "core
>> Haskell," in which you might try understanding the semantics of the
>> STG machine.
>>
>
> Along those lines, there's Pi
On 8/25/12 6:48 AM, Kristopher Micinski wrote:
Thus, you typically want to think about the semantics of "core
Haskell," in which you might try understanding the semantics of the
STG machine.
Along those lines, there's Pirog and Biernacki's "A Systematic
Derivation of the STG Machine
Verified
hello matthew,
I commented your gist on github adding the missing pieces with minor fixes.
Anyway, I suggest giving up RVar's which are overkill for your task. You
could implement your shuffle as an exercise, or use random-shuffle package
as I do in the code below.
Also I'd avoid State monad for
On Thu, Aug 23, 2012 at 12:23 PM, Ramana Kumar
wrote:
> Dear Haskell Cafe
>
> I'm looking for information on past and current attempts to write semantics
> for Haskell.
> Features I'm particularly interested in are:
>
> formal
> mechanised
> maintainable
> up to date
>
> Of course, if nothing like
On Fri, 24 Aug 2012 23:14:05 +0200, Gwern Branwen wrote:
On Fri, Aug 24, 2012 at 4:47 PM, Henk-Jan van Tuyl
wrote:
I am trying to fetch wxHaskell with the command
darcs get --lazy http://code.haskell.org/wxhaskell/
but there are much too little files downloaded; what could be the
problem
On 08/24/2012 04:20 PM, marcmo wrote:
You have done quite some work on the crypto front...cool!
since you are the owner of cryptocipher and your new package cipher-aes:
is cryptocipher now deprecated?
cryptocipher itself is not deprecated as it contains much more than just AES.
The haskell AES
16 matches
Mail list logo
