ssomayyajula / refineryLinks
A proof assistant for refinement logics
☆8Updated 6 years ago
Alternatives and similar repositories for refinery
Users that are interested in refinery are comparing it to the libraries listed below
Sorting:
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆11Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- ☆15Updated last week
- Tactic for polynomial manipulations☆10Updated last month
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- ☆18Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- ☆17Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 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☆24Updated 5 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 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 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month