So there’s these two things that French people do, which we notice from the outside but they have no clue about.
Archive for the ‘lecture’ Category
Both “what do you do?” and “where are you from?” are very loaded questions that will cause quite a few people offense.
My mom is a hoarder. Or maybe was. I don’t see her often. But she keeps stuff. She lives alone in a big house, and over the years she had accumulated enough stuff that she could start a bed & breakfast business, furnishing all her guest rooms with her accumulated properties.
Recently I designed a utility for my research. To implement this utility I needed a programming language that: 1) is appropriate for fast prototyping, 2) supports asynchronous, low-latency event handling, and 3) supports efficient in-program multi-way channel polling.
So far I could find, only Go fits the bill, and so I learned Go for a couple of days.
Report inside. Read the rest of this entry »
I have a habit to peek at printouts that have been left at our common printer for more than a few hours. Yesterday, I found this.
Whomever has enjoyed my company more than a few times will know I have a particular sensitivity to the adjective “normal” when used to qualify human behaviour. However, until today, I was at a loss when asked to properly explain why it grates me so much.
I did it again.
It’s like self-gratification: can’t hurt anyone, reliable pleasure, kept me busy for a while, pleasant relief afterwards.
Really, I ought to have been working on new, abstract, sexy-sounding research directions to advance my career.
Instead, I spent a half week programming and engineering. And I learned a damn lot about myself in the process.
People count things with words. Yet some internal features of number systems in human languages are fascinating.
An absolutely stunning feature of the lambda calculus is that it allows us to define functional recursion without using recursion. That is, the concept of recursion is fundamentally a by-product of being able to reproduce multiple copies of a function’s input in its output.
In other words, the “essence” of functional languages does not require recursion, because it is theoretically possible to define recursion from other functional concepts without using recursion itself.
But Haskell can’t do.