ML for the working programmer
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
A Metalanguage for interactive proof in LCF
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Theorem Proving with the Real Numbers
Theorem Proving with the Real Numbers
| Hi-index | 5.23 |
The realization of inference rules as the primitive operations of a type ''theorem'' in a type-safe programming language that has so well served LCF and its descendants may, it is suggested, be of interest aside from any immediate context of theorem proving or hardware or software verification. Using the general ''conversions'' introduced by Paulson, a couple of simple programming exercises with theorem data, imitative of list processing, are presented. An example of a potentially useful notational definition in the HOL object language is given as an application.