sweirich / challengeLinks
Strongly-typed System F in Haskell
☆118Updated 2 years ago
Alternatives and similar repositories for challenge
Users that are interested in challenge are comparing it to the libraries listed below
Sorting:
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Fast parsing from bytestrings☆164Updated last month
- SPLV20 course notes☆112Updated 2 years ago
- 🚧 a work in progress effect system for Haskell 🚧☆130Updated last year
- GHC Whole Program Compiler and External STG IR tooling☆118Updated 8 months ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 6 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Total Parser Combinators in Agda☆131Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Reimplementation of Parsley in Haskell, with improvements☆56Updated last year
- Efficient Haskell effect handlers based on evidence translation.☆84Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- An implementation of Pie in Haskell☆205Updated 5 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 9 months ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 weeks ago
- A small implementation of higher-order unification☆189Updated 7 years ago
- Inspection Testing for Haskell☆177Updated last month
- A Haskell blog☆146Updated 3 weeks ago
- Utilities and documentation for exploring idirs2's new elaborator reflection.☆83Updated 6 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Unification and type inference algorithms☆125Updated 10 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago