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:
- SPLV20 course notes☆114Updated 3 years ago
- Total Parser Combinators in Agda☆132Updated 5 months ago
- Fast parsing from bytestrings☆173Updated 3 months ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago
- 🚧 a work in progress effect system for Haskell 🚧☆138Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 4 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated last year
- GHC Whole Program Compiler and External STG IR tooling☆120Updated 2 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- A Haskell blog☆151Updated 3 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last year
- Compiling Agda code to readable Haskell☆196Updated last month
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Inspection Testing for Haskell☆189Updated 3 months ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 5 months ago
- Efficient Haskell effect handlers based on evidence translation.☆85Updated 4 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆84Updated 5 months ago
- A prototypical dependently typed languages with sized types and variances☆115Updated this week
- A tutorial on how Agda infers things☆63Updated 6 months ago
- Programming library for Agda☆134Updated last year
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago
- Build system☆132Updated 2 months ago
- Repository accompanying the ZuriHac Advanced Track lecture on Datatype-Generic Programming☆44Updated 5 years ago