Showing papers on "Orthogonality (programming) published in 1995"

LSE narrowing for decreasing conditional term rewrite systems

Abstract: LSE narrowing is known as an optimal narrowing strategy for arbitrary unconditional canonical term rewrite systems without additional properties such as orthogonality or constructor discipline. In this paper, we extend LSE narrowing to confluent and decreasing conditional term rewrite systems.

Benchmark Orthogonality Properties

Abstract: define a manager’s benchmark as a passive representation of the manager’s investment process. The benchmark W possesses the prominent investment characteristics that a manager’s portfolio would display in the absence of active management. Hence, the benchmark is a reflection of the manager’s investment style.’ The evaluation of an investment manager’s performance proceeds from the implicit assumption that the manager’s returns are to be compared against a valid benchmark. That is, (knowledgeable) performance evaluators insist that an unambiguous, investable, relevant benchmark, specified in advance of the evaluation period, be available for analysis. Many plan sponsors, their consultants, and their managers who are under review, though, spend little time ascertaining the appropriateness of the benchmarks used in the evaluation of the managers’ investment results. We find this lack of attentiveness to be a serious mistake. In this article, we d~scuss certain fundamental properties of valid benchmarks and their implications for manager performance evaluation.

Rapid prototyping of signal processors in an educational environment

Abstract: A programmable control-path allows designers to build and evaluate many different instruction sets in a short period of time. For this approach to be practical, the effort and time needed to modify the control-path to reflect the changes in the instruction set must be minimized. We describe a flexible and efficient method for generating control logic information given an instruction set. All the information regarding the instruction set, namely, the mnemonics, the opcodes and the values of the control lines for the data path, are stored in a single file. This information is used by the assembler to assemble programs as well as to generate control-path programming information, which in turn is used to set up the new control-path. A way of searching the design space to iteratively modify an instruction set is also presented. Using this method we have successfully built a prototype of the Micro Grain Array Processor. We were able to submit the board for fabrication before finalizing an instruction set hence overlapping the design phase of the control-path with the board fabrication.