1999 search results - page 78 / 400 » Dependently Typed Grammars |
126
click to vote
EMNLP
2007
15 years 7 months ago
2007
We present a comparative error analysis of the two dominant approaches in datadriven dependency parsing: global, exhaustive, graph-based models, and local, greedy, transition-base...
142
click to vote
APAL
2005
15 years 6 months ago
2005
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...
121
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...
154
click to vote
ECOOP
2004
Springer
15 years 11 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...
163
click to vote
MSCS
2008
15 years 6 months ago
2008
Subtyping for inductive types in dependent type theories is studied in the framework of coercive subtyping. General structural subtyping rules for parameterised inductive types ar...