# Heaviside’s partial fraction decomposition method.

A brief explanation of Heaviside’s cover-up method for partial fraction decomposition, domain extensions and applications to computer algebra.

A brief explanation of Heaviside’s cover-up method for partial fraction decomposition, domain extensions and applications to computer algebra.

A code golf challenge inspired by an anecdote about Dan Baronet.

The story of a forgotten invention that could have changed the world.

How to solve a mathematics problem using the supercharged powers of APL?

An evaluator for untyped lambda calculus written in Dyalog APL.

Speeding up the Debian’s

`ent`

tool for entropy estimation with the outcome of 8x-11x performance improvement.
A short and interactive introduction to Subleq - a Turing-complete one instruction computer.

An easy method to accelerate the computation of infinite sums of rational functions using the digamma function and other numerical methods.

An easy, reusable way of embedding resources into SDL2 applications.

Extending the infection mechanisms and implementing payload compression.