7988 search results - page 63 / 1598 » A Useful Undecidable Theory |
ICDT
2007
ACM
14 years 3 months ago
2007
ACM
Abstract. A common approach to XML updates is to extend XQuery with update operations. This approach results in very expressive languages which are convenient for users but are dif...
RR
2007
Springer
14 years 3 months ago
2007
Springer
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...
WIA
2007
Springer
14 years 3 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
QSIC
2005
IEEE
14 years 2 months ago
2005
IEEE
Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime erro...
FOSSACS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...