A formalism for treating equivalence of recursive procedures

Alex Pelin

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1985)

  • Volume: 19, Issue: 3, page 293-313
  • ISSN: 0988-3754

How to cite

top

Pelin, Alex. "A formalism for treating equivalence of recursive procedures." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.3 (1985): 293-313. <http://eudml.org/doc/92235>.

@article{Pelin1985,
author = {Pelin, Alex},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {equivalence of recursive procedures; assignment statements; branching},
language = {eng},
number = {3},
pages = {293-313},
publisher = {EDP-Sciences},
title = {A formalism for treating equivalence of recursive procedures},
url = {http://eudml.org/doc/92235},
volume = {19},
year = {1985},
}

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
PB - EDP-Sciences
VL - 19
IS - 3
SP - 293
EP - 313
LA - eng
KW - equivalence of recursive procedures; assignment statements; branching
UR - http://eudml.org/doc/92235
ER -

References

top
  1. [1] R. S. BIRD, Notes on Recursion Elimination, CACM, Vol. 20, No. 6, 1977, pp. 434-pp. 439. Zbl0358.68016MR458980
  2. [2] R. S. BIRD, Improving Programs by the Introduction of Recursion, CACM, Vol. 20, No. 11, 1977, 856-863. Zbl0361.68023MR458980
  3. [3] J. W. DE BAKKER, Recursive Procedures, Mathematical Centre Tracts 24, Amsterdam, 1971. Zbl0274.02015
  4. [4] E. HOROWITZ and S. SAHNI, Fundamentals of Computer Algorithms, Computer Science Press, 1978. Zbl0442.68022MR603626
  5. [5] Z. MANNA, Mathematical Theory of Computation, McGraw-Hill, 1974. Zbl0353.68066MR400771
  6. [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. [7] E. MENDELSON, Introduction to Mathematical Logic, D. Van Nostrand, 1964. Zbl0192.01901MR164867
  8. [8] A. PELIN, An Extended Verson of De Bakker's µ Calculus, Ph. D. Dissertation, 1977. 
  9. [9] D. SCOTT, The Lattice of Flow Diagrams, Symposium on Semantics of Algorithmic Languages, Springer Verlag, 1977. Zbl0228.68016
  10. [10] D. SCOTT, Continuons Lattices, Oxford University Computing Laboratory Technical Monograph PRG 7, 1971. 
  11. [11] D. SCOTT, Data Types as Lattices, unpublished notes, Amsterdam, 1972. 
  12. [12] M. WAND, Fixed-Point Constructions in Order-Enriched Categories, Indiana University Computer Science Department Technical Report, No. 23, 1975. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.