- All languages
- Agda
- Assembly
- Awk
- C
- C#
- C++
- CMake
- CSS
- Clojure
- Common Lisp
- Coq
- Cuda
- D
- Dockerfile
- Elixir
- Emacs Lisp
- Fluent
- Fortran
- Frege
- Go
- HTML
- Haskell
- HolyC
- Idris
- Inno Setup
- Isabelle
- Java
- JavaScript
- Julia
- Jupyter Notebook
- Just
- Kotlin
- Lean
- LilyPond
- Lua
- MATLAB
- MDX
- Makefile
- Markdown
- Mathematica
- Max
- Mustache
- Nim
- Nix
- OCaml
- Objective-C
- Odin
- PHP
- Perl
- Pony
- Processing
- Pure Data
- Python
- QML
- R
- Racket
- Rich Text Format
- Rocq Prover
- Ruby
- Rust
- SCSS
- Scala
- Scheme
- Shell
- Shen
- Smalltalk
- Standard ML
- SuperCollider
- Svelte
- Swift
- Tcl
- TeX
- TypeScript
- V
- VBA
- VHDL
- Vala
- Vim Script
- Vue
- Zig
Starred repositories
An introduction to programming language theory in Agda
A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory
An introductory course to Homotopy Type Theory
Logical manifestations of topological concepts, and other things, via the univalent point of view.
Lecture notes on univalent foundations of mathematics with Agda
Proofs for the exercises for Lawvere and Schanuel's Conceptual Mathematics
Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -> nat) in System T.
some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson