Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
☆37Feb 20, 2026Updated 2 weeks ago
Alternatives and similar repositories for dot-iris
Users that are interested in dot-iris are comparing it to the libraries listed below
Sorting:
- ☆19Nov 24, 2025Updated 3 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆31Jan 15, 2026Updated last month
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- Lenses in Coq☆17Oct 7, 2022Updated 3 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- Adding extensions to DOT calculus☆24Jan 19, 2020Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 10 months ago
- A fornalisation of Grobner basis in ssreflect☆12Jan 29, 2026Updated last month
- Formalization of the Dependent Object Types (DOT) calculus☆66Aug 30, 2022Updated 3 years ago
- A Coq plugin that implements exceptions in Coq☆13Jan 7, 2021Updated 5 years ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Updated this week
- 👹 A library for hierarchical names and lexical scoping☆26Nov 21, 2025Updated 3 months ago
- Setoid type theory implementation☆38Aug 24, 2023Updated 2 years ago
- SLAYER ported to Racket☆21Jun 15, 2019Updated 6 years ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Aug 11, 2025Updated 6 months ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆38Updated this week
- Typing the linear pi calculus in Agda☆29Mar 15, 2022Updated 3 years ago
- A Coq library providing tactics to deal with hypothesis☆23Dec 5, 2025Updated 3 months ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 7 months ago
- All the code I've ever written in Ltac2☆11Jan 19, 2021Updated 5 years ago
- Client library for Maelstrom and solutions to the Fly.io distributed systems challenges - gossip glomers☆14Feb 26, 2023Updated 3 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 3 months ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Bedrock Bit Vector Library☆29Oct 28, 2025Updated 4 months ago
- Mechanizations of Type Theories☆35Jan 15, 2026Updated last month
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- A simple term-rewriting interpreter that displays intermediate expressions.☆14Jun 2, 2025Updated 9 months ago