677 search results - page 11 / 136 » Dependent Types from Counterexamples |
AAECC
2007
Springer
14 years 9 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
ALIFE
2004
14 years 9 months ago
2004
We study the emergence and dynamics of competing strains of digital organisms in a world with two depletable resources. Consumption of one resource produces the other resource as a...
COLING
2010
14 years 4 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 ...
ECOOP
2004
Springer
15 years 3 months ago
2004
Springer
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
TACAS
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...