apocalisp.wordpress.com
Imperative vs Functional Programming | Apocalisp
https://apocalisp.wordpress.com/2011/05/30/imperative-vs-functional-programming
The end of programming as you know it. Imperative vs Functional Programming. May 30, 2011. Recently I had a quasi-private discussion about philosophy in programming where somebody asked a question about functional programming. I’d like to relay part of the discussion here since it might be of interest to the community at large. In general, imperative programming is rooted in the fact that computers actually run programs by executing a series of instructions. On the validity of the FP approach. The fact o...
schneier.com
Homomorphic Encryption Breakthrough - Schneier on Security
https://www.schneier.com/blog/archives/2009/07/homomorphic_enc.html
Last month, IBM made some pretty brash claims about homomorphic encryption and the future of security. I hate to be the one to throw cold water on the whole thing - as cool as the new discovery is - but it's important to separate the theoretical from the practical. Unfortunately - you knew that was coming, right? Gentry estimates that performing a Google search with encrypted keywords - a perfectly reasonable simple application of this algorithm - would increase the amount of computing time by about a tr...
dfranke.us
Shell Shock Exploitation Vectors — Indistinguishable from Random
https://www.dfranke.us/posts/2014-09-27-shell-shock-exploitation-vectors.html
We (finally) Have the Technology: Creating Beautiful Typography for the Web. Shell Shock Exploitation Vectors. Shell Shock Exploitation Vectors. September 27, 2014. By Daniel Fox Franke. This is an incomplete catalog of potential exploitation vectors for. Or Shell Shock . I’m posting this hastily and will update it continuously with new findings. Please leave a comment if you can think of any vectors not listed here. For a service to be vulnerable to Shell Shock, three conditions must be met:. Do not set...
haskellcast.com
Episode 1 - Edward Kmett on Lenses - The Haskell Cast
http://www.haskellcast.com/episode/001-edward-kmett-on-lenses
Episode 1 - Edward Kmett on Lenses. Recorded: 2013-08-04, Published: 2013-08-26. Edward Kmett joins us to talk about lenses, comonads, and the future of the Haskell core libraries. He also shares with us how he discovered Haskell, his academic background, and advice for new Haskell developers being exposed to the math concepts inside of his libraries for the first time. Links from the show:. Http:/ lens.github.io/. Http:/ www.youtube.com/user/edwardkmett. The music used in the show is Ecstatic Wave.
blog.sigfpe.com
A Neighborhood of Infinity: October 2013
http://blog.sigfpe.com/2013_10_01_archive.html
A Neighborhood of Infinity. Friday, October 25, 2013. Distributed computing with alien technology. Suppose we are given a function. Boolean arguments that returns a boolean result. Alice has. And Bob has another. Alice and Bob are widely separated and don't know each other's bits. What is the total number of bits that Alice has to send to Bob and that Bob has to send to Alice so that between them they can compute. Think about how complex. Might get. The. But in fact Alice needs to send Bob just one bit.
blog.sigfpe.com
A Neighborhood of Infinity: February 2014
http://blog.sigfpe.com/2014_02_01_archive.html
A Neighborhood of Infinity. Saturday, February 01, 2014. We'll start with some administrative stuff before getting down to the real code:. Import Control.Lens import Control.Monad import Control.Monad.Loops. We'll make our DSL an imperative wrapper around Gloss:. Import Graphics.Gloss.Interface.Pure.Game. First we'll need a wrapper that allows us to represent ordinary Haskell values in our DSL:. Data Basic a = Return a. Input (Event - Basic a). Render Picture (Basic a). Instance Monad Basic where return ...
vandreev.wordpress.com
2007 June « codeland
https://vandreev.wordpress.com/2007/06
Programming, math, and things that are spiffy. Monthly Archives: June 2007. Feistel Ciphers and DES in Haskell. June 18, 2007 – 12:34 am. Occasionally, I like to pick a random interesting topic that’s entirely unrelated to my work, and read up on it. Recently, it has been polynomial factoring and computer algebra in general, which I’d like to post about when I have the time. As a side note, I’ve also been meaning to write a quick expository […]. Posted in Computer Science. Quick and Dirty Theorem Prover.
blog.sigfpe.com
A Neighborhood of Infinity: Quick and dirty reinversion of control
http://blog.sigfpe.com/2011/10/quick-and-dirty-reinversion-of-control.html
A Neighborhood of Infinity. Sunday, October 30, 2011. Quick and dirty reinversion of control. It's taken for granted by many people that Haskell and static types are incompatible with prototyping and quick-and-dirty hacks. But it is possible to reinvert inversion of control in any language that supports continuations. And that includes languages like Python that support linear continuations in the form of generators. But I'm using Haskell here. And continuations we need the. I'll do everything except the.
SOCIAL ENGAGEMENT