sweirich / replibLinks
Replib: generic programming & Unbound: generic treatment of binders
☆45Updated 2 years ago
Alternatives and similar repositories for replib
Users that are interested in replib are comparing it to the libraries listed below
Sorting:
- Where my everyday research happens☆53Updated last week
- Implementing grep in Agda☆33Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Agda programming with holes☆27Updated 4 years ago
- Implementation for ICFP 2020 paper☆53Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- ☆23Updated 11 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- ☆23Updated last year
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- NbE course @ Chalmers☆28Updated 8 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 5 months ago