LS-Lab / Coq-dLLinks
A formally verified implementation of differential dynamic logic in Coq
☆18Updated 3 years ago
Alternatives and similar repositories for Coq-dL
Users that are interested in Coq-dL are comparing it to the libraries listed below
Sorting:
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 years ago
- Algebraic Combinatorics in Coq☆39Updated last week
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Meta-programming utilities for Agda.☆20Updated 2 months ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A proof of Abel-Ruffini theorem.☆30Updated 3 months ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 9 months ago
- An equational theorem prover based on Knuth-Bendix completion☆56Updated last week
- A Lean 4 formalization of partial combinatory algebras.☆14Updated 9 months ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆72Updated last week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆17Updated 3 months ago
- Relation algebra library for Coq☆49Updated last month
- ☆15Updated last year
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Certified Machine Learning☆41Updated 4 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated 2 weeks ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A Probability Theory Library for the Coq Theorem Prover☆54Updated 2 years ago
- A graduate course on formalized mathematics at the Faculty of Mathematics and Physics, University of Ljubljana, Fall semester 2024/25☆27Updated 9 months ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago