Minimal implementations for dependent type checking and elaboration

Nola: Later-Free Ghost State for Verifying Termination in Iris

아카콘 돚거 프로그램

The Candle theorem prover (fork of the HOL Light sources)

A Coq IDE build on top of Proof General's Coq mode

A prototypical dependently typed languages with sized types and variances

A proof assistant and a dependently-typed language

Pure and reproducible nix overlay of binary distributed rust toolchains

A Coq library written by members of PnV Discord Server

https://github.com/gothinkster/realworld

Coq code and exercises from the Coq'Art book [maintainers=@ybertot,@Casteran]

This repository is texification of lecture note of CS520, Theory of Programming Language, 2019 Fall in KAIST.

Ongoing Lean formalisation of the proof of Fermat's Last Theorem

Lean 4 programming language and theorem prover

A persistent storage engine for Multi-Raft log

The glitch-soc/Mastodon fork running on types.pl

Linearizability Hoare Logic

A project to digitalise results from physics into Lean.

Chatting system using raft protocol

TLA+ specification for the Raft consensus algorithm

Verified Rust for low-level systems code

An implementation of the higher-order supercompilation algorithm as described in the paper "On the Termination of Higher-Order Positive Supercompilation"

Liquid Types For Haskell

A formal consistency proof of Quine's set theory New Foundations