gdijkstra / hs-to-gallina
Experimentation project
☆16Updated 10 years ago
Related projects: ⓘ
- ☆17Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Linear map categories in Agda☆5Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆15Updated 4 years ago
- ☆12Updated this week
- Quasi-quoting library for agda☆16Updated 3 years ago
- ☆18Updated 2 years ago
- ☆16Updated 5 years ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- ☆14Updated this week
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 5 months ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A package Index for agda libraries☆12Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 5 months ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- Unofficial repository for the experimental porting of mathlib into lean4☆10Updated 3 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated last month
- Experiments in abstracting definitional interpreters☆16Updated 6 years ago
- ☆14Updated this week
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated 10 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago