Correct Computation Rules for Recursive Languages
- 1 September 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (3) , 378-401
- https://doi.org/10.1137/0205031
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Program equivalence and context-free grammarsJournal of Computer and System Sciences, 1975
- Bases for chain-complete posetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974
- Inductive methods for proving properties of programsCommunications of the ACM, 1973
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973
- On Classes of Program SchemataSIAM Journal on Computing, 1972
- “Pānini-Backus Form” suggestedCommunications of the ACM, 1967
- Revised report on the algorithmic language ALGOL 60Communications of the ACM, 1963
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955