Sciweavers

1999 search results - page 65 / 400
» Dependently Typed Grammars
Sort
View
LACL
2005
Springer
15 years 11 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
SAC
2009
ACM
16 years 28 days ago
Static type inference for Ruby
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...
ACL
2009
15 years 4 months ago
K-Best A* Parsing
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
Adam Pauls, Dan Klein
BTW
2003
Springer
129views Database» more  BTW 2003»
15 years 11 months ago
Type Checking in XOBE
: XML is the upcoming standard for internet data. Java is the most important programming language for internet applications. Nevertheless, in today’s languages and tools there is...
Martin Kempa, Volker Linnemann
ENGL
2008
61views more  ENGL 2008»
15 years 6 months ago
Retail Inventory Management with Purchase Dependencies
`Purchase dependency' refers to the dependency of purchase or non-purchase of one item or itemset on the purchase or non-purchase of another item or itemset. The research in t...
Pradip Kumar Bala