alt-romes / hegg
Fast equality saturation in Haskell
☆76Updated 6 months ago
Related projects ⓘ
Alternatives and complementary repositories for hegg
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- ☆46Updated last month
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- A tutorial on how Agda infers things☆34Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆41Updated this week
- Staged push/pull fusion with typed Template Haskell☆57Updated 10 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆61Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Efficient Haskell effect handlers based on evidence translation.☆81Updated 3 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- A Language with Dependent Data and Codata Types☆53Updated this week
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 7 months ago
- ICFP tutorial☆40Updated 3 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- NbE course @ Chalmers☆28Updated last month
- Reimplementation of Parsley in Haskell, with improvements☆49Updated 8 months ago
- LLVM code generation in Haskell☆50Updated last week
- Haskell monad transformer for weighted, non-deterministic computation☆29Updated 10 months ago
- Basics of the dependently-typed functional language Agda ^_^☆38Updated 2 years ago
- Fast parsing from bytestrings☆148Updated last month
- An experimental Haskell library for programming with effectful runners.☆29Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- APIs for more recursive definitions☆19Updated 2 weeks ago
- Learn the Agda basics in three 2-hour sessions.☆54Updated last year
- Paper and talk☆45Updated last year