rahulc29 / realizabilityLinks
Experiments with Realizability in Univalent Type Theory
☆18Updated 9 months ago
Alternatives and similar repositories for realizability
Users that are interested in realizability are comparing it to the libraries listed below
Sorting:
- ☆15Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 7 months ago
- antifunext☆34Updated last year
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Agda to C compiler☆10Updated 2 years ago
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Updated last month
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- ☆17Updated 3 years ago
- Mechanizations of Type Theories☆31Updated 3 weeks ago
- ☆11Updated 5 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- my phd thesis☆26Updated 11 months ago
- ☆14Updated last year
- ☆21Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- ☆13Updated 4 months ago
- Revised Omega-categorical Typechecker☆27Updated 9 months ago
- Extensions to cubical for categorical logic/type theory☆30Updated this week
- ☆16Updated last week
- Topos theory in Lean 4☆15Updated 5 months ago
- 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
- Building A Correct-By-Construction Proof Checkers For Type Theories☆21Updated last week
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 3 months ago
- Organize mathematical thoughts☆20Updated last year
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- ☆21Updated 3 years ago