The Computer Journal
The Z notation: a reference manual
The Z notation: a reference manual
Literate programming
A logical approach to discrete math
A logical approach to discrete math
ETPS: A System to Help Students Write Formal Proofs
Journal of Automated Reasoning
A history of Haskell: being lazy with class
Proceedings of the third ACM SIGPLAN conference on History of programming languages
SASyLF: an educational proof assistant for language theory
Proceedings of the 2008 international workshop on Functional and declarative programming in education
Mizar Course in Logic and Set Theory
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Hi-index | 0.00 |
Students following a first-year course based on Gries and Schneider's LADM textbook had frequently been asking: “How can I know whether my solution is good?” We now report on the development of a proof-checker designed to answer exactly that question, while intentionally not helping to find the solutions in the first place. CalcCheck provides detailed feedback to ${\rm L\kern-.36em\raise.3ex\hbox{\sc a}\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$ -formatted calculational proofs, and thus helps students to develop confidence in their own skills in “rigorous mathematical writing”. Gries and Schneider's book emphasises rigorous development of mathematical results, while striking one particular compromise between full formality and customary, more informal, mathematical practises, and thus teaches aspects of both. This is one source of several unusual requirements for a mechanised proof-checker; other interesting aspects arise from details of their notational conventions.