TheoWinterhalter/formal-type-theory
Formalising Type Theory in a modular way for translations between type theories
Researcher, proof assistants and dependent types
Formalising Type Theory in a modular way for translations between type theories
Coq formalisation and plugin of a translation from ETT to ITT
Dependent composable partial functions for free in Coq
Archive for all Coq related OPAM packages organized in various repositories
Elm architecture and (V)DOM for OCaml
Local computation rules in type theory
Phd Thesis of Théo Winterhalter. Look at releases to get the latest PDF.
A formalisation of a dependent type theory with ghost types
A collection of tools for writing technical documents that mix Coq code and prose.
Alternative to W types that actually computes
Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
Sources of the EuroProofNet web site.
A Visual Studio Code extension for Coq [maintainer=@maximedenes]
Partial Dijkstra monads for all
Coq formalisation of a translation from (an) extensional type theory to (a) weak type theory
Shape-Irrelevant Reflection Type Theory
Reflection library for Coq
A LaTeX class for books, reports or theses based on https://github.com/kenohori/thesis and https://github.com/Tufte-LaTeX/tufte-latex.
Implementing the Gallinette website and its blog
Agda language support for the Atom editor
Master Thesis with Nicolas Tabareau on Resizing Rules and Reflection
Write HTML with ocaml (just fun with continuations)
Add character count for atom editor
Prolog language support for Atom
Provides actually decent code highlighting for x86-64 assembly in Sublime Text