Learn More
Orthogonal term rewriting systems (also known as regular systems) provide an elegant framework for programming in equational logic. O'Donnell showed that the parallel-outermost strategy, which replaces all outermost redexes in each step, is complete for such systems. Many of the reductions performed by this strategy could be wasteful in general. A lazy(More)
Pattern matching is an important operation used in many applications such as functional programming, rewriting and rule-based expert systems. By preprocessing the patterns into a DFA-like automaton, we can rapidly select the matching pattern(s) in a single scan of the relevant portions of the input term. This automaton is typically based on left-to-right(More)
This paper summarizes the spectrum of options that can be employed during the initial design and construction of pulverized coal (PC), and integrated gasification and combined cycle (IGCC) plants to reduce the capital costs and energy losses associated with retrofitting for CO2 capture at some later time in the future. It also estimates lifetime (40 year)(More)
Unnecessary backtracking is a principal source of ineeciency in Prolog execution. In order to avoid the overhead of the general backtracking mechanism, determinate programs should be executed deterministically. Achieving this requires an automatic means of extracting de-terminacy. We present a method in which determinacy is inferred from the success(More)
interpretations.) Using the ABS projection, Hughes and Wadler are able to capture a notion of head-strictness (denoted H in their work) that captures the notion that “whenever a cons cell is evaluated, its head needs to be evaluated fully, and moreover, the tail of the cons cell is again in a H-context.” In contrast, our notion of head-strictness coincides(More)
Abstract Interpretation of logic programs using symbolic constraints has attracted a lot of attention lately since such approaches can yield very elegant formulation of manY analyses. Moreover, the performance of an analysis that uses constraints to represent program properties and symbolic constraint solving techniques to infer them, can be largely(More)