A property which guarantees termination in weak combinatory logic and subtree replacement systems.
Pettorossi, Alberto
Notre Dame J. Formal Logic, Tome 22 (1981) no. 1, p. 344-356 / Harvested from Project Euclid
Publié le : 1981-10-14
Classification:  03B40,  68C01
@article{1093883514,
     author = {Pettorossi, Alberto},
     title = {A property which guarantees termination in weak combinatory logic and subtree replacement systems.},
     journal = {Notre Dame J. Formal Logic},
     volume = {22},
     number = {1},
     year = {1981},
     pages = { 344-356},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1093883514}
}
Pettorossi, Alberto. A property which guarantees termination in weak combinatory logic and subtree replacement systems.. Notre Dame J. Formal Logic, Tome 22 (1981) no. 1, pp.  344-356. http://gdmltest.u-ga.fr/item/1093883514/