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 4 years ago
- Eventually a practical 2-level TT-based compiler☆29Updated last week
- Setoid type theory implementation☆38Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆61Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Where my everyday research happens☆55Updated last month
- ☆51Updated 3 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated last month
- A prototypical dependently typed languages with sized types and variances☆113Updated 3 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Specification of Agda.☆25Updated 6 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- Staged push/pull fusion with typed Template Haskell☆62Updated last year
- being bits and pieces I'm inclined to leave lying around☆54Updated 4 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- # A simple variable binding library based on well-scoped indices and environments☆27Updated last month
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- Benchmarking various normalization algorithms for the lambda calculus☆47Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 3 months ago
- Paper and talk☆55Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A TACtic library for Agda☆50Updated last year
- Session Types with Priority in Linear Haskell☆27Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- Extensions to cubical for categorical logic/type theory☆34Updated this week