Fixpoint approach to the theory of computation
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the Relation between Direct and Continuation Semantics
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Implementation and applications of Scott's logic for computable functions
Proceedings of ACM conference on Proving assertions about programs
Hints on programming language design.
Hints on programming language design.
The denotational semantics of programming languages
Communications of the ACM
The assignment axiom and programming language design
ACM '76 Proceedings of the 1976 annual conference
| Hi-index | 0.02 |
A framework for validating surface properties of programming language constructs, composed of proof rules (akin to those of Hoare) and supporting hypotheses, is constructed using the mathematical semantics of Scott and Strachey. The following approach to language design is then considered: the constructs of a language should have surface properties which 1) need few hypotheses other than assumed surface properties; and 2) have proofs consisting, as far as possible, of trivial fixpoint and structural inductions.