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
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- Benchmarks for capture-avoiding substitution☆113Updated last month
- Fast parsing from bytestrings☆156Updated 2 months ago
- Total Parser Combinators in Agda☆126Updated last year
- An implementation of Pie in Haskell☆205Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- 🚧 a work in progress effect system for Haskell 🚧☆124Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆79Updated 3 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆100Updated 2 years ago
- Inspection Testing for Haskell☆175Updated 2 months ago
- SPLV20 course notes☆108Updated 2 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- being an operating system for typechecking processes☆125Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆79Updated last month
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- Fast and concise extensible effects☆108Updated last year
- A friendly effect system for Haskell☆230Updated 10 months ago
- GHC Whole Program Compiler and External STG IR tooling☆118Updated 4 months ago
- Compiling Agda code to readable Haskell☆182Updated last week
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- GRIN backend for GHC☆144Updated 3 years ago
- ☆99Updated last week
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago