Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
From MaRDI portal
Publication:3914400
DOI10.1145/357062.357064zbMath0463.68014OpenAlexW2040073555MaRDI QIDQ3914400
Jacob T. Schwartz, Ssu-Cheng Liu, Arthur Grand, Edmond Schonberg, Robert B. K. Dewar
Publication date: 1979
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357062.357064
optimizationstepwise refinementhigh level languagesautomatic data structure choiceset-theoretic languages
Related Items (4)
Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study ⋮ Deciding Boolean algebra with Presburger arithmetic ⋮ Sets with Cardinality Constraints in Satisfiability Modulo Theories ⋮ Transformational derivation of an improved alias analysis algorithm
This page was built for publication: Programming by Refinement, as Exemplified by the SETL Representation Sublanguage
