andorp / mini-grin
ICFP tutorial
☆39Updated 3 years ago
Alternatives and similar repositories for mini-grin:
Users that are interested in mini-grin are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- rewrite rules for type-level equalities☆62Updated 10 months ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 3 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Existential type.☆37Updated 2 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- NbE course @ Chalmers☆28Updated 5 months ago
- Normalization by Evaluation for Embedded Domain-specific Languages☆31Updated 4 months ago
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- Where my everyday research happens☆52Updated this week
- A usable type system for call by push-value☆33Updated 5 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Session Types with Priority in Linear Haskell☆26Updated 9 months ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- ☆18Updated 3 years ago
- ☆12Updated 4 years ago