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
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A simple functional programming language.☆21Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- Setoid type theory implementation☆38Updated last year
- An experimental type checker for a modal dependent type theory.☆112Updated 4 years ago
- ICFP tutorial☆39Updated 3 years ago
- 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
- Efficient effect handlers based on Evidence Passing Semantics.☆29Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆48Updated 3 years ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A verified compiler for a lazy functional language☆35Updated last week
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- a self-hosting lambda calculus compiler☆35Updated last month
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- ☆36Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- IO using sized types and copatterns☆34Updated 4 years ago