Experiments with denotational semantics in Agda

A Language with Dependent Data and Codata Types

A Programmatic Incremental Build System in Rust

The empty type Void.

Mold: A Modern Linker 🦠

A demo implementation of a simple dependently-typed language

Agda is a dependently typed programming language / interactive theorem prover.

Constructive Galois connections

The Fast Downward domain-independent classical planning system

TeMoS: Temporal Stream Logic Modulo Theories Synthesis

A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.

Agda bindings to SMT-LIB2 compatible solvers.

Anonymous Github is a proxy server to support anonymous browsing of Github repositories for open-science code and data.

Sail architecture definition language

The Agda standard library

A massively parallel, optimal functional runtime in Rust

Search-based compiler for high-performance DSP programming

The Serenity Operating System 🐞

cloc counts blank lines, comment lines, and physical lines of source code in many programming languages.

https://metaborg.github.io/mj.agda/

A superoptimizer for LLVM IR

Rust parser combinator framework

egg is a flexible, high-performance e-graph library

DFA regular expression library & friends

Haskell re-implementation of STOKE, the stochastic superoptimizer

Empowering everyone to build reliable and efficient software.

WebAssembly specification, reference interpreter, and test suite.

Optimizer and compiler/toolchain library for WebAssembly

Haskell bindings to Microsoft's Z3 API (unofficial).

The Z3 Theorem Prover