CyberCat-Institute / AptweLinks
A well typed by construction kernel language for bidirectional programming
☆14Updated 6 months ago
Alternatives and similar repositories for Aptwe
Users that are interested in Aptwe are comparing it to the libraries listed below
Sorting:
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Anders: Cubical Type Checker☆23Updated last year
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- An implementation of Haskell’s MVars in Racket☆29Updated 9 months ago
- A formalization of System Fω in Agda☆17Updated 5 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- ☆21Updated 7 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- Category Theory & Cobordism Categories in Lean 4☆16Updated last year
- A toy dependent typed language.☆30Updated this week
- Organize mathematical thoughts☆20Updated last year
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Various mechanized proof files for fun.☆11Updated 5 months ago
- Experiments with Cubical Agda☆11Updated last week
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- Intrinsic Verification of Formal Grammar Theory☆26Updated this week
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Setoid type theory implementation☆38Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- ☆13Updated 3 months ago