Abstract
In [3] de Bakker and Scott introduce a formal system for proving properties of recursive program schemes. This formal system, the Μ-calculus has been further studied and improved by de Bakker [2] who showed a completeness result for “regular procedures”, which correspond roughly to the Ianov schemes [9] . This completeness result is extended here to recursive schemes without identity, as introduced and studied by Ashcroft, Manna, Pnueli [I].
Cite
CITATION STYLE
Courcelle, B., & Vuillemin, J. (1974). Completude d’un systeme formel pour prouver l’equivalence de certains schemas recursifs monadiques. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 19 LNCS, pp. 234–252). Springer Verlag. https://doi.org/10.1007/3-540-06859-7_137
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
