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 8 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Mtac in Agda☆29Updated 4 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- ☆17Updated 7 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 4 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago