Abstract
We investigate the possibilities of automating equivalence proofs for recursiveschemas. A formal proof system, adapted from work of J. W. deBakker and D. Scott, is shown to be complete with respect to provability of equivalence of pure recursive schemes. The result is obtained by showing the correspondence between operational and denotational semantics of a simple recursive language.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
