duo-lang / duo-lang
Duo - A research language exploring duality in programming language design
☆57Updated last year
Alternatives and similar repositories for duo-lang:
Users that are interested in duo-lang are comparing it to the libraries listed below
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- Demo for dependent types + runtime code generation☆69Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 4 months ago
- Setoid type theory implementation☆38Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- A toy dependent typed language.☆28Updated last week
- ☆36Updated 3 years ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- ☆31Updated 6 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- Eventually a practical 2-level TT-based compiler☆27Updated 2 weeks ago
- Implementation for ICFP 2020 paper☆50Updated 3 years ago
- A simple functional programming language.☆21Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- ☆39Updated 8 months ago
- ☆47Updated 4 months ago
- being an operating system for typechecking processes☆126Updated last year
- high-performance cubical evaluation☆71Updated 4 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated 11 months ago
- A verified compiler for a lazy functional language☆34Updated 2 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A core language and API for dependently typed languages☆91Updated last month
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Formalization of 2LTT in Agda☆15Updated last year
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆97Updated 2 years ago