1679 search results - page 16 / 336 » Strong order equivalence |
SIAMSC
2008
13 years 8 months ago
2008
Strong stability-preserving (SSP) Runge
TCS
2008
13 years 8 months ago
2008
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
DM
2007
13 years 8 months ago
2007
For a tree T and an integer k ≥ 1, it is well known that the k-th power T k of T is strongly chordal and hence has a strong elimination ordering of its vertices. In this note we...