uds-psl / autosubst-ocamlView external linksLinks
☆19Nov 24, 2025Updated 2 months ago
Alternatives and similar repositories for autosubst-ocaml
Users that are interested in autosubst-ocaml are comparing it to the libraries listed below
Sorting:
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37Feb 9, 2026Updated last week
- Logical Relation for MLTT in Coq☆29Jan 14, 2026Updated last month
- Building A Correct-By-Construction Proof Checkers For Type Theories☆31Jan 15, 2026Updated last month
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 2 months ago
- ☆23Sep 22, 2021Updated 4 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Feb 5, 2026Updated last week
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- ☆17Apr 4, 2024Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆38Sep 15, 2025Updated 5 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆69Sep 17, 2024Updated last year
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆21May 22, 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
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated last month
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Deadlock freedom by type checking☆20Jun 2, 2023Updated 2 years ago
- A toy dependent typed language.☆36Feb 9, 2026Updated last week
- Mechanizations of Type Theories☆33Jan 15, 2026Updated last month
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- quotient types in cubical Agda☆24Feb 4, 2019Updated 7 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 2 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Mar 11, 2021Updated 4 years ago
- A Teeny Type Theory☆27Jun 4, 2022Updated 3 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 5 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆21Jan 3, 2025Updated last year
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A cost-aware logical framework, embedded in Agda.☆75Nov 7, 2025Updated 3 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Bedrock Bit Vector Library☆28Oct 28, 2025Updated 3 months ago
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- Setoid type theory implementation☆38Aug 24, 2023Updated 2 years ago
- ☆12Mar 13, 2025Updated 11 months ago
- A server for the forester tool☆17Dec 10, 2024Updated last year
- A formalisation of the Calculus of Constructions☆70Jul 24, 2024Updated last year