rodrigogribeiro / unificationLinks
Formalisation of a type unification algorithm in Coq proof assistant.
☆21Updated 7 years ago
Alternatives and similar repositories for unification
Users that are interested in unification are comparing it to the libraries listed below
Sorting:
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Mtac in Agda☆28Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- ☆17Updated 7 years ago
- Where my everyday research happens☆55Updated last month
- System F in coq.☆19Updated 10 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- The Prettiest Printer☆35Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago