Form and Content in Computer Science (1970 ACM turing lecture)
Journal of the ACM (JACM)
Communications of the ACM
Hi-index | 0.00 |
An inductive proof in mathematics may often be expressed as an algorithm and a proof that the algorithm is correct. Especially when the proof proceeds by cases, a recursive pattern-matching language, such as Hewitt's MATCHLESS, is a felicitous language for writing the algorithm. We use this idea to prove a new mathematical result, which itself is of interest in computer science. We define objects called k-models. Our main theorem is a necessary and sufficient condition for a k-model to be the restriction of a k+1-model.