@article{ITA_1985__19_3_293_0, author = {Pelin, Alex}, title = {A formalism for treating equivalence of recursive procedures}, journal = {RAIRO. Informatique th\'eorique}, pages = {293--313}, publisher = {EDP-Sciences}, volume = {19}, number = {3}, year = {1985}, mrnumber = {809761}, zbl = {0568.68005}, language = {en}, url = {http://archive.numdam.org/item/ITA_1985__19_3_293_0/} }
Pelin, Alex. A formalism for treating equivalence of recursive procedures. RAIRO. Informatique théorique, Tome 19 (1985) no. 3, pp. 293-313. http://archive.numdam.org/item/ITA_1985__19_3_293_0/
[1] Notes on Recursion Elimination, CACM, Vol. 20, No. 6, 1977, pp. 434-pp. 439. | MR | Zbl
,[2] Improving Programs by the Introduction of Recursion, CACM, Vol. 20, No. 11, 1977, 856-863. | MR | Zbl
,[3] Recursive Procedures, Mathematical Centre Tracts 24, Amsterdam, 1971. | Zbl
,[4] Fundamentals of Computer Algorithms, Computer Science Press, 1978. | MR | Zbl
and ,[5] Mathematical Theory of Computation, McGraw-Hill, 1974. | MR | Zbl
,[6] Towards a Mathematical Science of Computation, Information Processing, Proceedings of IFIP Congress 1962, pp. 21-28, North Holland Publishing Co., Amsterdam.
,[7] Introduction to Mathematical Logic, D. Van Nostrand, 1964. | MR | Zbl
,[8] An Extended Verson of De Bakker's µ Calculus, Ph. D. Dissertation, 1977.
,[9] The Lattice of Flow Diagrams, Symposium on Semantics of Algorithmic Languages, Springer Verlag, 1977. | Zbl
,[10] Continuons Lattices, Oxford University Computing Laboratory Technical Monograph PRG 7, 1971.
,[11] Data Types as Lattices, unpublished notes, Amsterdam, 1972.
,[12] Fixed-Point Constructions in Order-Enriched Categories, Indiana University Computer Science Department Technical Report, No. 23, 1975.
,