-
As more and more things get failable or fault-tolerant variants (I'm not even going to *try* to list them all), and as Rust finds its way into more stability-critical systems where any form of abortin…
-
Course code, if applicable:
University hosting the course: University of Beira Interior
Contact person: Simao Melo de Sousa (desousa@di.ubi.pt)
Concepts taught: Deductive Program Verification, proo…
-
Course code, if applicable:
University hosting the course: Université de Rennes 1
Contact person: Thomas Genet, genet@irisa.fr
Concepts taught: Applied Formal Methods,Data Structures,Deductive Sof…
-
The ability to run Coq and MetaCoq, powerful proof systems, inside a large language model (LLM) like me is indeed significant. This opens up a range of exciting possibilities, some of which include:
…
-
The esolangs are getting a bit out of hand. I think there should be some requirements for languages to be added. Has an interpreter/compiler (not hypothetical)? Turing complete?
-
as per
https://leanprover.github.io/theorem_proving_in_lean/ — a software to model maths problems
Seen via [The Mathematical Library of the Future](https://www.youtube.com/watch?v=HL7DEkXV_6…
-
# 9. Getting started: basic Isabelle/jEdit tricks
[https://lawrencecpaulson.github.io/2022/05/11/jEdit-tricks.html](https://lawrencecpaulson.github.io/2022/05/11/jEdit-tricks.html)
-
Many Coq-community members regularly do advocacy for Coq itself, for Coq-community, type theory, machine-checked proofs, Coq libraries, Coq-verified software, and so on. It helps to have guidelines ab…
-
To verify extraction to OCaml, one needs a semantics of OCaml in Coq (which may or may not be verified itself in some way). This is an attempt to document relevant resources to make this happen.
On…
-
As discussed on #828, we need to come up with a general policy for what kinds of tactics may be included and used in UniMath, and in what situations.
I'll show my hand early: I generally support t…