sweirich / challenge
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
- Benchmarks for capture-avoiding substitution☆113Updated 3 weeks ago
- Fast parsing from bytestrings☆156Updated 2 months ago
- SPLV20 course notes☆108Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- being an operating system for typechecking processes☆124Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- A friendly effect system for Haskell☆230Updated 9 months ago
- 🚧 a work in progress effect system for Haskell 🚧☆124Updated last year
- Total Parser Combinators in Agda☆126Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Fast and concise extensible effects☆108Updated last year
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆79Updated last month
- Language Server for Agda☆106Updated 2 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A Haskell blog☆134Updated 8 months ago
- ☆99Updated this week
- Compiling Agda code to readable Haskell☆182Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- GHC Whole Program Compiler and External STG IR tooling☆117Updated 4 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Fake dependent types in Haskell using singletons☆290Updated this week
- Repository accompanying the ZuriHac Advanced Track lecture on Datatype-Generic Programming☆44Updated 4 years ago
- Extensional capabilities and deriving combinators☆214Updated 8 months ago
- Unification and type inference algorithms☆125Updated 10 years ago