Abstract
We use the fixpoint approach to formalize the correctness of recursive definitions within the framework of first-order predicate calculus. Although the least fixpoint semantics is used, our results suggest some general methods of proving the correctness of recursive definitions without knowing their least fixpoints explicitly.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer & Information Sciences
Paper Title
Journal
Date
