Repository for the course Logical Verification 2019–2020 at VU Amsterdam
☆13Dec 16, 2019Updated 6 years ago
Alternatives and similar repositories for logical_verification_2019
Users that are interested in logical_verification_2019 are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆25May 23, 2022Updated 3 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆15Oct 15, 2018Updated 7 years ago
- A controlled natural language for calculus of inductive constructions, based on Forthel.☆14Mar 2, 2021Updated 5 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- The implementation of an SMTLib dialect for xDSL☆17Mar 16, 2026Updated last week
- A Lean implementation of Interaction Trees☆14Jan 13, 2025Updated last year
- A Coq tactic for proving multivariate inequalities using SDP solvers☆12Feb 3, 2026Updated last month
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- ☆16Dec 9, 2020Updated 5 years ago
- Coq library for handling names☆19Aug 5, 2022Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- polygon-issue-tracking☆16Jul 14, 2013Updated 12 years ago
- Formalization of Linear Logic in Coq☆18Apr 7, 2025Updated 11 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- sorear's Metamath system engine - version 3 Rust☆25May 31, 2023Updated 2 years ago
- Ask for solutions.☆19Aug 5, 2019Updated 6 years ago
- Selective applicative functors laws and theorems☆15Mar 12, 2020Updated 6 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆21Mar 19, 2015Updated 11 years ago
- Type theory in type theory☆16Feb 26, 2012Updated 14 years ago
- ☆31Sep 9, 2014Updated 11 years ago
- ☆37May 31, 2023Updated 2 years ago
- Generalized Convolution and Efficient Language Recognition☆18Jul 20, 2019Updated 6 years ago
- Formalized quantum computing in Lean theorem prover☆34Mar 6, 2021Updated 5 years ago
- NordVPN Special Discount Offer • AdSave on top-rated NordVPN 1 or 2-year plans with secure browsing, privacy protection, and support for for all major platforms.
- Artifact of the ICSE 2020 paper: "ReluDiff: Differential Verification of Deep Neural Networks"☆11Feb 1, 2022Updated 4 years ago
- A LALR(1) OpenQASM Parser and AST Generator.☆13Jul 29, 2024Updated last year
- ☆14May 28, 2025Updated 9 months ago
- Code from PLDI '21 paper "Provable Repair of Deep Neural Networks."☆10Nov 26, 2022Updated 3 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆71Apr 23, 2021Updated 4 years ago
- CaDiCaL + neural glue variable predictions☆10Oct 21, 2020Updated 5 years ago
- Collaborative work on reversible computing☆25Oct 30, 2021Updated 4 years ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2018☆23May 9, 2018Updated 7 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- parser/viewer for olean files (lean 3)☆13May 8, 2019Updated 6 years ago
- Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing☆27Jan 21, 2025Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Aug 21, 2025Updated 7 months ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Mar 16, 2026Updated last week
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Dec 22, 2018Updated 7 years ago
- An efficient, lazy suffix tree implementation☆13Dec 10, 2020Updated 5 years ago
- Certified Machine Learning☆41Mar 10, 2021Updated 5 years ago