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☆31Updated 2 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆17Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 weeks ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆18Updated 3 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 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
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- a version of the 2048 game for Coq☆22Updated last year
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago