Abstract

We extend to non deterministic recursive program schemes the methods and results which permit definition of the semantics of such schemes in the deterministic case. Under natural hypothesis the set of finite and infinite trees generated by a scheme is proved to be the greatest fixed point of the functional mapping usually attached to this scheme.

Full Text
Published version (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