16626 search results - page 384 / 3326 » Computing is a natural science |
201
click to vote
ICALP
2004
Springer
16 years 1 months ago
2004
Springer
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a c...
196
click to vote
JAPLL
2008
15 years 7 months ago
2008
Simple type theory, also known as higher-order logic, is a natural extension of first-order logic which is simple, elegant, highly expressive, and practical. This paper surveys th...
230
click to vote
LICS
2008
IEEE
16 years 2 months ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
213
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
192
click to vote
LICS
2006
IEEE
16 years 1 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...