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 6 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- a version of the 2048 game for Coq☆22Updated last year
- Mtac in Agda☆28Updated 4 years ago
- ☆11Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 9 months ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 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☆14Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- ☆18Updated 2 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- 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
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Quasi-quoting library for agda☆17Updated 5 months ago
- ☆29Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month