Sign in with Facebook
“The methodological benefits of functional languages are well known [Bac78, Hug89, HJ94], but still the vast majority of programs are written in imperative languages such as C. This apparent contradiction is easily explained by the fact that functional languages have historically been slower than their more traditional cousins, but this gap is narrowing.”
― Purely Functional Data Structures
― Purely Functional Data Structures
“Это на самом деле единственное условие, которому должны удовлетворять make-rat, numer и denom, чтобы служить основой для представления рациональных чисел. В общем случае можно считать, что данные — это то, что определяется некоторым набором селекторов и конструкторов, а также некоторыми условиями, которым эти процедуры должны удовлетворять, чтобы быть правильным представлением 5 . Эта точка зрения может послужить для определения не только”
―
―
“Amortization allows for occasional operations to have actual costs that exceed their amortized costs. Such operations are called expensive. Operations whose actual costs are less than their amortized costs are called cheap. Expensive operations decrease the accumulated savings and cheap operations increase it. The key to proving amortized bounds is to show that expensive operations occur only when the accumulated savings are sufficient to cover the remaining cost.”
― Purely Functional Data Structures
― Purely Functional Data Structures
“The first visible effect of converting from departments and batches to product teams and flow is that the time required to go from concept to launch, sale to delivery, and raw material to the customer falls dramatically. When flow is introduced, products requiring years to design are done in”
― Lean Thinking: Banish Waste and Create Wealth in Your Corporation
― Lean Thinking: Banish Waste and Create Wealth in Your Corporation
“The notion of amortization arises from the following observation. Given a sequence of operations, we may wish to know the running time of the entire sequence, but not care about the running time of any individual operation. For instance, given a sequence of n operations, we may wish to bound the total running time of the sequence by O(n) without insisting that every individual operation run in O(1) time. We might be satisfied if a few operations run in O(log n) or even O(n) time, provided the total cost of the sequence is only O(n). This freedom opens up a wide design space of possible solutions, and often yields new solutions that are simpler and faster than worst-case solutions with equivalent bounds.”
― Purely Functional Data Structures
― Purely Functional Data Structures
SF Ruby Book Club
— 59 members
— last activity Mar 13, 2015 03:33PM
For those in the San Francisco Ruby Meetup Group interested in reading and discussing Ruby, Rails, and related books!
Nicola’s 2025 Year in Books
Take a look at Nicola’s Year in Books, including some fun facts about their reading.
129 books
|
27 friends
955 books
|
92 friends
1,084 books
|
100 friends
87 books
|
12 friends
260 books
|
328 friends
98 books
|
61 friends
108 books
|
25 friends
1,832 books
|
195 friends
More friends…
Polls voted on by Nicola
Lists liked by Nicola
