What are the foundational structures of probabilities? How do we design a language making it easy to model probabilistic problems? Oftentimes the modeling happens directly in terms of vectors and matrices, but there are better ways.

This article is my give on the relationship between mathematical proofs and programming languages. Many details on specific implementation have been left out with the aim for clarity and conceptual coherency.

In this article, we will look into encoding the Fibonacci function using the fix-point combinator. This is an interesting function as it can be used to implement general recursion in a programming language.

My current academic endeavors are in the field of probabilistic programming. I will wok this area until roughly June 2017. In the end it should hopefully translate to a thesis.