1982 search results - page 58 / 397 » Parametricity and dependent types |
CSL
2004
Springer
15 years 3 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
ACL
2010
14 years 8 months ago
2010
A strong inductive bias is essential in unsupervised grammar induction. We explore a particular sparsity bias in dependency grammars that encourages a small number of unique depen...
CSFW
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper contrasts two existing type-based techniques for the analysis of authentication protocols. The former, proposed by Gordon and Jeffrey, uses dependent types for nonces a...
EMNLP
2007
14 years 11 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...
APAL
2005
14 years 9 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...