815 search results - page 129 / 163 » Algebraic Recognizability of Languages |
101
click to vote
EDBT
2006
ACM
15 years 3 months ago
2006
ACM
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...
101
click to vote
FLOPS
2008
Springer
15 years 1 months ago
2008
Springer
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
103
click to vote
FOIS
2006
15 years 1 months ago
2006
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
DS
2001
15 years 1 months ago
2001
We show how quantified constraints expressed in a sub-language of first-order logic, againstashareddatamodelthatisfreetoevolve, provideanexcellentwayof transporting domain-specific...
LFP
1990
15 years 29 days ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...