ollef / system-f-omega-agdaLinks
A formalization of System Fω in Agda
☆20Updated last month
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 library for compiler diagnostics☆52Updated 2 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- Work in progress on semi-simplicial types☆23Updated 3 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- My Agda blog/lab/playground☆12Updated 3 weeks ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 2 months ago
- A formalization of the theory behind the mugen library☆19Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated 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 4 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 2 years ago
- A simple λProlog interpreter☆20Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 9 months ago
- # A simple variable binding library based on well-scoped indices and environments☆29Updated 3 months ago
- ☆38Updated 4 years ago
- Interactive holes for Lean 4☆22Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago