Framework for generating constrained random data using a subset of first order logic

Haskell implemented with combinators

Minimal implementations for dependent type checking and elaboration

Proof assistant based on the λΠ-calculus modulo rewriting

PKGBUILDs for Arch Linux

Logical manifestations of topological concepts, and other things, via the univalent point of view.

Selected Papers of Dana S. Scott

Parametric Fitch-style modal lambda calculus

HoTTEST Summer School materials

papers of Per Martin Löf

A collaborative bibliography of work related to the theory and practice of computational effects

BiBLaTeX style for Springer Lecture Notes in Computer Science

The Ur/Web programming language

Formalizing nbe in agda

Self-contained repository for the eponymous paper

An Agda development of ordinal notations based on Cantor normal form via simultaneous definitions

Formal model of Bitcoin transactions in Agda

Organization and planning for the Initial Types Club

Exponential Elimination for Categorical Combinators

A dependently typed programming language, a successor to Idris

Koka language compiler and interpreter

A statically-typed linear functional language with graded modal types for fine-grained program reasoning

🚣 Smuggle all imports

An experiment in diffing clojure code

The Agda standard library

Preprocessor for typesetting Haskell sources with LaTeX

Hadrian: a new build system for the Glasgow Haskell Compiler. Now merged into the GHC tree!

Implementation of monotone frameworks in Agda

Contains some guides and examples related to the Utrecht University Attribute Grammar Compiler (UUAGC)