2010/12/3 Permjacov Evgeniy :
>> Most of the time you can get away with usual block ciphers (and even
>> with weaker parameters). There is a scheme that transforms block
>> cipher into hash function:
>> http://en.wikipedia.org/wiki/CRHF#Hash_functions_based_on_block_ciphers
> */me wrote it into to_
Hello,
Any news on this one?
01.12.2010, в 11:53, Yitzchak Gale написал(а):
> Eugene Kirpichov wrote:
>> I looked at a couple pages of mine...
>> and looks
>> like the vast majority of images are not displaying.
>
> This probably has to do with moving the wiki to the
> new server during the
Hi steffen,
I have upload new video without sound :
http://www.youtube.com/watch?v=A3DgKDVkyeM
Enjoy!
-- Andy
steffen writes:
> Hi Andy,
>
> Can you please do something about the sound track? Loads of people are
> not able to view your video, because the used content/sound track is
> not av
On Thursday 02 December 2010 7:54:18 pm Larry Evans wrote:
> [snip]
> *Maybe* the computer science people are trying to minimize the concepts.
> In this case, the one concept common to both the sum and product ( in
> the math peoples viewpoint) is there's a function:
>
>field2type: field_name
On 12/02/10 15:47, Iavor Diatchki wrote:
> Hi,
> You have it exactly right, and I don't think that there's a
> particularly deep reason to prefer the one over the other. It seems
> that computer science people
> tend to go with the (product-function) terminology, while math people
> seem to prefer
On 12/03/2010 12:33 AM, Serguey Zefirov wrote:
> 2010/12/3 Permjacov Evgeniy :
>> The data integrity checks is well-known problem. A common soluting is
>> use of 'checksums'. Most of them , however, are built in quite
>> obfuscated manner (like md5) that results in ugly and error-prone
>> implement
On 2 Dec 2010 at 01:09:18, Iain Alexander wrote:
> So where's it getting the 6.4.1 ghc-pkg from?
It turns out that the only PATH-accessible copy of cabal[.exe] was in
.../ghc-6.4.1/bin, and it appears that cabal by default uses the versions of
ghc and ghc-pkg in the same directory as itself.
An
On 2 Dec 2010, at 21:29, Andrew Coppin wrote:
> Does anybody have any suggestions?
class Mappable t a b where
type Rebind t a b
map :: (a -> b) -> t -> Rebind a b
This is based on an old C++ trick.
Roman
>
___
Haskell-Cafe mailing list
Haskell
On Thu, Dec 2, 2010 at 4:39 PM, Antoine Latter wrote:
> On Thu, Dec 2, 2010 at 3:29 PM, Andrew Coppin
> wrote:
>> Yes, it's me. And yes, I come with yet more questions.
>>
>> With Haskell 98 (or, indeed, Haskell 2010) it is impossible to define a
>> polymorphic version of "head" that works for []
Hi,
You have it exactly right, and I don't think that there's a
particularly deep reason to prefer the one over the other. It seems
that computer science people
tend to go with the (product-function) terminology, while math people
seem to prefer the (sum-product) version, but it is all largely a
m
On Thu, Dec 2, 2010 at 3:29 PM, Andrew Coppin
wrote:
> Yes, it's me. And yes, I come with yet more questions.
>
> With Haskell 98 (or, indeed, Haskell 2010) it is impossible to define a
> polymorphic version of "head" that works for [], Set and ByteString. You can
> use a higher-kinded type class
On 02/12/2010 09:17 PM, Permjacov Evgeniy wrote:
The data integrity checks is well-known problem. A common soluting is
use of 'checksums'. Most of them , however, are built in quite
obfuscated manner (like md5) that results in ugly and error-prone
implementations (see reference implementation for
2010/12/3 Permjacov Evgeniy :
> The data integrity checks is well-known problem. A common soluting is
> use of 'checksums'. Most of them , however, are built in quite
> obfuscated manner (like md5) that results in ugly and error-prone
> implementations (see reference implementation for same md5).
>
Yes, it's me. And yes, I come with yet more questions.
With Haskell 98 (or, indeed, Haskell 2010) it is impossible to define a
polymorphic version of "head" that works for [], Set and ByteString. You
can use a higher-kinded type class for [], but that fails for Set
(because you can't specify t
The data integrity checks is well-known problem. A common soluting is
use of 'checksums'. Most of them , however, are built in quite
obfuscated manner (like md5) that results in ugly and error-prone
implementations (see reference implementation for same md5).
So, the question is: is there a checks
ХоÑиÑе понимаÑÑ Ð¶ÐµÐ½Ñин? ÐнаÑÑ ÑеалÑнÑе иÑ
мÑÑли, когда они пÑÑаÑÑÑÑ ÑпÑÑÑаÑÑ Ð¸Ñ
за
ÑовеÑÑенно оÑвлеÑеннÑми ÑеÑами? Ðа
пÑакÑиÑеÑкиÑ
ÑÑенингаÑ
Ðкадемии ÐнакомÑÑв
On Thursday 02 December 2010 10:13:32 am Petr Pudlak wrote:
> Hi,
>
> recently, I was studying how cartesian closed categories can be used to
> describe typed functional languages. Types are objects and morphisms are
> functions from one type to another.
>
> Since I'm also interested in systems
On 12/02/10 11:19, Iavor Diatchki wrote:
> Hi,
> Bart Jacobs's book "Categorical Logic and Type Theory" has a
> categorical description of a system with dependent types (among
> others). The book is fairly advanced but it has lots of details about
> the constructions.
> Hope this helps,
> -Iavor
>
Dear Haskellians,
Last week i went in to record the 2nd and 3rd installments of the C9 monadic
design patterns for the web videos. Charles Torre, the series producer, told
me there were over 40K distinct views of the first video. i know that many
of them came from this community. So, i really want
Hi,
Bart Jacobs's book "Categorical Logic and Type Theory" has a
categorical description of a system with dependent types (among
others). The book is fairly advanced but it has lots of details about
the constructions.
Hope this helps,
-Iavor
On Thu, Dec 2, 2010 at 8:18 AM, wrote:
> On Thu, 2 De
Ðикап блог один из лÑÑÑий инÑоÑмаÑивнÑÑ
ÑайÑов о в УкÑаине, коÑоÑÑй помогаеÑ
мÑжÑинам в ÑÐ°Ð·Ñ ÑлÑÑÑиÑÑ Ð¸Ñ
лиÑнÑÑ Ð¸
ÑекÑÑалÑнÑÑ Ð¶Ð¸Ð·Ð½Ñ Ð´Ð°ÐµÑ Ð¾ÑвеÑÑ Ð½Ð° вопÑоÑ
как поÐ
On 13/11/2010 19:08, Bit Connor wrote:
On Wed, Nov 10, 2010 at 5:48 PM, Simon Marlow wrote:
[...] So we should
say there are a few things that you can do that guarantee not to call any
interruptible operations:
- IORef operations
- STM transactions that do not use retry
- everything from
On Thu, 2 Dec 2010, Petr Pudlak wrote:
Hi,
recently, I was studying how cartesian closed categories can be used to
describe typed functional languages. Types are objects and morphisms are
functions from one type to another.
Since I'm also interested in systems with dependent types, I wonder
On 12/02/10 09:13, Petr Pudlak wrote:
> Hi,
>
> recently, I was studying how cartesian closed categories can be used to
> describe typed functional languages. Types are objects and morphisms are
> functions from one type to another.
>
> Since I'm also interested in systems with dependent types,
I sent a patch to fix this to the maintainer for the typehash
package (Lennart Augustsson) on the 16th of November, but haven't
heard anything back - it is possible that he doesn't read the e-mail
address I sent it to, or is no longer interested in maintaining
typehash.
Lennart applied yo
Hi,
recently, I was studying how cartesian closed categories can be used to
describe typed functional languages. Types are objects and morphisms are
functions from one type to another.
Since I'm also interested in systems with dependent types, I wonder if
there is a categorical description
Thank you, it is indeed very similar problem.
Nevertheless it seems that the lst function is not the direct reason, because:
1) if I inline lst (by hands), the problem is still there
2) size of the list is actially not so large - just 15 millions elements
I am almost sure that the reason is Map.fr
On Thu, Dec 2, 2010 at 05:16, Robert Clausecker wrote:
> How can I install GHC 7 parallel to GHC 6.12 with the option to choose?
> My OS is GNU/Linux, my Distro is Ubuntu (Lucid).
>
I created this for my Ubuntu VM: https://github.com/spl/multi-ghc
Regards,
Sean
__
> On Dec 1, 2010, at 8:38 PM, Antoine Latter wrote:
>
> > If you're doing user installations of packages with 'cabal-install' it
> > will take care of everything - all of the things that it installs are
> > in per-GHC-version directories.
> ...
> > Except for the haddock documentation that cabal-in
Marcelo Sousa wrote:
>> I'm having currently a problem with System.Directory in my mac os.
>> Prelude System.Directory> let dirTest = do {dir <- getCurrentDirectory;
>> doesDirectoryExist dir}
>> Prelude System.Directory> dirTest
>> False
I.e., System.Directory.doesDirectoryExist always
returns Fa
30 matches
Mail list logo
