rodrigogribeiro / unificationLinks
Formalisation of a type unification algorithm in Coq proof assistant.
☆19Updated 6 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☆30Updated 2 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- Mtac in Agda☆28Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- IO using sized types and copatterns☆35Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- ☆18Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- ☆11Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago