ssomayyajula / refinery
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
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A discouraging story.☆15Updated 6 years ago
- ☆11Updated 4 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Tactic for polynomial manipulations☆10Updated last year
- 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
- Implementation of sprintf for Coq☆18Updated 4 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
- ☆13Updated 7 months ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- ☆17Updated 2 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- ☆18Updated 2 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 weeks ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago