1679 search results - page 71 / 336 » Strong order equivalence |
ICCAD
1995
IEEE
14 years 1 months ago
1995
IEEE
This paper presents a linear time algorithm to reduce a large RC interconnect network into subnetworks which are approximated with lower order equivalent RC circuits. The number o...
JACM
2007
13 years 10 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
ICFP
2008
ACM
14 years 10 months ago
2008
ACM
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
CONCUR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
ORDER
2002
13 years 9 months ago
2002
For a given class T of compact Hausdorff spaces, let Y(T ) denote the class of -groups G such that for each g G, the Yosida space Y (g) of g belongs to T . Conversely, if R is a c...