Recursive Programs as Definitions in First Order Logic

@article{Cartwright1984RecursivePA,
  title={Recursive Programs as Definitions in First Order Logic},
  author={Robert Cartwright},
  journal={SIAM J. Comput.},
  year={1984},
  volume={13},
  pages={374-408}
}
Despite the reputed limitations of first order logic, it is easy to state and prove almost all interesting properties of recursive programs within a simple first order theory, by using an approach we call "first order programming logic". Unlike higher order logics based on fixed-point induction, first order programming logic is founded on deductive principles that are familiar to most programmers. Informal structural induction arguments (such as termination proofs for LISP append, McCarthy's 91… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS