The speciication and derivation of substitution for the de Bruijn representation of-terms is used to illustrate programming with a function-sequence monad. The resulting program is improved by… (More)

This paper presents a completion procedure for proving termination of term rewrite systems. It works as follows. Given a term rewrite systemR supposed to terminate and a term rewrite systemT used to… (More)

In 1972, Reynolds outlined a general method for eliminating functional arguments known as <i>defunctionalization</i>. The idea underlying defunctionalization is encoding a functional value as… (More)

The Pacific Software Research Center is developing a new method to support reuse and introduce reliability into software. The method is based on design capture in domain specific design languages and… (More)

Software application generators can eliminate many of the technical aspects of program ming for most computer users We have developed a uniform approach to the design of pro gram generators based… (More)

We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified through a top-down… (More)

Software application generators can eliminate many of the technical aspects of programming for most computer users. We have developed a uniform approach to the design of program generators, based… (More)