Titlebook: Algorithimic Languages and Calculi; Richard S. Bird,Lambert Meertens Book 1997 IFIP International Federation for Information Processing 19

追踪

太空

Toward a calculus for abstract syntax trees,fects of their metaprograms. Of equal importance, metaprogramming requires an intuitive foundation that facilitates most frequent, natural manipulations of programs as data. In the past, the program transformation community has characterized well means for expressing pattern-matching and individual

MAZE

Principled strength reduction,change operation ⊕, incrementalizes . with respect to ⊕, and adopts an incrementalized loop body to form a new loop that is more efficient. Three general optimizations are performed as part of the adoption; they systematically handle initializations, termination conditions, and final return values o

Affirm

墙壁

Predicative Semantics of Loops, the observations makes the obvious weakest fixed-point semantics of iterative constructs unacceptable. This paper proposes an alternative. We will see that this alternative semantics is monotone and implementable (feasible). Finally a programming theorem for iterative constructs is proposed, proved

弯曲道理

Bedeutungsvielfalt von Augenblickenrent perspective, using a relational calculus to model both, problems and their solutions obtained from dynamic programming. This approach serves to shed new light on the different styles of dynamic programming, representing them by different search strategies of the tree-like space of partial solut

clarify

Fecal-Impaction

Alfred Bellebaum,Robert Hettlagesingle one, leading to an efficient program without intermediate data structures produced. In this paper, we report our on-going investigation on the design and implementation of an automatic transformation system HYLO which performs fusion transformation in a more systematic and more general way th

BURSA

Bedeutungsvielfalt von Augenblickens paper the PEI formalism, which enables to take into account both the geometrical and functional aspects of programs. It provides a refinement calculus mainly used to transform the geometrical characteristics of parallel programs, and we show how it may apply on data parallel programs, in particula

蚊子

https://doi.org/10.1007/978-3-642-91822-3. This is mainly due to the communication and synchronization that is necessary to manage distributed data correctly. This paper applies a methodology for the transformational derivation of parallel programs using data distribution algebras that enable an abstract description of data distribution is