Highlights
- Pro
Stars
- All languages
- ATS
- Agda
- Assembly
- C
- C#
- C++
- CSS
- Clojure
- CoffeeScript
- Common Lisp
- Coq
- Crystal
- Dafny
- Dockerfile
- Elm
- Emacs Lisp
- Erlang
- F*
- Frege
- Go
- Grammatical Framework
- HTML
- Haskell
- Idris
- Janet
- Java
- JavaScript
- Jupyter Notebook
- Koka
- Kotlin
- LLVM
- Lean
- LiveScript
- Lua
- MATLAB
- MDX
- Makefile
- Mathematica
- Nearley
- Nix
- Nunjucks
- OCaml
- Objective-C
- Opa
- OpenSCAD
- Perl
- PostScript
- Prolog
- PureScript
- Python
- Racket
- Reason
- Rocq Prover
- Ruby
- Rust
- SMT
- Scala
- Scheme
- Shell
- Standard ML
- Swift
- SystemVerilog
- TeX
- TypeScript
- UrWeb
- Vim Script
- Visual Basic
- Visual Basic .NET
- wisp
Formalization of Vickrey-Clarke-Groves auction algorithm and mechanism (this repository is here for reference only; see mech.v for an up-to-date version)
The STM API we know and love, but useable in more circumstances
A bidirectional bindings generator for C++ and Rust.
In collaboration with the Rust Foundation, Rust Project, and appropriate external stakeholders, make C++ and Rust interoperability easily accessible and approachable to the widest possible audience
Specifications of the C++ standard library in BRiCk.
Financial Contracts eDSL & Valuation in Haskell. Final year dissertation project for my bachalors degree at University of Nottigham.
vellvm / ticl
Forked from vellvm/ctreesLibrary for structural temporal logic proofs over coinductive, free monads with effects and choice.
Loom is a framework for automated generation of foundational multi-modal verifiers. This repository is a mirror with stable snapshots. Submit issues and PRs here.
A native elisp coding agent running in Emacs
👻 Use your text editor to write in your browser. Everything you type in the editor will be instantly updated in the browser (and vice versa).
Utilities and reasoning principles for monads in Coq
A tool for use with clang to analyze #includes in C and C++ source files
Collection of scripts to improve the output of coqdoc [maintainers=@chdoc,@palmskog]
A small set of functions and programs to check if a function is fully tail-recursive.
This respository contains the formalization of different variations of divide-and-conquer algorithm design paradigm for lists. As a case study, we will see how these different variations lead to di…
Use a syntax-highlighting-esque construct to show the tree structure of code