A formalism for treating equivalence of recursive procedures
Pelin, Alex
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985), p. 293-313 / Harvested from Numdam
Publié le : 1985-01-01
@article{ITA_1985__19_3_293_0,
     author = {Pelin, Alex},
     title = {A formalism for treating equivalence of recursive procedures},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {19},
     year = {1985},
     pages = {293-313},
     mrnumber = {809761},
     zbl = {0568.68005},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1985__19_3_293_0}
}
Pelin, Alex. A formalism for treating equivalence of recursive procedures. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) pp. 293-313. http://gdmltest.u-ga.fr/item/ITA_1985__19_3_293_0/

[1] R. S. Bird, Notes on Recursion Elimination, CACM, Vol. 20, No. 6, 1977, pp. 434-pp. 439. | MR 458980 | Zbl 0358.68016

[2] R. S. Bird, Improving Programs by the Introduction of Recursion, CACM, Vol. 20, No. 11, 1977, 856-863. | MR 458980 | Zbl 0361.68023

[3] J. W. De Bakker, Recursive Procedures, Mathematical Centre Tracts 24, Amsterdam, 1971. | Zbl 0274.02015

[4] E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, 1978. | MR 603626 | Zbl 0442.68022

[5] Z. Manna, Mathematical Theory of Computation, McGraw-Hill, 1974. | MR 400771 | Zbl 0353.68066

[6] J. Mccarthy, Towards a Mathematical Science of Computation, Information Processing, Proceedings of IFIP Congress 1962, pp. 21-28, North Holland Publishing Co., Amsterdam.

[7] E. Mendelson, Introduction to Mathematical Logic, D. Van Nostrand, 1964. | MR 164867 | Zbl 0192.01901

[8] A. Pelin, An Extended Verson of De Bakker's µ Calculus, Ph. D. Dissertation, 1977.

[9] D. Scott, The Lattice of Flow Diagrams, Symposium on Semantics of Algorithmic Languages, Springer Verlag, 1977. | Zbl 0228.68016

[10] D. Scott, Continuons Lattices, Oxford University Computing Laboratory Technical Monograph PRG 7, 1971.

[11] D. Scott, Data Types as Lattices, unpublished notes, Amsterdam, 1972.

[12] M. Wand, Fixed-Point Constructions in Order-Enriched Categories, Indiana University Computer Science Department Technical Report, No. 23, 1975.