The promotion and accumulation strategies in transformational programming

DOI10.1145/1780.1781zbMath0542.68006OpenAlexW1993075518MaRDI QIDQ3330483

Richard S. Bird

Publication date: 1984

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1780.1781

zbMATH Keywords

verificationtransformationsalgorithm refinementapplicative languagesaccumulationinfix operators

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (12)

Derivation of efficient programs for computing sequences of actions ⋮ Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study ⋮ Deaccumulation techniques for improving provability ⋮ An efficient algorithm of logic programming with constraint hierarchy ⋮ Une charpente de semi-unification ⋮ Unnamed Item ⋮ A new approach to recursion removal ⋮ Higher-order matching for program transformation ⋮ Representing proof transformations for program optimization ⋮ Program development schemata as derived rules ⋮ PROLOG'S CONTROL CONSTRUCTS IN A FUNCTIONAL SETTING — AXIOMS AND IMPLEMENTATION ⋮ A linear time solution to the single function coarsest partition problem

Uses Software

• LCF

This page was built for publication: The promotion and accumulation strategies in transformational programming