ollef / system-f-omega-agdaLinks
A formalization of System Fω in Agda
☆19Updated 6 months ago
Alternatives and similar repositories for system-f-omega-agda
Users that are interested in system-f-omega-agda are comparing it to the libraries listed below
Sorting:
- ☆17Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- My Agda blog/lab/playground☆13Updated last month
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- Organize mathematical thoughts☆20Updated last year
- Anders: Cubical Type Checker☆23Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- 🩺 A library for compiler diagnostics☆47Updated 3 weeks ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 11 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 3 weeks ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- ☆36Updated 3 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
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 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
- A type theory with native support for Polynomial Functors.☆39Updated last year
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago