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☆32Updated last month
- IO using sized types and copatterns☆36Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 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☆57Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 7 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- System F in coq.☆19Updated 11 years ago
- being bits and pieces I'm inclined to leave lying around☆56Updated 3 weeks ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 8 months ago
- Where my everyday research happens☆56Updated this week
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- ☆17Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years 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☆51Updated 3 years ago
- A simple implementation of linear type theory☆39Updated 8 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- ☆16Updated 4 years ago