Bottom-up computation of recursive programs-Reference-Cited by-同舟云学术

Bottom-up computation of recursive programs

Published:1976 Issue:R1 Volume:10 Page:47-82
ISSN:0397-9326
Container-title:Revue française d'automatique informatique recherche opérationnelle. Informatique théorique
language:
Short-container-title:R.A.I.R.O. Informatique théorique

Author:

Berry G.

Publisher

EDP Sciences

Link

http://www.rairo-ita.org/10.1051/ita/197610R100471/pdf

Reference15 articles.

1. 1. BERRY G., Calculs ascendants des programmes récursifs. Thèse de 3e cycle, Université Paris VII, 1976.

2. 2. BURSTALL R.. Proving Properties of Programs by Structural Induction. Computer Journal, vol. 12, 1969, p. 41-48.0164.46202

3. 3. COOK S. and SETHI R.. Storage Requirements for Deterministic Polynomial Time Recognizible Languages. Proc. 6th annual symposium on theory of Computing, Seattle, Washington, 1974, p. 33-39.4211610412.68078

4. 4. LUCKHAM D., PARK D. and PATERSON M.. On Formalised Computer Programs. Journal of Computer and System Sciences, vol. 4, No. 3, 1970, p. 220-250.2757170209.18704

5. 5. MANNA Z.. Mathematical theory of Computation. McGraw-Hill, (Computer science series), 1975.4007710353.68066

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Semantics and Syntax, Between Computer Science and Mathematics;The French School of Programming;2023-10-11

2. Classical realizability as a classifier for nondeterminism;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

3. Extensional and Intensional Semantic Universes;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

4. Default rules for Curry;Theory and Practice of Logic Programming;2016-07-01

5. Continuity in Semantic Theories of Programming;History and Philosophy of Logic;2015-07