sweirich / challengeLinks
Strongly-typed System F in Haskell
☆120Updated 3 years ago
Alternatives and similar repositories for challenge
Users that are interested in challenge are comparing it to the libraries listed below
Sorting:
- Fast parsing from bytestrings☆173Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆122Updated 8 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 2 weeks ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated last year
- 🚧 a work in progress effect system for Haskell 🚧☆138Updated 2 years ago
- SPLV20 course notes☆114Updated 3 years ago
- Total Parser Combinators in Agda☆133Updated 5 months ago
- GHC Whole Program Compiler and External STG IR tooling☆120Updated 3 months ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- Inspection Testing for Haskell☆189Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- GRIN backend for GHC☆142Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last week
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆85Updated last week
- A small implementation of higher-order unification☆192Updated 8 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- The Helium compiler, Helium-as-a-library, and the texthint interpreter☆98Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- A Haskell blog☆151Updated 3 months ago
- Reimplementation of Parsley in Haskell, with improvements☆60Updated 3 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Compiling Agda code to readable Haskell☆199Updated 2 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 6 months ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 4 years ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- A tutorial on how Agda infers things☆63Updated 6 months ago