Geodesic
A formalism for treating equivalence of recursive procedures
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) no. 3, pp. 293-313.

Voir la notice de l'article provenant de la source Numdam

@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},
     pages = {293--313},
     publisher = {EDP-Sciences},
     volume = {19},
     number = {3},
     year = {1985},
     mrnumber = {809761},
     zbl = {0568.68005},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1985__19_3_293_0/}
}
TY  - JOUR
AU  - Pelin, Alex
TI  - A formalism for treating equivalence of recursive procedures
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1985
SP  - 293
EP  - 313
VL  - 19
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1985__19_3_293_0/
LA  - en
ID  - ITA_1985__19_3_293_0
ER  - 
%0 Journal Article
%A Pelin, Alex
%T A formalism for treating equivalence of recursive procedures
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1985
%P 293-313
%V 19
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1985__19_3_293_0/
%G en
%F 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) no. 3, pp. 293-313. http://geodesic.mathdoc.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. | Zbl | MR

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

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

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

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

[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. | Zbl | MR

[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

[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.