ssomayyajula / refinery
A proof assistant for refinement logics
☆8Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for refinery
- Formalisation of a type unification algorithm in Coq proof assistant.☆18Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- A bare-bones LCF-style proof assistant☆21Updated 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
- Implementation of sprintf for Coq☆18Updated 4 years ago
- ☆11Updated 4 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- All the code I've ever written in Ltac2☆11Updated 3 years ago
- A discouraging story.☆15Updated 6 years ago
- Tactic for polynomial manipulations☆10Updated 9 months ago
- Domain theory and denotational semantics in Coq☆10Updated 9 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- IO using sized types and copatterns☆33Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆15Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 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
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- ☆17Updated 2 years ago