341 search results - page 6 / 69 » Redundancy elimination revisited |
CADE
2006
Springer
14 years 7 months ago
2006
Springer
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
ENTCS
2008
13 years 7 months ago
2008
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
WOSP
2010
ACM
14 years 2 months ago
2010
ACM
ANSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Programs often call the same function with the same arguments, yielding the same results. We call this phenomenon, “function reuse”. Previously, we have shown such a behavior ...
ITCC
2005
IEEE
14 years 1 months ago
2005
IEEE
These days, billions of Web pages are created with HTML or other markup languages. They only have a few uniform structures and contain various authoring styles compared to traditi...