6. 1861
Tuesday, 7 May 13
“A general “law of least effort” applies to cognitive as well as physical
exertion. The law asserts that if there are several ways of achieving the
same goal, people will eventually gravitate to the least demanding course
of action. In the economy of action, effort is a cost, and the acquisition of
skill is driven by the balance of benefits and costs. Laziness is built deep into our nature.”
7. Tuesday, 7 May 13
Personal experience
Negative experience
Fundamental attribution error
16. Offset Moore’s law
Tuesday, 7 May 13
"software is getting slower more rapidly than hardware becomes faster." this was said in 1995 the year java was released.
17. JS’s moore law?
Tuesday, 7 May 13
As javascript get engines get faster, developers will increase double the size of their libraries
every 2 years.
This is 2010 to 2013, so it almost lines up.
22. The Somebody Else's Problem
Field is a field running on the
principle that if something is
identified to be somebody else's
problem, the brain will edit it
out of the person's vision. -
Adams
Tuesday, 7 May 13
We have invented phrases that our somebody elses problem’
Ship it. premature optimization...
89. Tuesday, 7 May 13
December, 2004.
Jeffrey Dean
Jeff Dean puts his pants on one leg at a time, but if he had more legs, you would see that his approach is O(log n).
102. Fantasy land
Tuesday, 7 May 13
It was so named after the infamous bug 94 on the promises spec
Dealing with null.
103. Free.
Tuesday, 7 May 13
By adhering to these specs we start go get some things for free.
For example in my previous maybe example i wrote map. We don’t actually have to do that.
It can be implmented for us.
Same with a whole host of functions Lift for example which takes a function and runs it in the
monadic context.
Again we don’t have to worry about writing any of this, we get it for free.
We get assurances to an extent that these operations will run. Regardless of where or what
the monad is dealing with.
Just freedom. Is this not the idea of the lazy developer and comforms to DRY, LRU etc etc etc
Unfortuantly we can not get 100% assurance if we were to do this, we would need to rely on
another concept from the early computer science days...
104. Types
Tuesday, 7 May 13
Types can take this concept even further.
We don’t have to worry about people doing stupid things with our code as we can remove
this ability for them
112. A type system is a tractable syntactic
method for proving the absence of certain
program behaviors by classifying phrases
according to the kinds of values they
compute.
Tuesday, 7 May 13
113. A type system is a tractable syntactic
method for proving the absence of certain
program behaviors by classifying phrases
according to the kinds of values they
compute.
Tuesday, 7 May 13
tractable easy to control
114. A type system is a tractable syntactic
method for proving the absence of certain
program behaviors by classifying phrases
according to the kinds of values they
compute.
Tuesday, 7 May 13