5900 search results - page 105 / 1180 » Dependable Systems |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
COLING
2010
13 years 5 months ago
2010
We compare the performance of three statistical parsing architectures on the problem of deriving typed dependency structures for French. The architectures are based on PCFGs with ...
CADE
2007
Springer
14 years 10 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
LOPSTR
2009
Springer
14 years 4 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
PPDP
2009
Springer
14 years 4 months ago
2009
Springer
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...