The Need for Inner-Procedural Re nements
نویسنده
چکیده
Today one of the most widely accepted paradigms of software engineering is the Top-Down method. Based on the hypothesises that (a) Top-Down is a good way to go and (b) programmers are lazy by their very nature, I show here that with most modern imperative programming languages, we stop the Top-Down process at least one level too early. What languages need is the concept of re nements within procedures, so the Top-Down development process can continue arbitrarily deep inside each procedure. This leads to better-structured code with improved understandability. Existing languages can be extended to support the notion of inner-procedural re nements. It is described how this was done with a fast preprocessor for C and C++ and what the experiences with it are.
منابع مشابه
Higher Order Functional Logic Programming A Systematic Development
We develop an e ective model for higher order functional logic programming by re ning higher order narrowing calculi The re nements reduce the high degree of non determinism in narrowing calculi utilizing properties of functional logic programs These include convergent and left linear rewrite rules All re nements can be combined to a narrowing strategy which generalizes call by need as in funct...
متن کاملOn the equivalence of the Rietveld method and the correlated integrated intensities method in powder diffraction
The Rietveld method is the most straightforward and statistically correct approach for the re®nement of crystal structure parameters from powder diffraction data. The equivalent two-stage approach, involving the re®nement of structural parameters based on integrated intensities extracted using the Pawley method, is extremely useful in circumstances such as the global optimization methods of str...
متن کاملA Call-by-Need Strategy for Higher-Order Functional-Logic Programming
We present an approach to truely higher order functional logic programming based on higher order narrowing Roughly speaking we model a higher order functional core language by higher order rewriting and extend it by logic variables For the integration of logic programs conditional rules are supported For solving goals in this framework we present a complete calcu lus for higher order conditiona...
متن کاملRe nement - based Planning As Satis ability
It has been shown recently that planning problems are easier to solve when they are cast as model nding problems. Some schemes for automated generation of the encodings of the planning problems in propositional logic have been designed. However these schemes lack several of the re nements that traditional split & prune type planners do. We show that it is possible to transfer these re nements i...
متن کاملRelating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
We show that some natural re nements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar re nements of the polynomial-time hierarchy. This extends a result of H.-J. Burtschik and H. Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the boolean hierarchy and the plus{hierarchy.
متن کامل