mmcqd / datattLinks
A dependent type theory with user defined data types
☆46Updated 3 years ago
Alternatives and similar repositories for datatt
Users that are interested in datatt are comparing it to the libraries listed below
Sorting:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Setoid type theory implementation☆38Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- ☆36Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago