A theory of discrete patterns and their implementation in SNOBOL4
Communications of the ACM
Definitional interpreters for higher-order programming languages
ACM '72 Proceedings of the ACM annual conference - Volume 2
The Structure of SNOBOL4
The SNOBOL 4 programming language
The SNOBOL 4 programming language
The macro implementation of SNOBOL4;: A case study of machine-independent software development
The macro implementation of SNOBOL4;: A case study of machine-independent software development
Denotational semantics of a goal-directed language
ACM Transactions on Programming Languages and Systems (TOPLAS)
A case study in specifying the semantics of a programming language
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A case study in specifying the semantics of a programming language
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Induction, Domains, Calculi: Strachey's Contributions to Programming-Language Engineering
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
String analysis and synthesis in SL5
ACM '76 Proceedings of the 1976 annual conference
A history of the SNOBOL programming languages
ACM SIGPLAN Notices - Special issue: History of programming languages conference
A history of the SNOBOL programming languages
History of programming languages I
Implementing SNOBOL4 pattern matching in Icon
Computer Languages
Recent developments in the theory of data structures
Computer Languages
| Hi-index | 0.00 |
This paper analyzes the semantics of the programming language SNOBOL4, following the mathematical approach proposed by D. Scott and C. Strachey. The study aims at clarifying a rather unusual semantic structure, and at demonstrating that the mathematical approach can provide a natural and usable formal specification of a practical programming language.