MFCS
2010
Springer
13 years 10 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
TOG
2008
13 years 11 months ago
2008
Modeling the large space of possible human motions requires scalable techniques. Generalizing from example motions or example controllers is one way to provide the required scalab...
SIAMDM
2008
13 years 11 months ago
2008
In [5], Reed conjectures that every graph satisfies ++1 2 . We prove this holds for graphs with disconnected complement. Combining this fact with a result of Molloy proves the co...
AIML
1998
14 years 27 days ago
1998
Generalizing an example from (Fine 1975) and inspired by a theorem in (J
RTA
1987
Springer
14 years 3 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
COMPGEOM
1999
ACM
14 years 3 months ago
1999
ACM
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...