ssomayyajula / refineryLinks
A proof assistant for refinement logics
☆8Updated 7 years ago
Alternatives and similar repositories for refinery
Users that are interested in refinery are comparing it to the libraries listed below
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- a version of the 2048 game for Coq☆22Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆17Updated 6 years ago
- ☆18Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- ☆11Updated 5 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Implementation of sprintf for Coq☆18Updated 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
- Lenses in Coq☆19Updated 2 years ago
- ☆17Updated 3 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months 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
- 👹 A library for hierarchical names and lexical scoping☆26Updated 10 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- ☆27Updated 5 years ago
- Tactic for polynomial manipulations☆10Updated 2 months ago
- A discouraging story.☆16Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆13Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago