Showing papers by "Lawrence C. Paulson published in 1983"

TL;DR: LCF is an interactive theorem-prover intended for reasoning about computation that provides a family of rewriting functions, and operators to combine them, and its implementation of rewriting is presented in detail.