AndrasKovacs / dtt-rtcgLinks
Demo for dependent types + runtime code generation
☆71Updated 6 months ago
Alternatives and similar repositories for dtt-rtcg
Users that are interested in dtt-rtcg are comparing it to the libraries listed below
Sorting:
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A toy dependent typed language.☆32Updated last week
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A tutorial on how Agda infers things☆61Updated 2 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last month
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- Setoid type theory implementation☆38Updated 2 years ago
- A toy example of a verified compiler.☆29Updated 4 months ago
- Anders: Cubical Type Checker☆23Updated last year
- ☆48Updated last month
- high-performance cubical evaluation☆75Updated 4 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- a proof-of-concept programming language based on call-by-push-value☆54Updated this week
- ☆37Updated last month
- A verified compiler for a lazy functional language☆37Updated last week
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Lecture notes on realizability☆74Updated 6 months ago
- Staged compilation with dependent types☆180Updated 4 months ago
- Benchmarks for capture-avoiding substitution☆119Updated 3 months ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated last month
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year