0x0f0f0f / yasih
Yet another Scheme implemented in Haskell
☆20Updated 4 years ago
Related projects: ⓘ
- SPJ's tutorial on implementing functional languages☆28Updated 5 years ago
- Basics of the dependently-typed functional language Agda ^_^☆37Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 3 months ago
- Automatic piecewise-mutable references for your types☆42Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- JHC Haskell compiler split into reusable components☆58Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- They see me rollin'. They're Heyting. Patrollin' and tryna catch me ridin' dirty. -- Chamillionaire, 2005☆82Updated 3 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 6 years ago
- ICFP 2020 papers. Crowd-sourced☆92Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A verified compiler for a lazy functional language☆31Updated this week
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- ☆39Updated last month
- Free Algebras in Haskell☆36Updated 3 weeks ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated last year
- ICFP tutorial☆40Updated 3 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 4 years ago
- Tactic Metaprogramming in Haskell☆57Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago