rodrigogribeiro / unification
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
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- System F in coq.☆19Updated 10 years ago
- ☆11Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 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
- Mtac in Agda☆28Updated 3 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- ☆17Updated 6 years ago
- ☆18Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago