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:
- ☆21Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- ☆16Updated 6 months ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 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
- IO using sized types and copatterns☆35Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- ☆17Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months 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.☆22Updated 8 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- ☆29Updated 9 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago