sweirich / challengeLinks
Strongly-typed System F in Haskell
☆117Updated 2 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☆112Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- Total Parser Combinators in Agda☆130Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 6 months ago
- GHC Whole Program Compiler and External STG IR tooling☆118Updated 7 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Fast parsing from bytestrings☆161Updated 2 weeks ago
- 🚧 a work in progress effect system for Haskell 🚧☆130Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Compiling Agda code to readable Haskell☆189Updated 3 weeks ago
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated 11 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- A small implementation of higher-order unification☆189Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Inspection Testing for Haskell☆177Updated last month
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆82Updated 5 months ago
- A tutorial on how Agda infers things☆58Updated this week
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- A Haskell blog☆143Updated 2 weeks ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Programming library for Agda☆129Updated 10 months ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 4 years ago