AndrasKovacs / implicit-fun-elaboration
Implementation for ICFP 2020 paper
☆49Updated 3 years ago
Alternatives and similar repositories for implicit-fun-elaboration:
Users that are interested in implicit-fun-elaboration are comparing it to the libraries listed below
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Session Types with Priority in Linear Haskell☆25Updated 8 months ago
- Where my everyday research happens☆52Updated this week
- Staged push/pull fusion with typed Template Haskell☆57Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- Setoid type theory implementation☆38Updated last year
- Unification and type inference algorithms☆124Updated 10 years ago
- my phd thesis☆26Updated 6 months ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- ☆47Updated 3 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- The multimode presheaf proof-assistant☆36Updated last year
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- ICFP tutorial☆39Updated 3 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 weeks ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 7 months ago
- Generic functions for single-sorted first-order structural unification☆42Updated this week
- Specification of Agda.☆25Updated 6 years ago