AndrasKovacs / implicit-fun-elaboration
Implementation for ICFP 2020 paper
☆49Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for implicit-fun-elaboration
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Where my everyday research happens☆53Updated last week
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- ☆47Updated last month
- Staged push/pull fusion with typed Template Haskell☆57Updated 11 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- Correctness of normalization-by-evaluation for STLC☆21Updated 5 years ago
- Setoid type theory implementation☆38Updated last year
- Session Types with Priority in Linear Haskell☆25Updated 5 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- ☆21Updated 4 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆43Updated 2 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- ICFP tutorial☆40Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- ☆35Updated 3 years ago
- Implementing grep in Agda☆32Updated 3 years ago
- ☆27Updated last year
- The multimode presheaf proof-assistant☆36Updated last year