Laws of programming 论文
1987Communications of the ACM引用 389
Logic, programming, and type systemsFormal Methods in VerificationLogic, Reasoning, and Knowledge
详细信息
- 发表期刊/会议
- Communications of the ACM
- 发表日期
- 1987-08-01
- 发表年份
- 1987
关键词
Logic, programming, and type systemsFormal Methods in VerificationLogic, Reasoning, and Knowledge
摘要
A complete set of algebraic laws is given for Dijkstra's nondeterministic sequential programming language. Iteration and recursion are explained in terms of Scott's domain theory as fixed points of continuous functionals. A calculus analogous to weakest preconditions is suggested as an aid to deriving programs from their specifications.