ACM Home Page
Please provide us with feedback. Feedback
Block structure (Extended Abstract): Retention or deletion?
Full text PdfPdf (1.29 MB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the third annual ACM symposium on Theory of computing table of contents
Shaker Heights, Ohio, United States
Pages: 86 - 100  
Year of Publication: 1971
Author
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800157.805041
What is a DOI?

ABSTRACT

The question as to the correct block exit strategy, retention or deletion, is resolved by formally comparing the contour model and the stack model, each of which implements one of the strategies, to the copy rule, a formal definition of block structuring.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
PASODSIPL is Proceedings of ACM Symposium on Data Structures in Programming Languages, 1971.
2
 
3
Bergeron, R.D., Gannon, J.D., Tompa, F.W., Shecter, D.F., and van Dam, A., "Systems programming languages", Advances in Computers 11 (1971).
4
 
5
 
6
Dijkstra, E.W., "Recursive programming", in Programming systems and languages, S. Rosen, McGraw-Hill, N.Y., 1967.
 
7
Henhapl, W., and Jones, C.B., The block concept and some possible implementations, with proofs of equivalence, IBM Laboratory Vienna, Tech. Rep. TR 25.104 (1970).
8
 
9
Landin, P., "The mechanical evaluation of expressions", Computer Journal 6:4 (1964).
10
 
11
Lauer, P., Formal definition of Algol 60, IBM Laboratory Vienna, Tech. Rep. TR 25.088 (1968).
 
12
Lucas, P., Two constructive realizations of the block concept and their equivalence, IBM Laboratory Vienna, Tech. Rep. TR 25.085 (1968).
 
13
Lucas, P., et al., Method and notation for the formal definition of programming languages, IBM Laboratory Vienna, Tech. Rep. TR 25.087 (1968).
 
14
Lucas, P., and Walk, K., "On the formal description of PL/1", Annual Review in Automatic Programming 6:3, 105 (1969).
15
 
16
McGowan, C., "An inductive proof technique for interpreter correctness", Courant Institute Symposium on Formal Semantics of Programming Languages (1970).
 
17
18
19
20
 
21
 
22
Rubin, G., A contour model lambda calculus machine, TR 70-35, Center for Computer and Information Science, Brown University (Feb. 1971).
 
23
van Wijngaarden, A., et al., "Report on the algorithmic language Algol 68", Num. Math. 14, 79-218 (1969).
 
24
 
25
Wegner, P., "Three computer cultures: computer technology, computer mathematics and computer science", Advances in Computers 10 (1970).
 
26
Wegner, P., "Information structure models for programming languages", Courant Institute Symposium on Formal Semantics of Programming Languages, 1970.
 
27
Wegner, P., The Vienna Definition Language, TR 70-21-2, Center for Computer and Information Science, Brown University (1970).
 
28
Lucas, P., lecture on Proofs of correctness of various block structure implementations, given at Brown University, spring 1970.

CITED BY  13