haskell-rewriting / term-rewriting
Yet another haskell term rewriting library
☆18Updated last year
Alternatives and similar repositories for term-rewriting:
Users that are interested in term-rewriting are comparing it to the libraries listed below
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Relation algebra library for Coq☆48Updated last month
- Formalization of Linear Logic☆10Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- ☆11Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Simple autograder for Haskell programming assignments☆17Updated 2 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- Category theory and algebra☆28Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- ☆10Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Mtac in Agda☆28Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago