1418 search results - page 176 / 284 » The Dynamic Complexity of Formal Languages |
140
click to vote
EMNLP
2008
15 years 6 months ago
2008
We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF gramm...
131
click to vote
JAR
2008
15 years 4 months ago
2008
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
155
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
255
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
164
click to vote
PODS
2008
ACM
16 years 4 months ago
2008
ACM
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...