rodrigogribeiro / unificationLinks
Formalisation of a type unification algorithm in Coq proof assistant.
☆21Updated 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 4 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months 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
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- ☆18Updated 3 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Mtac in Agda☆28Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago