5130 search results - page 743 / 1026 » Constraint Query Languages |
204
click to vote
ICGI
2004
Springer
16 years 14 days ago
2004
Springer
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
192
click to vote
ECOOP
2003
Springer
16 years 9 days ago
2003
Springer
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
180
click to vote
ICALP
2010
Springer
15 years 12 months ago
2010
Springer
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...
202
click to vote
MPC
2010
Springer
15 years 12 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
183
click to vote
ECRTS
2000
IEEE
15 years 11 months ago
2000
IEEE
We present a tool for the design and validation of embedded real-time applications. The tool integrates two approaches, the use of the synchronous programming language ESTEREL for...