YAYERKA's comments

>1. modularity (and now that they have added generative functors à la SML, you can have true abstraction)

Could you share some information regarding Haskell and it's 'modularity' problem (vs. the ML family of languages). I'm fond of the way SML projects can be structured. How are people solving this using Haskell? Are there any interesting solutions for creating modular Haskell application/system's I can see today?

Thanks for your comment.

Tcl/Tk is an often overlooked tool to quickly test UI ideas.

Check out `http://wiki.tcl.tk/' (which has lot's of good information).

Also learn some Tcl by reading the redis test suite here,

`https://github.com/antirez/redis/tree/unstable/tests'.

Thanks for sharing, and for anyone else reading you might also like the following book--`Modern Compiler Implementation in ML' by Appel. (http://www.cs.princeton.edu/~appel/modern/ml/)

>The street became colder, short Russian summer moves for the winter. Brains cooled down a bit and began to think.

I've always anticipated winter with a similar sentiment--I like the way this was said.

Previously discussed here

`https://news.ycombinator.com/item?id=5872043'.

And links to the `greatest of the great' papers;

`https://news.ycombinator.com/item?id=5872310'.

For anyone interested, here is another paper concerning similar topics:

`Verification of a Cryptographic Primitive: SHA-256',

https://www.cs.princeton.edu/~appel/papers/verif-sha.pdf.

And don't forget about `CompCert C compiler',

http://compcert.inria.fr/compcert-C.html.

Or the `Vellvm' project,

http://www.cis.upenn.edu/~stevez/vellvm/.

Thanks for posting this; this is such a great interview.

I always find you can learn so much from an accomplished artist. They seem to know about everything!

This was one of my favourite parts ...

> Yes, I use pencil first. With Genesis, because there was so much technical stuff that I had to do, especially drawing correct anatomy, I would often make a sketch first on a piece of scrap paper, try and get it right before I started penciling on the drawing paper. How’s this angle, his arm, and the guy’s holding a tool, how does that look? I used Muybridge’s Animal Locomotion, from the late 1800s. It includes hundreds of photos of naked people in action, really handy for any kind of cartoon work where you have to draw people realistically in different actions and poses. Like the scene where Jacob is wrestling with the angel; fortunately there were pages of photos in Muybridge’s book of men wrestling.

This made me immediately search google for 'Muybridge Animal Locomotion'. I had seen the galloping horse images before, but had no idea Muybridge published 700+ such studies in 1887. [0] UPenn has some of them archived digitally. [1]

[0] http://en.wikipedia.org/wiki/Eadweard_Muybridge [1] http://dla.library.upenn.edu/dla/archives/search.html?q=muyb...

Besides the paperlet, and Scott's new format for getting out his ideas -- I thought the rolling ball binary mechanical computer called the Digi-Comp II was pretty cool, and can actually be purchased as well. [0]

[0] http://www.evilmadscientist.com

This man was an absolute giant of design. (Along with his wife, who is also an amazing designer).

For those of you unfamiliar with his work. He created a lot iconic imagery -- including the signage and maps for the subway system in New York City.

A quick google search or visit to [0] will reveal his talent. Btw, I always thought this website was quite poorly designed considering the Vignelli's abilities.

[0] http://vignelli.com/home.html

Rest in peace Massimo!

What an amazing exchange of ideas;

Knuths response to Tarjans Q15 was particularly interesting since he was able to illustrate his insight with a concrete example;

>Thus I think the present state of research in algorithm design misunderstands the true nature of efficiency. The literature exhibits a dangerous trend in contemporary views of what deserves to be published.

> Another issue, when we come down to earth, is the efficiency of algorithms on real computers. As part of the Stanford GraphBase project I implemented four algorithms to compute minimum spanning trees of graphs, one of which was the very pretty method that you developed with Cheriton and Karp. Although I was expecting your method to be the winner, because it examines much of the data only half as often as the others, it actually came out two to three times worse than Kruskal's venerable method. Part of the reason was poor cache interaction, but the main cause was a large constant factor hidden by O notation.

Although it is not exactly the same, what you can do is start a `screen' session (which can be split with ^a S), and then split your `vi' instances.

I've looked at and read a bunch of different Prolog books. In my opinion the best one is `Programming in Prolog: Using the ISO Standard' by Clocksin & Mellish. It's actually one of my favorite programming books. Do all the exercises!

http://www.amazon.com/Programming-Prolog-Using-ISO-Standard/...

http://www.swi-prolog.org/

## The greatest of the great

C. A. R. Hoare. An axiomatic basis for computer programming.

http://sunnyday.mit.edu/16.355/Hoare-CACM-69.pdf

Peter J. Landin. The next 700 programming languages.

http://www.cs.cmu.edu/~crary/819-f09/Landin66.pdf

Robin Milner. A theory of type polymorphism in programming.

http://courses.engr.illinois.edu/cs421/sp2012/project/milner...

Gordon Plotkin. Call-by-name, call-by-value, and the λ-calculus.

http://homepages.inf.ed.ac.uk/gdp/publications/cbn_cbv_lambd...

John C. Reynolds. Towards a theory of type structure.

http://www.cs.cmu.edu/~crary/819-f09/Reynolds74.pdf

I find it troublesome that some of the code in BitMessage seems to be taken directly from Stackoverflow.com responses (it actually reminds me a lot of what I see happening at school). With that being said -- I do appreciate that this is new and can be improved upon quickly by a community of people with interest in such a system.

[0] https://github.com/Bitmessage/PyBitmessage/blob/master/src/a...

[1] http://stackoverflow.com/questions/1119722/base-62-conversio...

Yes please! Also could you tell us about the assignments and exams?

Where else do we look? Cheers