# dragonwasrobot

“There are different rules for reading,
for thinking, and for talking.
Writing blends all three of them.”
Mason Cooley

• ### Making builds reliable and reproducible

In this post, we present how to significantly improve the reliability and reproducibility of software builds.
• ### Tools to increase productivity

In this post, we go through a set of tools for speeding up trivial tasks and cut out distractions.
• ### New projects page and improved post structure

In this post, we introduce an improved structure for the blog.
• ### Sum types in Kotlin, Elixir, and Elm

In this post, we define the concept of sum types with examples in Elm, Elixir, and Kotlin.
• ### Product types in Kotlin, Elixir, and Elm

In this post, we define the concept of product types with examples in Kotlin, Elixir, and Elm.
• ### Enum types in Kotlin, Elixir, and Elm

In this post, we define the concept of enum types with examples in Kotlin, Elixir, and Elm.
• ### An introduction to Information Security

In this post, we discuss a selection of tools and actions to improve your privacy.
• ### New color scheme and improved legibility

In this post, we introduce an improved theme for the blog.
• ### Idealized versions of Moessner's theorem and Long's theorem

In this post, we present idealized versions of Moessner's theorem and Long's theorem.
• ### A grid of Moessner triangles

In this post, we introduce a new combinatorial property of Moessner triangles.
• ### Deriving Moessner's sieve from Horner's method

In this post, we derive Moessner's sieve from Horner's method.
• ### Obtaining Taylor Polynomials with Horner's method

In this post, we calculate Taylor Polynomials with Horner's method.
• ### A characteristic function of Moessner's sieve

In this post, we introduce a characteristic function of Moessner's sieve.
• ### A dual to Moessner's sieve

In this post, we introduce a dual to Moessner's sieve.
• ### An introduction to Moessner's theorem and Moessner's sieve

In this post, we introduce Moessner's theorem and Moessner's sieve.
• ### Rotating Pascal's triangle and the binomial coefficient

In this post, we introduce the rotated versions of Pascal's triangle and the binomial coefficient.
• ### An introduction to Pascal's triangle and the binomial coefficient

In this post, we introduce Pascal's triangle and the binomial coefficient.
• ### Equivalence of interpretation and compilation followed by execution

In this post, we prove equivalence between interpretation and compilation of code.
• ### An interpreter, a compiler, and a virtual machine

In this post, we implement an interpreter, a compiler, and a virtual machine.
• ### An introduction to Horner's method

In this post, we introduce Horner's method for polynomial evaluation and polynomial division.
• ### A primer on the Coq Proof Assistant

In this post, we give a short primer on interactive theorem proving in the Coq Proof Assistant.

subscribe via Atom