Space-filling curves, constructively

How to implement dependent type theory I (2012)

How to implement type theory in an hour (2018)

Seemingly Impossible Functional Programs

Representations of Uncomputable and Uncountable Sets (2008)

The Dawn of Formalized Mathematics

Computing an integer using a Grothendieck topos

A general definition of dependent type theories

Seemingly impossible functional programs

Sometimes all functions are continuous (2006)

Derivations as computations, by Andrej Bauer: "we think of a derivation as a computation tree showing how to compute its conclusion." [abstract + link to PDF of slides]

How to implement type theory in an hour

Proof of negation and proof by contradiction (2010)

The new and improved Programming languages zoo

Hask is not a category

The Andromeda proof assistant (Leeds workshop slides): " Andromeda ..

A Brown-Palsberg self-interpreter for Gödel’s System T

Seemingly impossible functional programs (2007)

How to implement dependent type theory (Part I)