The C programming language
Proving Theorems about LISP Functions
Journal of the ACM (JACM)
Assignment and Procedure Call Proof Rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
List processing in real time on a serial computer
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Revised report on the algorithm language ALGOL 60
Communications of the ACM
Unrestricted procedure calls in Hoare's logic
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Discipline of Programming
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
PASCAL user manual and report
A constructive alternative to axiomatic data type definitions
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Real Time Queue Operations in Pure LISP
Real Time Queue Operations in Pure LISP
LISP 1.5 Programmer's Manual
Efficient abstractions for the implementation of structured editors
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
| Hi-index | 0.00 |
This paper introduces the path, a new programming language construct designed to supplant the use of pointers to access and destructively update recursive data structures. In contrast to the complex semantics and proof rules for pointers, the semantics and proof rules for paths are simple and abstract. In fact, they are easily formalized within a first-order theory of recursive data objects analogous to first-order number theory. We present a number of sample programs, including implementations of queues and binary trees, utilizing the new construct and prove that they are correct.