yiyunliu / mltt-consistencyView external linksLinks
Logical relation for predicative CC omega with booleans and an intensional identity type
☆12Apr 22, 2025Updated 9 months ago
Alternatives and similar repositories for mltt-consistency
Users that are interested in mltt-consistency are comparing it to the libraries listed below
Sorting:
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Jan 28, 2026Updated 2 weeks ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- Logical Relation for MLTT in Coq☆29Jan 14, 2026Updated last month
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Dec 13, 2018Updated 7 years ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- experiments in building tiny tracing JITs in various languages (Prolog to start)☆11Dec 11, 2025Updated 2 months ago
- Verified Extraction from Rocq to OCaml/Malfunction☆14May 23, 2025Updated 8 months ago
- A simple interpreter featuring a tracing JIT☆16Mar 28, 2011Updated 14 years ago
- Rocqet proof language☆28Aug 11, 2025Updated 6 months ago
- ☆15Aug 3, 2025Updated 6 months ago
- ☆19Nov 24, 2025Updated 2 months ago
- program synthesis with neuro-symbolic differentiable interpreters☆17Sep 17, 2025Updated 4 months ago
- ☆17Apr 4, 2024Updated last year
- Collaborative work on reversible computing☆25Oct 30, 2021Updated 4 years ago
- Relation algebra library for Coq☆50Jan 27, 2026Updated 2 weeks ago
- # A simple variable binding library based on well-scoped indices and environments☆29Oct 15, 2025Updated 4 months ago
- A new extraction system from Rocq to functional-style, memory-safe, thread-safe, readable, valid, performant, and modern C++.☆97Feb 4, 2026Updated last week
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 2 months ago
- A graduate course on formalized mathematics at the Faculty of Mathematics and Physics, University of Ljubljana, Fall semester 2024/25☆27Jan 10, 2025Updated last year
- Racket implementation of Cook and Lämmel's partial evaluation tutorial.☆32Aug 7, 2012Updated 13 years ago
- ☆28Jul 21, 2023Updated 2 years ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆31Jan 15, 2026Updated last month
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Mar 5, 2022Updated 3 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆38Sep 15, 2025Updated 5 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Sep 15, 2021Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆69Sep 17, 2024Updated last year
- A formalisation of the Calculus of Constructions☆70Jul 24, 2024Updated last year
- A monadic library for symbolic evaluation☆73Jul 16, 2025Updated 7 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Sep 15, 2023Updated 2 years ago
- Genetic program repair using GHC☆33May 16, 2024Updated last year
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 2 months ago
- FUSION is an open-source project aimed at revolutionizing networking through the simulation of advanced SD-EONs and AI-enhanced networks,…☆13Updated this week
- A verified, modern, hardened memory allocator. [maintainer=@cmovcc]