AndrasKovacs / implicit-fun-elaborationLinks
Implementation for ICFP 2020 paper
☆54Updated 4 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
Sorting:
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- ☆51Updated 5 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆30Updated last week
- Where my everyday research happens☆55Updated last week
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- A library for doing generic programming in Agda☆36Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated last week
- Staged push/pull fusion with typed Template Haskell☆62Updated 2 years ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 3 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Paper and talk☆55Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Generic functions for single-sorted first-order structural unification☆45Updated 8 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Specification of Agda.☆25Updated 7 years ago