2880 search results - page 482 / 576 » Types are calling conventions |
179
click to vote
ALT
1995
Springer
15 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
173
click to vote
CSFW
1995
IEEE
15 years 10 months ago
1995
IEEE
We investigate the formal relationship between separability of processes and the types of non-interference properties they enjoy. Though intuitively appealing, separability – th...
162
click to vote
ICDT
2010
ACM
15 years 9 months ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
145
click to vote
ICDT
2010
ACM
15 years 8 months ago
2010
ACM
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
175
click to vote
DLT
2007
15 years 7 months ago
2007
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...