Formal computations of non deterministic recursive program schemes |
| |
| Authors: | André Arnold Maurice Nivat |
| |
| Affiliation: | 1. Université de Lille I, France
2. Laboratoire d'Informatique Théorique et Programmation, Université Paris VII, France
|
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
