mmcqd / datatt
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
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Setoid type theory implementation☆38Updated last year
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆36Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A simple supercompiler formally verified in Agda☆33Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 4 months ago
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- ☆47Updated 4 months ago
- Demo for dependent types + runtime code generation☆69Updated last month
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- ☆39Updated 8 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A simple functional programming language.☆21Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago