hazelgrove / hazelnut-dynamics-agdaLinks
mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
☆21Updated last year
Alternatives and similar repositories for hazelnut-dynamics-agda
Users that are interested in hazelnut-dynamics-agda are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆36Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆21Updated 7 years ago
- ☆16Updated 11 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- ☆17Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- being an experiment with potato power☆23Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Constructive Galois connections☆36Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 10 months ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- ☆29Updated 10 years ago
- A verified compiler for a lazy functional language☆37Updated last week
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Work in progress on semi-simplicial types☆23Updated 3 years ago