CyberCat-Institute / AptweLinks
A well typed by construction kernel language for bidirectional programming
☆13Updated 10 months ago
Alternatives and similar repositories for Aptwe
Users that are interested in Aptwe are comparing it to the libraries listed below
Sorting:
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A formalization of System Fω in Agda☆19Updated 9 months ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Demo for dependent types + runtime code generation☆72Updated 9 months ago
- My Agda blog/lab/playground☆12Updated 2 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Updated last week
- Graded Dependent Type systems☆25Updated 2 years ago
- Formalization of type theory☆22Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- A TOML parser for Idris 2☆17Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated 3 months ago
- Interpret Haskell programs into any cartesian closed category.☆67Updated last week
- ☆17Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆27Updated last week
- Various mechanized proof files for fun.☆13Updated 3 months ago
- An implementation of Haskell’s MVars in Racket☆30Updated last year
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 3 months ago
- ☆21Updated 7 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Class of data structures that can be unfolded.☆22Updated 2 years ago
- a self-hosting lambda calculus compiler☆37Updated 7 months ago