98 search results - page 6 / 20 » Constraints as polymorphic connectors |
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
106
click to vote
CSL
2003
Springer
15 years 3 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
JCSS
2002
14 years 10 months ago
2002
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
185
Voted
POPL
2005
ACM
15 years 10 months ago
2005
ACM
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
APLAS
2005
ACM
15 years 4 months ago
2005
ACM
The formal core calculus .FJ has been introduced to model lightweight family polymorphism, a programming style to support reusable yet type-safe mutually recursive classes. This pa...