Formalization of the control stack

Authors:
J. A. Velazques Iturbide
Affiliations:
Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo, Boadilla del Monte
Venue:
ACM SIGPLAN Notices
Year:
1989

Citing 4
Cited 2

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Programmming languages: design and implementation (2nd ed.)

Programmming languages: design and implementation (2nd ed.)
Algorithmic specifications: a constructive specification method for abstract data types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fundamental Structures of Computer Science

Fundamental Structures of Computer Science

Dynamic semantic specification by two-level grammars for a block structured language with subroutine parameters

ACM SIGPLAN Notices
Recursion in gradual steps (is recursion really that difficult?)

Proceedings of the thirty-first SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main aim of the article is to show a simple explanation of how variables are accessed in block-structured programming languages. For such a purpose, the run-time devices generically known as control stacks are modelled as an abstract data type.