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 2 weeks ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Mtac in Agda☆29Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated last week
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- ☆16Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- ☆17Updated 7 years ago
- Logical relations proof in Agda☆27Updated 10 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
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 months ago
- Where my everyday research happens☆55Updated this week
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago