English

Students' Proof Assistant (SPA)

Logic in Computer Science 2019-04-02 v1

Abstract

The Students' Proof Assistant (SPA) aims to both teach how to use a proof assistant like Isabelle and also to teach how reliable proof assistants are built. Technically it is a miniature proof assistant inside the Isabelle proof assistant. In addition we conjecture that a good way to teach structured proving is with a concrete prover where the connection between semantics, proof system, and prover is clear. The proofs in Lamport's TLAPS proof assistant have a very similar structure to those in the declarative prover SPA. To illustrate this we compare a proof of Pelletier's problem 43 in TLAPS, Isabelle/Isar and SPA. We also consider Pelletier's problem 34, also known as Andrews's Challenge, where students are encouraged to develop their own justification function and thus obtain a lot of insight into the proof assistant. Although SPA is fully functional we have so far only used it in a few educational scenarios.

Cite

@article{arxiv.1904.00617,
  title  = {Students' Proof Assistant (SPA)},
  author = {Anders Schlichtkrull and Jørgen Villadsen and Andreas Halkjær From},
  journal= {arXiv preprint arXiv:1904.00617},
  year   = {2019}
}

Comments

In Proceedings ThEdu'18, arXiv:1903.12402

R2 v1 2026-06-23T08:24:53.218Z