ziman / ttstar
Dependently typed core calculus with erasure
☆19Updated 3 years ago
Alternatives and similar repositories for ttstar:
Users that are interested in ttstar are comparing it to the libraries listed below
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Anders: Cubical Type Checker☆22Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Session types in Idris2!☆27Updated 4 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Example row-polymorphism implementations☆61Updated last year
- ☆39Updated 6 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- ☆26Updated 8 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Setoid type theory implementation☆38Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago