Tag Archives: computer science

Lambda Calculus for the Imperative Programmer I

This post is first in a series of articles on lambda calculus. You can see the whole series by looking up the tag lcip. The Untyped Lambda Calculus At the very core, the untyped lambda calculus (referred to as λ … Continue reading

Posted in Computers | Tagged , , | 1 Comment

Initial Algebras: Part II

In the last post we looked at functor algebras and properties of morphisms (arrows) between them. In this post we’ll explore initial functor algebras (or initial F-Algebras). The Cliffhanger The last episode ended with a question on whether it is … Continue reading

Posted in Computers | Tagged , , , , | Leave a comment

A Theoretically Correct C++ Compiler

I just realized that a C++ compiler can never be theoretically correct. This follows from the fact that C++ templates are Turing Complete (no, really) and the halting problem. We can never say for sure whether a template expression is … Continue reading

Posted in Computers | Tagged , , , | 2 Comments