L. Paulson, Recent developments in LCF: examples of structural induction, Report No. 34, Computer Laboratory, University of Cambridge (1983).  Home/Search   Document Not in Database   Summary   Related Articles

....presents a family of rewriting primitives, and operators to combine them. It proceeds in stages, from pattern matching primitives, to instantiation functions, term and formula rewriting functions, tautology solvers, finally discussing the rewriting theorem prover that is provided in the LCF system [ paulson83a]. The functions at each stage are constructed from those of the previous stage by functional operators that express simple computational intuitions such as sequencing, alternation, and repetition. Most function definitions are brief and directly express the design decisions such as traversal ....

....th) th; Calling MATCH MP x . A = B A , where A is an instance of A, returns the corresponding instance of B. By convention, let us write this instance B . The composite function (fst o dest imp) takes the first part of an implication, which is the antecedent. One of my proofs [ paulson83a ] involves a total function VARS OF and a theory of strict lists. The function MAP, which maps any function f over a list, produces a total function if f is total. The rule MATCH MP can prove that the function (MAP VARS OF) is total. First we load, from theory files, two theorems about totality. ....

[Article contains additional citation context not shown here]

L. Paulson, Recent developments in LCF: examples of structural induction, Report No. 34, Computer Laboratory, University of Cambridge (1983).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC