recentpopularlog in


« earlier   
The Y Combinator (no, not that one) – Ayaka Nonaka – Medium
Lambda calculus (or λ-calculus) was invented by Alonzo Church in 1930 as a formal system for expressing computation. Although it has the word “calculus” in it, it is far from related to the calculus that Newton and Leibniz invented. In fact, it is a lot closer to programming than mathematics as most of us know it.
p-general  p-haskell 
3 days ago by Chronologos
Write You a Haskell ( Stephen Diehl )
Fundamental to all functional languages is the most atomic notion of composition, function abstraction of a single variable. The lambda calculus consists very simply of three terms and all valid recursive combinations thereof.
p-general  p-haskell 
4 days ago by Chronologos
What Every Programmer Should Know About Memory
As CPU cores become both faster and more numerous, the limiting factor for most programs is now, and will be for some time, memory access. Hardware designers have come up with ever more sophisticated memory handling and acceleration techniques–such as CPU caches–but these cannot work optimally without some help from the programmer. Unfortunately, neither the structure nor the cost of using the memory subsystem of a computer or the caches on CPUs is well understood by most programmers. This paper explains the structure of memory subsystems in use on modern commodity hardware, illustrating why CPU caches were developed, how they work, and what programs should do to achieve optimal performance by utilizing them.
p-general  hardware 
5 days ago by Chronologos
Rust in 2018: it's way easier to use! - Julia Evans
I’ve been using Rust on and off since late 2013. 4 weeks ago, I picked up Rust again, and the language is SO MUCH EASIER than it was the last time I tried it (May 2016). I think that’s really exciting! So I wanted to talk about why I like using Rust today, and a couple of ideas for where Rust could go in the next year! (as a response to the call for community blogposts).
7 days ago by Chronologos
An Interactive Introduction To Quantum Computing
Heard of quantum computers? Heard that they are faster than conventional computers? Perhaps you have heard of quantum bits (abbreviated to qubits). Maybe you have even heard of the puzzling notion that qubits can have the values 0 and 1 both at the same time. Let me try to explain what this really means.
p-general  physics 
23 days ago by Chronologos
Evil Coding Incantations - Posts
Ever since I watched the revered Wat video by Gary Bernhardt, I’ve been fascinated with the strange behavior of certain programming languages. Some programming languages have more unexpected behaviors than others. Java, for example, has a whole book dedicated to its edge cases and peculiarities. For C++’s equivalent, you can refer to the C++ specification itself for just 200 USD.
27 days ago by Chronologos
Zipper (data structure) - Wikipedia
A zipper is a technique of representing an aggregate data structure so that it is convenient for writing programs that traverse the structure arbitrarily and update its contents, especially in purely functional programming languages. The zipper was described by Gérard Huet in 1997.[1] It includes and generalizes the gap buffer technique sometimes used with arrays.
october 2017 by Chronologos

Copy this bookmark:

to read