wilbowma / mttex
A LaTeX package for formatting meta-theory.
☆46Updated 4 years ago
Alternatives and similar repositories for mttex:
Users that are interested in mttex are comparing it to the libraries listed below
- Miller/pattern unification in Agda☆63Updated 11 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Constructive Galois connections☆32Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Model finder for higher-order logic☆41Updated last year
- Implementation of Nuprl's type theory in Coq☆44Updated 2 months ago
- ☆52Updated last month
- being the beginnings of at least zero typecheckers☆32Updated 7 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Abstracting Definitional Interpreters☆67Updated 7 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Algebraic Combinatorics in Coq☆38Updated 3 weeks ago
- An enhanced unification algorithm for Coq☆53Updated last week
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An interactive theorem prover based on lambda-tree syntax☆91Updated 2 weeks ago
- A Coq library for parametric coinduction☆45Updated 2 weeks ago
- ☆22Updated 8 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 10 months ago