WhatisRT / meta-cedilleLinks
Minimalistic dependent type theory with syntactic metaprogramming
☆58Updated last year
Alternatives and similar repositories for meta-cedille
Users that are interested in meta-cedille are comparing it to the libraries listed below
Sorting:
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆51Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆85Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 5 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Eventually a practical 2-level TT-based compiler☆29Updated this week
- Where my everyday research happens☆55Updated last week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆79Updated 4 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- SPJ's tutorial on implementing functional languages☆29Updated 6 years ago
- A priliminary backend for Idris that compiles to Clean.☆15Updated 8 years ago
- classical sequent calculus, embedded in Haskell☆21Updated 4 months ago