815 search results - page 111 / 163 » Algebraic Recognizability of Languages |
111
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
ADC
2006
Springer
15 years 3 months ago
2006
Springer
XML-based databases have become a major area of in database research. Abstractly speaking they can be considered as a resurrection of complexvalue databases using constructors for...
166
click to vote
FPCA
1995
15 years 3 months ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...
103
click to vote
FPCA
1995
15 years 3 months ago
1995
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
CAISE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Web services are increasingly used for building enterprise information systems according to the Service Oriented Architecture (Soa) paradigm. We propose in this paper a t...